./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-89.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-89.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 c364d5742786a109dce2eae30e32833d89e81ae3212872a34b0b87c86d2f2db6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:27:43,926 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:27:43,980 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:27:43,983 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:27:43,983 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:27:44,002 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:27:44,003 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:27:44,004 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:27:44,004 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:27:44,004 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:27:44,004 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:27:44,005 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:27:44,005 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:27:44,005 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:27:44,005 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:27:44,005 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:27:44,005 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:27:44,006 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:27:44,006 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:27:44,006 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:27:44,006 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:27:44,006 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:27:44,006 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:27:44,006 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:27:44,006 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:27:44,006 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:27:44,006 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:27:44,007 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:27:44,007 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:27:44,007 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:27:44,007 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:27:44,007 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:27:44,007 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:27:44,007 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:27:44,007 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:27:44,008 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:27:44,008 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:27:44,008 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:27:44,008 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:27:44,008 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:27:44,008 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:27:44,008 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:27:44,008 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:27:44,008 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 -> c364d5742786a109dce2eae30e32833d89e81ae3212872a34b0b87c86d2f2db6 [2025-03-08 15:27:44,216 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:27:44,223 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:27:44,225 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:27:44,225 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:27:44,226 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:27:44,227 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-89.i [2025-03-08 15:27:45,311 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff7472588/c6ffde9ee1a64d6e8c6ae0f460580e2f/FLAGe2e52be23 [2025-03-08 15:27:45,592 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:27:45,592 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-89.i [2025-03-08 15:27:45,625 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff7472588/c6ffde9ee1a64d6e8c6ae0f460580e2f/FLAGe2e52be23 [2025-03-08 15:27:45,640 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff7472588/c6ffde9ee1a64d6e8c6ae0f460580e2f [2025-03-08 15:27:45,643 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:27:45,645 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:27:45,646 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:27:45,646 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:27:45,649 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:27:45,652 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:27:45" (1/1) ... [2025-03-08 15:27:45,653 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ef3eaba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:27:45, skipping insertion in model container [2025-03-08 15:27:45,653 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:27:45" (1/1) ... [2025-03-08 15:27:45,677 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:27:45,784 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-89.i[916,929] [2025-03-08 15:27:45,893 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:27:45,902 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:27:45,910 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-89.i[916,929] [2025-03-08 15:27:45,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:27:45,984 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:27:45,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:27:45 WrapperNode [2025-03-08 15:27:45,985 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:27:45,986 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:27:45,986 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:27:45,986 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:27:45,991 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:27:45" (1/1) ... [2025-03-08 15:27:46,004 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:27:45" (1/1) ... [2025-03-08 15:27:46,040 INFO L138 Inliner]: procedures = 26, calls = 56, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 465 [2025-03-08 15:27:46,041 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:27:46,041 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:27:46,042 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:27:46,042 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:27:46,048 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:27:45" (1/1) ... [2025-03-08 15:27:46,048 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:27:45" (1/1) ... [2025-03-08 15:27:46,057 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:27:45" (1/1) ... [2025-03-08 15:27:46,080 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-08 15:27:46,080 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:27:45" (1/1) ... [2025-03-08 15:27:46,080 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:27:45" (1/1) ... [2025-03-08 15:27:46,100 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:27:45" (1/1) ... [2025-03-08 15:27:46,106 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:27:45" (1/1) ... [2025-03-08 15:27:46,111 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:27:45" (1/1) ... [2025-03-08 15:27:46,114 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:27:45" (1/1) ... [2025-03-08 15:27:46,122 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:27:46,124 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:27:46,124 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:27:46,124 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:27:46,125 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:27:45" (1/1) ... [2025-03-08 15:27:46,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:27:46,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:27:46,155 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-08 15:27:46,166 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-08 15:27:46,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:27:46,184 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:27:46,184 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:27:46,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:27:46,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:27:46,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:27:46,262 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:27:46,264 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:27:46,838 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L364: havoc property_#t~bitwise35#1;havoc property_#t~short36#1;havoc property_#t~bitwise37#1;havoc property_#t~short38#1;havoc property_#t~short39#1;havoc property_#t~bitwise40#1;havoc property_#t~short41#1;havoc property_#t~ite43#1;havoc property_#t~bitwise42#1;havoc property_#t~short44#1;havoc property_#t~bitwise45#1;havoc property_#t~short46#1; [2025-03-08 15:27:46,894 INFO L? ?]: Removed 63 outVars from TransFormulas that were not future-live. [2025-03-08 15:27:46,895 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:27:46,918 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:27:46,919 INFO L336 CfgBuilder]: Removed 4 assume(true) statements. [2025-03-08 15:27:46,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:27:46 BoogieIcfgContainer [2025-03-08 15:27:46,920 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:27:46,922 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:27:46,922 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:27:46,925 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:27:46,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:27:45" (1/3) ... [2025-03-08 15:27:46,926 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72b7b42b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:27:46, skipping insertion in model container [2025-03-08 15:27:46,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:27:45" (2/3) ... [2025-03-08 15:27:46,926 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72b7b42b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:27:46, skipping insertion in model container [2025-03-08 15:27:46,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:27:46" (3/3) ... [2025-03-08 15:27:46,927 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-89.i [2025-03-08 15:27:46,937 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:27:46,939 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-89.i that has 2 procedures, 194 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:27:46,983 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:27:46,993 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;@25f5c2d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:27:46,994 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:27:46,998 INFO L276 IsEmpty]: Start isEmpty. Operand has 194 states, 148 states have (on average 1.5202702702702702) internal successors, (225), 149 states have internal predecessors, (225), 43 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-08 15:27:47,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-03-08 15:27:47,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:27:47,016 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:27:47,017 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:27:47,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:27:47,021 INFO L85 PathProgramCache]: Analyzing trace with hash 2032917195, now seen corresponding path program 1 times [2025-03-08 15:27:47,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:27:47,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433192677] [2025-03-08 15:27:47,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:27:47,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:27:47,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-03-08 15:27:47,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-03-08 15:27:47,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:27:47,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:27:47,396 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 3528 trivial. 0 not checked. [2025-03-08 15:27:47,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:27:47,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433192677] [2025-03-08 15:27:47,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433192677] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:27:47,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288896439] [2025-03-08 15:27:47,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:27:47,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:27:47,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:27:47,400 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-08 15:27:47,401 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-08 15:27:47,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-03-08 15:27:47,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-03-08 15:27:47,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:27:47,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:27:47,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 714 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:27:47,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:27:47,671 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 3528 trivial. 0 not checked. [2025-03-08 15:27:47,674 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:27:47,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288896439] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:27:47,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:27:47,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:27:47,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932227288] [2025-03-08 15:27:47,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:27:47,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:27:47,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:27:47,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:27:47,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:27:47,700 INFO L87 Difference]: Start difference. First operand has 194 states, 148 states have (on average 1.5202702702702702) internal successors, (225), 149 states have internal predecessors, (225), 43 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) Second operand has 2 states, 2 states have (on average 44.0) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (43), 2 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 2 states have call successors, (43) [2025-03-08 15:27:47,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:27:47,751 INFO L93 Difference]: Finished difference Result 382 states and 660 transitions. [2025-03-08 15:27:47,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:27:47,753 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 44.0) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (43), 2 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 2 states have call successors, (43) Word has length 298 [2025-03-08 15:27:47,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:27:47,759 INFO L225 Difference]: With dead ends: 382 [2025-03-08 15:27:47,761 INFO L226 Difference]: Without dead ends: 191 [2025-03-08 15:27:47,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 299 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-08 15:27:47,766 INFO L435 NwaCegarLoop]: 296 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:27:47,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 296 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:27:47,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-03-08 15:27:47,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2025-03-08 15:27:47,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 146 states have (on average 1.5068493150684932) internal successors, (220), 146 states have internal predecessors, (220), 43 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-08 15:27:47,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 306 transitions. [2025-03-08 15:27:47,812 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 306 transitions. Word has length 298 [2025-03-08 15:27:47,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:27:47,813 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 306 transitions. [2025-03-08 15:27:47,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 44.0) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (43), 2 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 2 states have call successors, (43) [2025-03-08 15:27:47,814 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 306 transitions. [2025-03-08 15:27:47,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-03-08 15:27:47,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:27:47,818 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:27:47,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 15:27:48,019 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-08 15:27:48,019 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:27:48,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:27:48,020 INFO L85 PathProgramCache]: Analyzing trace with hash 380920658, now seen corresponding path program 1 times [2025-03-08 15:27:48,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:27:48,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21049040] [2025-03-08 15:27:48,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:27:48,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:27:48,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-03-08 15:27:48,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-03-08 15:27:48,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:27:48,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:27:48,314 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-08 15:27:48,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:27:48,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21049040] [2025-03-08 15:27:48,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21049040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:27:48,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:27:48,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:27:48,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530688394] [2025-03-08 15:27:48,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:27:48,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:27:48,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:27:48,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:27:48,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:27:48,318 INFO L87 Difference]: Start difference. First operand 191 states and 306 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-08 15:27:48,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:27:48,442 INFO L93 Difference]: Finished difference Result 476 states and 760 transitions. [2025-03-08 15:27:48,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:27:48,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 298 [2025-03-08 15:27:48,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:27:48,446 INFO L225 Difference]: With dead ends: 476 [2025-03-08 15:27:48,448 INFO L226 Difference]: Without dead ends: 288 [2025-03-08 15:27:48,449 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-08 15:27:48,451 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 149 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:27:48,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 556 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:27:48,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-03-08 15:27:48,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 285. [2025-03-08 15:27:48,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 233 states have (on average 1.51931330472103) internal successors, (354), 234 states have internal predecessors, (354), 49 states have call successors, (49), 2 states have call predecessors, (49), 2 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-08 15:27:48,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 452 transitions. [2025-03-08 15:27:48,484 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 452 transitions. Word has length 298 [2025-03-08 15:27:48,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:27:48,486 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 452 transitions. [2025-03-08 15:27:48,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-08 15:27:48,486 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 452 transitions. [2025-03-08 15:27:48,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-03-08 15:27:48,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:27:48,491 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:27:48,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:27:48,491 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:27:48,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:27:48,492 INFO L85 PathProgramCache]: Analyzing trace with hash -518214036, now seen corresponding path program 1 times [2025-03-08 15:27:48,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:27:48,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547495793] [2025-03-08 15:27:48,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:27:48,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:27:48,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-03-08 15:27:48,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-03-08 15:27:48,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:27:48,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:27:48,773 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-08 15:27:48,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:27:48,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547495793] [2025-03-08 15:27:48,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547495793] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:27:48,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:27:48,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:27:48,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463234516] [2025-03-08 15:27:48,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:27:48,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:27:48,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:27:48,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:27:48,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:27:48,778 INFO L87 Difference]: Start difference. First operand 285 states and 452 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-08 15:27:48,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:27:48,878 INFO L93 Difference]: Finished difference Result 773 states and 1222 transitions. [2025-03-08 15:27:48,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:27:48,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 298 [2025-03-08 15:27:48,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:27:48,886 INFO L225 Difference]: With dead ends: 773 [2025-03-08 15:27:48,886 INFO L226 Difference]: Without dead ends: 491 [2025-03-08 15:27:48,888 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-08 15:27:48,888 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 157 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:27:48,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 553 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:27:48,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2025-03-08 15:27:48,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 487. [2025-03-08 15:27:48,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 425 states have (on average 1.5294117647058822) internal successors, (650), 428 states have internal predecessors, (650), 57 states have call successors, (57), 4 states have call predecessors, (57), 4 states have return successors, (57), 54 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-08 15:27:48,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 764 transitions. [2025-03-08 15:27:48,928 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 764 transitions. Word has length 298 [2025-03-08 15:27:48,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:27:48,930 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 764 transitions. [2025-03-08 15:27:48,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-08 15:27:48,930 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 764 transitions. [2025-03-08 15:27:48,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-03-08 15:27:48,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:27:48,935 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:27:48,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 15:27:48,935 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:27:48,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:27:48,936 INFO L85 PathProgramCache]: Analyzing trace with hash -541762925, now seen corresponding path program 1 times [2025-03-08 15:27:48,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:27:48,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778223006] [2025-03-08 15:27:48,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:27:48,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:27:48,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-03-08 15:27:49,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-03-08 15:27:49,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:27:49,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:27:49,244 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-08 15:27:49,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:27:49,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778223006] [2025-03-08 15:27:49,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778223006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:27:49,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:27:49,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:27:49,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587821370] [2025-03-08 15:27:49,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:27:49,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:27:49,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:27:49,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:27:49,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:27:49,250 INFO L87 Difference]: Start difference. First operand 487 states and 764 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-08 15:27:49,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:27:49,389 INFO L93 Difference]: Finished difference Result 1351 states and 2116 transitions. [2025-03-08 15:27:49,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:27:49,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 298 [2025-03-08 15:27:49,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:27:49,397 INFO L225 Difference]: With dead ends: 1351 [2025-03-08 15:27:49,397 INFO L226 Difference]: Without dead ends: 867 [2025-03-08 15:27:49,398 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-08 15:27:49,399 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 230 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:27:49,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 738 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:27:49,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2025-03-08 15:27:49,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 685. [2025-03-08 15:27:49,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 623 states have (on average 1.5553772070626004) internal successors, (969), 626 states have internal predecessors, (969), 57 states have call successors, (57), 4 states have call predecessors, (57), 4 states have return successors, (57), 54 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-08 15:27:49,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1083 transitions. [2025-03-08 15:27:49,442 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 1083 transitions. Word has length 298 [2025-03-08 15:27:49,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:27:49,443 INFO L471 AbstractCegarLoop]: Abstraction has 685 states and 1083 transitions. [2025-03-08 15:27:49,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-08 15:27:49,443 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1083 transitions. [2025-03-08 15:27:49,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-03-08 15:27:49,447 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:27:49,447 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:27:49,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 15:27:49,447 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:27:49,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:27:49,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1271409796, now seen corresponding path program 1 times [2025-03-08 15:27:49,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:27:49,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244049003] [2025-03-08 15:27:49,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:27:49,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:27:49,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-03-08 15:27:49,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-03-08 15:27:49,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:27:49,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:27:49,693 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-08 15:27:49,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:27:49,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244049003] [2025-03-08 15:27:49,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244049003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:27:49,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:27:49,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:27:49,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758808815] [2025-03-08 15:27:49,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:27:49,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:27:49,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:27:49,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:27:49,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:27:49,696 INFO L87 Difference]: Start difference. First operand 685 states and 1083 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-08 15:27:49,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:27:49,797 INFO L93 Difference]: Finished difference Result 1909 states and 3014 transitions. [2025-03-08 15:27:49,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:27:49,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 299 [2025-03-08 15:27:49,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:27:49,802 INFO L225 Difference]: With dead ends: 1909 [2025-03-08 15:27:49,802 INFO L226 Difference]: Without dead ends: 1227 [2025-03-08 15:27:49,804 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-08 15:27:49,804 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 131 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:27:49,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 556 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:27:49,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2025-03-08 15:27:49,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 1221. [2025-03-08 15:27:49,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1221 states, 1147 states have (on average 1.5510026155187446) internal successors, (1779), 1154 states have internal predecessors, (1779), 65 states have call successors, (65), 8 states have call predecessors, (65), 8 states have return successors, (65), 58 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-08 15:27:49,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 1909 transitions. [2025-03-08 15:27:49,854 INFO L78 Accepts]: Start accepts. Automaton has 1221 states and 1909 transitions. Word has length 299 [2025-03-08 15:27:49,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:27:49,856 INFO L471 AbstractCegarLoop]: Abstraction has 1221 states and 1909 transitions. [2025-03-08 15:27:49,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-08 15:27:49,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 1909 transitions. [2025-03-08 15:27:49,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-03-08 15:27:49,860 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:27:49,860 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:27:49,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 15:27:49,862 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:27:49,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:27:49,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1260093669, now seen corresponding path program 1 times [2025-03-08 15:27:49,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:27:49,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609481921] [2025-03-08 15:27:49,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:27:49,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:27:49,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-03-08 15:27:50,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-03-08 15:27:50,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:27:50,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:27:51,501 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-08 15:27:51,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:27:51,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609481921] [2025-03-08 15:27:51,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609481921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:27:51,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:27:51,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 15:27:51,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417582973] [2025-03-08 15:27:51,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:27:51,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 15:27:51,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:27:51,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 15:27:51,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:27:51,504 INFO L87 Difference]: Start difference. First operand 1221 states and 1909 transitions. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-08 15:27:52,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:27:52,266 INFO L93 Difference]: Finished difference Result 3482 states and 5440 transitions. [2025-03-08 15:27:52,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 15:27:52,266 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 299 [2025-03-08 15:27:52,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:27:52,276 INFO L225 Difference]: With dead ends: 3482 [2025-03-08 15:27:52,276 INFO L226 Difference]: Without dead ends: 2264 [2025-03-08 15:27:52,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-08 15:27:52,280 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 669 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 15:27:52,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 1043 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 15:27:52,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2264 states. [2025-03-08 15:27:52,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2264 to 1539. [2025-03-08 15:27:52,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1539 states, 1465 states have (on average 1.569283276450512) internal successors, (2299), 1472 states have internal predecessors, (2299), 65 states have call successors, (65), 8 states have call predecessors, (65), 8 states have return successors, (65), 58 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-08 15:27:52,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1539 states to 1539 states and 2429 transitions. [2025-03-08 15:27:52,335 INFO L78 Accepts]: Start accepts. Automaton has 1539 states and 2429 transitions. Word has length 299 [2025-03-08 15:27:52,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:27:52,335 INFO L471 AbstractCegarLoop]: Abstraction has 1539 states and 2429 transitions. [2025-03-08 15:27:52,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-08 15:27:52,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1539 states and 2429 transitions. [2025-03-08 15:27:52,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2025-03-08 15:27:52,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:27:52,341 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:27:52,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 15:27:52,341 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:27:52,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:27:52,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1154854719, now seen corresponding path program 1 times [2025-03-08 15:27:52,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:27:52,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776532702] [2025-03-08 15:27:52,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:27:52,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:27:52,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 300 statements into 1 equivalence classes. [2025-03-08 15:27:52,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 300 of 300 statements. [2025-03-08 15:27:52,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:27:52,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:27:52,828 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-08 15:27:52,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:27:52,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776532702] [2025-03-08 15:27:52,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776532702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:27:52,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:27:52,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:27:52,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722276995] [2025-03-08 15:27:52,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:27:52,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:27:52,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:27:52,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:27:52,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:27:52,830 INFO L87 Difference]: Start difference. First operand 1539 states and 2429 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-08 15:27:53,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:27:53,203 INFO L93 Difference]: Finished difference Result 5973 states and 9446 transitions. [2025-03-08 15:27:53,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:27:53,204 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 300 [2025-03-08 15:27:53,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:27:53,219 INFO L225 Difference]: With dead ends: 5973 [2025-03-08 15:27:53,219 INFO L226 Difference]: Without dead ends: 4437 [2025-03-08 15:27:53,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:27:53,224 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 545 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:27:53,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 810 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:27:53,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4437 states. [2025-03-08 15:27:53,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4437 to 3069. [2025-03-08 15:27:53,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3069 states, 2922 states have (on average 1.568788501026694) internal successors, (4584), 2936 states have internal predecessors, (4584), 130 states have call successors, (130), 16 states have call predecessors, (130), 16 states have return successors, (130), 116 states have call predecessors, (130), 130 states have call successors, (130) [2025-03-08 15:27:53,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3069 states to 3069 states and 4844 transitions. [2025-03-08 15:27:53,327 INFO L78 Accepts]: Start accepts. Automaton has 3069 states and 4844 transitions. Word has length 300 [2025-03-08 15:27:53,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:27:53,328 INFO L471 AbstractCegarLoop]: Abstraction has 3069 states and 4844 transitions. [2025-03-08 15:27:53,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-08 15:27:53,328 INFO L276 IsEmpty]: Start isEmpty. Operand 3069 states and 4844 transitions. [2025-03-08 15:27:53,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2025-03-08 15:27:53,336 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:27:53,336 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:27:53,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 15:27:53,336 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:27:53,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:27:53,337 INFO L85 PathProgramCache]: Analyzing trace with hash 816084738, now seen corresponding path program 1 times [2025-03-08 15:27:53,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:27:53,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204789764] [2025-03-08 15:27:53,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:27:53,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:27:53,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 300 statements into 1 equivalence classes. [2025-03-08 15:27:53,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 300 of 300 statements. [2025-03-08 15:27:53,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:27:53,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:27:53,698 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-08 15:27:53,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:27:53,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204789764] [2025-03-08 15:27:53,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204789764] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:27:53,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:27:53,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:27:53,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331517902] [2025-03-08 15:27:53,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:27:53,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:27:53,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:27:53,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:27:53,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:27:53,700 INFO L87 Difference]: Start difference. First operand 3069 states and 4844 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-08 15:27:53,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:27:53,832 INFO L93 Difference]: Finished difference Result 6165 states and 9726 transitions. [2025-03-08 15:27:53,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:27:53,834 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 300 [2025-03-08 15:27:53,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:27:53,847 INFO L225 Difference]: With dead ends: 6165 [2025-03-08 15:27:53,847 INFO L226 Difference]: Without dead ends: 3099 [2025-03-08 15:27:53,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:27:53,852 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 157 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:27:53,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 834 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:27:53,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3099 states. [2025-03-08 15:27:53,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3099 to 3081. [2025-03-08 15:27:53,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3081 states, 2934 states have (on average 1.5664621676891615) internal successors, (4596), 2948 states have internal predecessors, (4596), 130 states have call successors, (130), 16 states have call predecessors, (130), 16 states have return successors, (130), 116 states have call predecessors, (130), 130 states have call successors, (130) [2025-03-08 15:27:53,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3081 states to 3081 states and 4856 transitions. [2025-03-08 15:27:53,939 INFO L78 Accepts]: Start accepts. Automaton has 3081 states and 4856 transitions. Word has length 300 [2025-03-08 15:27:53,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:27:53,940 INFO L471 AbstractCegarLoop]: Abstraction has 3081 states and 4856 transitions. [2025-03-08 15:27:53,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-08 15:27:53,941 INFO L276 IsEmpty]: Start isEmpty. Operand 3081 states and 4856 transitions. [2025-03-08 15:27:53,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2025-03-08 15:27:53,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:27:53,948 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:27:53,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 15:27:53,948 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:27:53,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:27:53,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1598164672, now seen corresponding path program 1 times [2025-03-08 15:27:53,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:27:53,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736152366] [2025-03-08 15:27:53,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:27:53,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:27:53,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-03-08 15:27:54,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-03-08 15:27:54,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:27:54,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:27:54,328 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-08 15:27:54,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:27:54,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736152366] [2025-03-08 15:27:54,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736152366] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:27:54,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:27:54,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:27:54,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687075932] [2025-03-08 15:27:54,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:27:54,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:27:54,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:27:54,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:27:54,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:27:54,332 INFO L87 Difference]: Start difference. First operand 3081 states and 4856 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-08 15:27:54,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:27:54,556 INFO L93 Difference]: Finished difference Result 6193 states and 9759 transitions. [2025-03-08 15:27:54,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:27:54,558 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 301 [2025-03-08 15:27:54,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:27:54,570 INFO L225 Difference]: With dead ends: 6193 [2025-03-08 15:27:54,570 INFO L226 Difference]: Without dead ends: 3115 [2025-03-08 15:27:54,574 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-08 15:27:54,575 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 137 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:27:54,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 869 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:27:54,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3115 states. [2025-03-08 15:27:54,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3115 to 3097. [2025-03-08 15:27:54,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3097 states, 2950 states have (on average 1.5633898305084746) internal successors, (4612), 2964 states have internal predecessors, (4612), 130 states have call successors, (130), 16 states have call predecessors, (130), 16 states have return successors, (130), 116 states have call predecessors, (130), 130 states have call successors, (130) [2025-03-08 15:27:54,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3097 states to 3097 states and 4872 transitions. [2025-03-08 15:27:54,688 INFO L78 Accepts]: Start accepts. Automaton has 3097 states and 4872 transitions. Word has length 301 [2025-03-08 15:27:54,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:27:54,689 INFO L471 AbstractCegarLoop]: Abstraction has 3097 states and 4872 transitions. [2025-03-08 15:27:54,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-08 15:27:54,690 INFO L276 IsEmpty]: Start isEmpty. Operand 3097 states and 4872 transitions. [2025-03-08 15:27:54,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2025-03-08 15:27:54,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:27:54,697 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:27:54,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 15:27:54,697 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:27:54,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:27:54,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1038046481, now seen corresponding path program 1 times [2025-03-08 15:27:54,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:27:54,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632582376] [2025-03-08 15:27:54,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:27:54,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:27:54,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-03-08 15:27:54,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-03-08 15:27:54,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:27:54,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:27:56,359 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-08 15:27:56,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:27:56,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632582376] [2025-03-08 15:27:56,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632582376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:27:56,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:27:56,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 15:27:56,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650885755] [2025-03-08 15:27:56,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:27:56,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 15:27:56,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:27:56,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 15:27:56,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 15:27:56,361 INFO L87 Difference]: Start difference. First operand 3097 states and 4872 transitions. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-08 15:27:57,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:27:57,458 INFO L93 Difference]: Finished difference Result 15727 states and 24199 transitions. [2025-03-08 15:27:57,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 15:27:57,459 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 301 [2025-03-08 15:27:57,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:27:57,504 INFO L225 Difference]: With dead ends: 15727 [2025-03-08 15:27:57,505 INFO L226 Difference]: Without dead ends: 12633 [2025-03-08 15:27:57,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2025-03-08 15:27:57,516 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 1765 mSDsluCounter, 1557 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1765 SdHoareTripleChecker+Valid, 1903 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 15:27:57,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1765 Valid, 1903 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 15:27:57,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12633 states. [2025-03-08 15:27:57,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12633 to 7025. [2025-03-08 15:27:57,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7025 states, 6732 states have (on average 1.566250742721331) internal successors, (10544), 6760 states have internal predecessors, (10544), 260 states have call successors, (260), 32 states have call predecessors, (260), 32 states have return successors, (260), 232 states have call predecessors, (260), 260 states have call successors, (260) [2025-03-08 15:27:57,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7025 states to 7025 states and 11064 transitions. [2025-03-08 15:27:57,789 INFO L78 Accepts]: Start accepts. Automaton has 7025 states and 11064 transitions. Word has length 301 [2025-03-08 15:27:57,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:27:57,791 INFO L471 AbstractCegarLoop]: Abstraction has 7025 states and 11064 transitions. [2025-03-08 15:27:57,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-08 15:27:57,791 INFO L276 IsEmpty]: Start isEmpty. Operand 7025 states and 11064 transitions. [2025-03-08 15:27:57,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2025-03-08 15:27:57,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:27:57,800 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:27:57,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 15:27:57,801 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:27:57,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:27:57,802 INFO L85 PathProgramCache]: Analyzing trace with hash -687246544, now seen corresponding path program 1 times [2025-03-08 15:27:57,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:27:57,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271440860] [2025-03-08 15:27:57,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:27:57,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:27:57,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-03-08 15:27:57,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-03-08 15:27:57,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:27:57,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:27:58,851 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-08 15:27:58,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:27:58,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271440860] [2025-03-08 15:27:58,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271440860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:27:58,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:27:58,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 15:27:58,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736892837] [2025-03-08 15:27:58,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:27:58,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 15:27:58,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:27:58,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 15:27:58,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:27:58,853 INFO L87 Difference]: Start difference. First operand 7025 states and 11064 transitions. Second operand has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-08 15:27:59,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:27:59,551 INFO L93 Difference]: Finished difference Result 23851 states and 37411 transitions. [2025-03-08 15:27:59,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 15:27:59,552 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 301 [2025-03-08 15:27:59,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:27:59,589 INFO L225 Difference]: With dead ends: 23851 [2025-03-08 15:27:59,590 INFO L226 Difference]: Without dead ends: 16829 [2025-03-08 15:27:59,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-03-08 15:27:59,606 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 450 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:27:59,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 1039 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 15:27:59,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16829 states. [2025-03-08 15:27:59,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16829 to 9865. [2025-03-08 15:27:59,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9865 states, 9572 states have (on average 1.6067697450898455) internal successors, (15380), 9600 states have internal predecessors, (15380), 260 states have call successors, (260), 32 states have call predecessors, (260), 32 states have return successors, (260), 232 states have call predecessors, (260), 260 states have call successors, (260) [2025-03-08 15:27:59,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9865 states to 9865 states and 15900 transitions. [2025-03-08 15:27:59,955 INFO L78 Accepts]: Start accepts. Automaton has 9865 states and 15900 transitions. Word has length 301 [2025-03-08 15:27:59,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:27:59,956 INFO L471 AbstractCegarLoop]: Abstraction has 9865 states and 15900 transitions. [2025-03-08 15:27:59,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-08 15:27:59,957 INFO L276 IsEmpty]: Start isEmpty. Operand 9865 states and 15900 transitions. [2025-03-08 15:27:59,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-03-08 15:27:59,972 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:27:59,972 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:27:59,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 15:27:59,973 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:27:59,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:27:59,974 INFO L85 PathProgramCache]: Analyzing trace with hash -452615126, now seen corresponding path program 1 times [2025-03-08 15:27:59,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:27:59,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633499246] [2025-03-08 15:27:59,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:27:59,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:27:59,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-03-08 15:28:00,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-03-08 15:28:00,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:28:00,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:28:00,285 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-08 15:28:00,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:28:00,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633499246] [2025-03-08 15:28:00,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633499246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:28:00,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:28:00,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:28:00,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146068047] [2025-03-08 15:28:00,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:28:00,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:28:00,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:28:00,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:28:00,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:28:00,288 INFO L87 Difference]: Start difference. First operand 9865 states and 15900 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-08 15:28:00,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:28:00,679 INFO L93 Difference]: Finished difference Result 22501 states and 36001 transitions. [2025-03-08 15:28:00,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:28:00,680 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 302 [2025-03-08 15:28:00,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:28:00,706 INFO L225 Difference]: With dead ends: 22501 [2025-03-08 15:28:00,706 INFO L226 Difference]: Without dead ends: 12639 [2025-03-08 15:28:00,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:28:00,718 INFO L435 NwaCegarLoop]: 315 mSDtfsCounter, 411 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:28:00,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 990 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:28:00,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12639 states. [2025-03-08 15:28:00,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12639 to 11985. [2025-03-08 15:28:00,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11985 states, 11692 states have (on average 1.593226137529935) internal successors, (18628), 11720 states have internal predecessors, (18628), 260 states have call successors, (260), 32 states have call predecessors, (260), 32 states have return successors, (260), 232 states have call predecessors, (260), 260 states have call successors, (260) [2025-03-08 15:28:00,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11985 states to 11985 states and 19148 transitions. [2025-03-08 15:28:00,931 INFO L78 Accepts]: Start accepts. Automaton has 11985 states and 19148 transitions. Word has length 302 [2025-03-08 15:28:00,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:28:00,931 INFO L471 AbstractCegarLoop]: Abstraction has 11985 states and 19148 transitions. [2025-03-08 15:28:00,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-08 15:28:00,932 INFO L276 IsEmpty]: Start isEmpty. Operand 11985 states and 19148 transitions. [2025-03-08 15:28:00,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-03-08 15:28:00,946 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:28:00,946 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:28:00,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 15:28:00,947 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:28:00,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:28:00,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1908529283, now seen corresponding path program 1 times [2025-03-08 15:28:00,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:28:00,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120892160] [2025-03-08 15:28:00,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:28:00,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:28:00,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-03-08 15:28:01,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-03-08 15:28:01,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:28:01,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:28:02,482 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-08 15:28:02,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:28:02,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120892160] [2025-03-08 15:28:02,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120892160] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:28:02,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:28:02,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 15:28:02,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616699530] [2025-03-08 15:28:02,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:28:02,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 15:28:02,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:28:02,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 15:28:02,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:28:02,484 INFO L87 Difference]: Start difference. First operand 11985 states and 19148 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-08 15:28:03,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:28:03,400 INFO L93 Difference]: Finished difference Result 32319 states and 51331 transitions. [2025-03-08 15:28:03,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 15:28:03,401 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 302 [2025-03-08 15:28:03,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:28:03,446 INFO L225 Difference]: With dead ends: 32319 [2025-03-08 15:28:03,446 INFO L226 Difference]: Without dead ends: 20337 [2025-03-08 15:28:03,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-03-08 15:28:03,469 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 382 mSDsluCounter, 992 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 1365 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 15:28:03,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 1365 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 15:28:03,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20337 states. [2025-03-08 15:28:03,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20337 to 11985. [2025-03-08 15:28:03,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11985 states, 11692 states have (on average 1.593226137529935) internal successors, (18628), 11720 states have internal predecessors, (18628), 260 states have call successors, (260), 32 states have call predecessors, (260), 32 states have return successors, (260), 232 states have call predecessors, (260), 260 states have call successors, (260) [2025-03-08 15:28:03,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11985 states to 11985 states and 19148 transitions. [2025-03-08 15:28:03,746 INFO L78 Accepts]: Start accepts. Automaton has 11985 states and 19148 transitions. Word has length 302 [2025-03-08 15:28:03,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:28:03,747 INFO L471 AbstractCegarLoop]: Abstraction has 11985 states and 19148 transitions. [2025-03-08 15:28:03,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-08 15:28:03,747 INFO L276 IsEmpty]: Start isEmpty. Operand 11985 states and 19148 transitions. [2025-03-08 15:28:03,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-03-08 15:28:03,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:28:03,762 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:28:03,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 15:28:03,763 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:28:03,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:28:03,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1459832644, now seen corresponding path program 1 times [2025-03-08 15:28:03,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:28:03,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597201465] [2025-03-08 15:28:03,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:28:03,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:28:03,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-03-08 15:28:03,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-03-08 15:28:03,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:28:03,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:28:04,017 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-08 15:28:04,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:28:04,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597201465] [2025-03-08 15:28:04,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597201465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:28:04,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:28:04,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:28:04,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358896662] [2025-03-08 15:28:04,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:28:04,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:28:04,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:28:04,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:28:04,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:28:04,020 INFO L87 Difference]: Start difference. First operand 11985 states and 19148 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-08 15:28:04,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:28:04,350 INFO L93 Difference]: Finished difference Result 28811 states and 45419 transitions. [2025-03-08 15:28:04,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:28:04,350 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 302 [2025-03-08 15:28:04,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:28:04,382 INFO L225 Difference]: With dead ends: 28811 [2025-03-08 15:28:04,382 INFO L226 Difference]: Without dead ends: 16789 [2025-03-08 15:28:04,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:28:04,400 INFO L435 NwaCegarLoop]: 359 mSDtfsCounter, 291 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:28:04,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 915 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:28:04,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16789 states. [2025-03-08 15:28:04,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16789 to 13765. [2025-03-08 15:28:04,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13765 states, 13472 states have (on average 1.5620546318289785) internal successors, (21044), 13500 states have internal predecessors, (21044), 260 states have call successors, (260), 32 states have call predecessors, (260), 32 states have return successors, (260), 232 states have call predecessors, (260), 260 states have call successors, (260) [2025-03-08 15:28:04,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13765 states to 13765 states and 21564 transitions. [2025-03-08 15:28:04,631 INFO L78 Accepts]: Start accepts. Automaton has 13765 states and 21564 transitions. Word has length 302 [2025-03-08 15:28:04,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:28:04,632 INFO L471 AbstractCegarLoop]: Abstraction has 13765 states and 21564 transitions. [2025-03-08 15:28:04,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-08 15:28:04,632 INFO L276 IsEmpty]: Start isEmpty. Operand 13765 states and 21564 transitions. [2025-03-08 15:28:04,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-03-08 15:28:04,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:28:04,679 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:28:04,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 15:28:04,679 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:28:04,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:28:04,680 INFO L85 PathProgramCache]: Analyzing trace with hash -775401118, now seen corresponding path program 1 times [2025-03-08 15:28:04,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:28:04,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965405702] [2025-03-08 15:28:04,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:28:04,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:28:04,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-03-08 15:28:04,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-03-08 15:28:04,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:28:04,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:28:05,175 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-08 15:28:05,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:28:05,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965405702] [2025-03-08 15:28:05,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965405702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:28:05,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:28:05,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:28:05,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74719583] [2025-03-08 15:28:05,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:28:05,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:28:05,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:28:05,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:28:05,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:28:05,176 INFO L87 Difference]: Start difference. First operand 13765 states and 21564 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-08 15:28:05,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:28:05,747 INFO L93 Difference]: Finished difference Result 38201 states and 59842 transitions. [2025-03-08 15:28:05,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:28:05,748 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 302 [2025-03-08 15:28:05,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:28:05,794 INFO L225 Difference]: With dead ends: 38201 [2025-03-08 15:28:05,794 INFO L226 Difference]: Without dead ends: 24439 [2025-03-08 15:28:05,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:28:05,811 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 195 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:28:05,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 1210 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:28:05,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24439 states. [2025-03-08 15:28:06,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24439 to 12749. [2025-03-08 15:28:06,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12749 states, 12456 states have (on average 1.5706486833654463) internal successors, (19564), 12484 states have internal predecessors, (19564), 260 states have call successors, (260), 32 states have call predecessors, (260), 32 states have return successors, (260), 232 states have call predecessors, (260), 260 states have call successors, (260) [2025-03-08 15:28:06,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12749 states to 12749 states and 20084 transitions. [2025-03-08 15:28:06,059 INFO L78 Accepts]: Start accepts. Automaton has 12749 states and 20084 transitions. Word has length 302 [2025-03-08 15:28:06,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:28:06,060 INFO L471 AbstractCegarLoop]: Abstraction has 12749 states and 20084 transitions. [2025-03-08 15:28:06,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-08 15:28:06,060 INFO L276 IsEmpty]: Start isEmpty. Operand 12749 states and 20084 transitions. [2025-03-08 15:28:06,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-03-08 15:28:06,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:28:06,073 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:28:06,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 15:28:06,073 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:28:06,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:28:06,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1756088248, now seen corresponding path program 1 times [2025-03-08 15:28:06,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:28:06,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490013417] [2025-03-08 15:28:06,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:28:06,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:28:06,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-03-08 15:28:06,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-03-08 15:28:06,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:28:06,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:28:06,149 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-08 15:28:06,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:28:06,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490013417] [2025-03-08 15:28:06,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490013417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:28:06,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:28:06,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:28:06,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509200176] [2025-03-08 15:28:06,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:28:06,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:28:06,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:28:06,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:28:06,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:28:06,151 INFO L87 Difference]: Start difference. First operand 12749 states and 20084 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-08 15:28:06,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:28:06,349 INFO L93 Difference]: Finished difference Result 27005 states and 42278 transitions. [2025-03-08 15:28:06,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:28:06,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 302 [2025-03-08 15:28:06,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:28:06,372 INFO L225 Difference]: With dead ends: 27005 [2025-03-08 15:28:06,372 INFO L226 Difference]: Without dead ends: 14259 [2025-03-08 15:28:06,385 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-08 15:28:06,386 INFO L435 NwaCegarLoop]: 408 mSDtfsCounter, 177 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:28:06,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 676 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:28:06,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14259 states. [2025-03-08 15:28:06,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14259 to 11733. [2025-03-08 15:28:06,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11733 states, 11508 states have (on average 1.583594021550226) internal successors, (18224), 11520 states have internal predecessors, (18224), 204 states have call successors, (204), 20 states have call predecessors, (204), 20 states have return successors, (204), 192 states have call predecessors, (204), 204 states have call successors, (204) [2025-03-08 15:28:06,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11733 states to 11733 states and 18632 transitions. [2025-03-08 15:28:06,664 INFO L78 Accepts]: Start accepts. Automaton has 11733 states and 18632 transitions. Word has length 302 [2025-03-08 15:28:06,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:28:06,666 INFO L471 AbstractCegarLoop]: Abstraction has 11733 states and 18632 transitions. [2025-03-08 15:28:06,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-08 15:28:06,667 INFO L276 IsEmpty]: Start isEmpty. Operand 11733 states and 18632 transitions. [2025-03-08 15:28:06,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-03-08 15:28:06,678 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:28:06,678 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:28:06,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 15:28:06,678 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:28:06,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:28:06,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1641152038, now seen corresponding path program 1 times [2025-03-08 15:28:06,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:28:06,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133907092] [2025-03-08 15:28:06,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:28:06,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:28:06,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-03-08 15:28:06,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-03-08 15:28:06,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:28:06,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:28:07,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-08 15:28:07,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:28:07,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133907092] [2025-03-08 15:28:07,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133907092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:28:07,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:28:07,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 15:28:07,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216489327] [2025-03-08 15:28:07,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:28:07,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 15:28:07,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:28:07,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 15:28:07,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:28:07,730 INFO L87 Difference]: Start difference. First operand 11733 states and 18632 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-08 15:28:08,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:28:08,774 INFO L93 Difference]: Finished difference Result 31859 states and 50277 transitions. [2025-03-08 15:28:08,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 15:28:08,775 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 302 [2025-03-08 15:28:08,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:28:08,804 INFO L225 Difference]: With dead ends: 31859 [2025-03-08 15:28:08,804 INFO L226 Difference]: Without dead ends: 20129 [2025-03-08 15:28:08,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-08 15:28:08,820 INFO L435 NwaCegarLoop]: 414 mSDtfsCounter, 555 mSDsluCounter, 1306 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 1720 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 15:28:08,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 1720 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 15:28:08,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20129 states. [2025-03-08 15:28:09,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20129 to 12061. [2025-03-08 15:28:09,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12061 states, 11836 states have (on average 1.5839810746873944) internal successors, (18748), 11848 states have internal predecessors, (18748), 204 states have call successors, (204), 20 states have call predecessors, (204), 20 states have return successors, (204), 192 states have call predecessors, (204), 204 states have call successors, (204) [2025-03-08 15:28:09,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12061 states to 12061 states and 19156 transitions. [2025-03-08 15:28:09,041 INFO L78 Accepts]: Start accepts. Automaton has 12061 states and 19156 transitions. Word has length 302 [2025-03-08 15:28:09,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:28:09,042 INFO L471 AbstractCegarLoop]: Abstraction has 12061 states and 19156 transitions. [2025-03-08 15:28:09,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-08 15:28:09,042 INFO L276 IsEmpty]: Start isEmpty. Operand 12061 states and 19156 transitions. [2025-03-08 15:28:09,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-03-08 15:28:09,052 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:28:09,052 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:28:09,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 15:28:09,052 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:28:09,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:28:09,052 INFO L85 PathProgramCache]: Analyzing trace with hash 731394327, now seen corresponding path program 1 times [2025-03-08 15:28:09,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:28:09,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568278803] [2025-03-08 15:28:09,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:28:09,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:28:09,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-03-08 15:28:09,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-03-08 15:28:09,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:28:09,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:28:09,950 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-08 15:28:09,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:28:09,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568278803] [2025-03-08 15:28:09,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568278803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:28:09,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:28:09,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 15:28:09,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084731146] [2025-03-08 15:28:09,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:28:09,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 15:28:09,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:28:09,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 15:28:09,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-08 15:28:09,953 INFO L87 Difference]: Start difference. First operand 12061 states and 19156 transitions. Second operand has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-08 15:28:12,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:28:12,131 INFO L93 Difference]: Finished difference Result 57437 states and 90065 transitions. [2025-03-08 15:28:12,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 15:28:12,132 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 302 [2025-03-08 15:28:12,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:28:12,216 INFO L225 Difference]: With dead ends: 57437 [2025-03-08 15:28:12,216 INFO L226 Difference]: Without dead ends: 45379 [2025-03-08 15:28:12,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2025-03-08 15:28:12,235 INFO L435 NwaCegarLoop]: 740 mSDtfsCounter, 897 mSDsluCounter, 3115 mSDsCounter, 0 mSdLazyCounter, 2194 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 897 SdHoareTripleChecker+Valid, 3855 SdHoareTripleChecker+Invalid, 2423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 2194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 15:28:12,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [897 Valid, 3855 Invalid, 2423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 2194 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 15:28:12,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45379 states. [2025-03-08 15:28:12,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45379 to 26681. [2025-03-08 15:28:12,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26681 states, 26232 states have (on average 1.5739554742299482) internal successors, (41288), 26256 states have internal predecessors, (41288), 408 states have call successors, (408), 40 states have call predecessors, (408), 40 states have return successors, (408), 384 states have call predecessors, (408), 408 states have call successors, (408) [2025-03-08 15:28:12,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26681 states to 26681 states and 42104 transitions. [2025-03-08 15:28:12,817 INFO L78 Accepts]: Start accepts. Automaton has 26681 states and 42104 transitions. Word has length 302 [2025-03-08 15:28:12,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:28:12,817 INFO L471 AbstractCegarLoop]: Abstraction has 26681 states and 42104 transitions. [2025-03-08 15:28:12,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-08 15:28:12,818 INFO L276 IsEmpty]: Start isEmpty. Operand 26681 states and 42104 transitions. [2025-03-08 15:28:12,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-03-08 15:28:12,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:28:12,838 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:28:12,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 15:28:12,839 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:28:12,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:28:12,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1104737502, now seen corresponding path program 1 times [2025-03-08 15:28:12,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:28:12,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005543204] [2025-03-08 15:28:12,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:28:12,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:28:12,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-03-08 15:28:12,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-03-08 15:28:12,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:28:12,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:28:12,949 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-08 15:28:12,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:28:12,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005543204] [2025-03-08 15:28:12,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005543204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:28:12,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:28:12,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:28:12,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322195770] [2025-03-08 15:28:12,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:28:12,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:28:12,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:28:12,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:28:12,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:28:12,952 INFO L87 Difference]: Start difference. First operand 26681 states and 42104 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-08 15:28:13,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:28:13,264 INFO L93 Difference]: Finished difference Result 55039 states and 86645 transitions. [2025-03-08 15:28:13,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:28:13,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 302 [2025-03-08 15:28:13,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:28:13,308 INFO L225 Difference]: With dead ends: 55039 [2025-03-08 15:28:13,308 INFO L226 Difference]: Without dead ends: 28361 [2025-03-08 15:28:13,336 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-08 15:28:13,337 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 121 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:28:13,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 582 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:28:13,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28361 states. [2025-03-08 15:28:13,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28361 to 26681. [2025-03-08 15:28:13,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26681 states, 26232 states have (on average 1.5736505032021957) internal successors, (41280), 26256 states have internal predecessors, (41280), 408 states have call successors, (408), 40 states have call predecessors, (408), 40 states have return successors, (408), 384 states have call predecessors, (408), 408 states have call successors, (408) [2025-03-08 15:28:13,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26681 states to 26681 states and 42096 transitions. [2025-03-08 15:28:13,789 INFO L78 Accepts]: Start accepts. Automaton has 26681 states and 42096 transitions. Word has length 302 [2025-03-08 15:28:13,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:28:13,789 INFO L471 AbstractCegarLoop]: Abstraction has 26681 states and 42096 transitions. [2025-03-08 15:28:13,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-08 15:28:13,789 INFO L276 IsEmpty]: Start isEmpty. Operand 26681 states and 42096 transitions. [2025-03-08 15:28:13,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-03-08 15:28:13,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:28:13,807 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:28:13,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 15:28:13,808 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:28:13,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:28:13,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1084400127, now seen corresponding path program 1 times [2025-03-08 15:28:13,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:28:13,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480782415] [2025-03-08 15:28:13,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:28:13,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:28:13,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-03-08 15:28:13,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-03-08 15:28:13,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:28:13,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:28:13,880 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-08 15:28:13,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:28:13,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480782415] [2025-03-08 15:28:13,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480782415] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:28:13,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:28:13,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:28:13,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967082836] [2025-03-08 15:28:13,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:28:13,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:28:13,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:28:13,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:28:13,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:28:13,882 INFO L87 Difference]: Start difference. First operand 26681 states and 42096 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-08 15:28:14,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:28:14,227 INFO L93 Difference]: Finished difference Result 53301 states and 84022 transitions. [2025-03-08 15:28:14,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:28:14,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 302 [2025-03-08 15:28:14,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:28:14,259 INFO L225 Difference]: With dead ends: 53301 [2025-03-08 15:28:14,259 INFO L226 Difference]: Without dead ends: 26623 [2025-03-08 15:28:14,275 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-08 15:28:14,275 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 156 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:28:14,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 681 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:28:14,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26623 states. [2025-03-08 15:28:14,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26623 to 24521. [2025-03-08 15:28:14,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24521 states, 24128 states have (on average 1.5633289124668435) internal successors, (37720), 24136 states have internal predecessors, (37720), 360 states have call successors, (360), 32 states have call predecessors, (360), 32 states have return successors, (360), 352 states have call predecessors, (360), 360 states have call successors, (360) [2025-03-08 15:28:14,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24521 states to 24521 states and 38440 transitions. [2025-03-08 15:28:14,614 INFO L78 Accepts]: Start accepts. Automaton has 24521 states and 38440 transitions. Word has length 302 [2025-03-08 15:28:14,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:28:14,614 INFO L471 AbstractCegarLoop]: Abstraction has 24521 states and 38440 transitions. [2025-03-08 15:28:14,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-08 15:28:14,614 INFO L276 IsEmpty]: Start isEmpty. Operand 24521 states and 38440 transitions. [2025-03-08 15:28:14,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-03-08 15:28:14,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:28:14,630 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:28:14,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 15:28:14,630 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:28:14,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:28:14,631 INFO L85 PathProgramCache]: Analyzing trace with hash 678628476, now seen corresponding path program 1 times [2025-03-08 15:28:14,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:28:14,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876102033] [2025-03-08 15:28:14,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:28:14,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:28:14,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-03-08 15:28:14,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-03-08 15:28:14,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:28:14,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:28:16,065 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-08 15:28:16,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:28:16,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876102033] [2025-03-08 15:28:16,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876102033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:28:16,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:28:16,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 15:28:16,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724032897] [2025-03-08 15:28:16,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:28:16,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 15:28:16,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:28:16,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 15:28:16,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-08 15:28:16,068 INFO L87 Difference]: Start difference. First operand 24521 states and 38440 transitions. Second operand has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-08 15:28:18,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:28:18,827 INFO L93 Difference]: Finished difference Result 69625 states and 108438 transitions. [2025-03-08 15:28:18,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 15:28:18,828 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 302 [2025-03-08 15:28:18,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:28:18,881 INFO L225 Difference]: With dead ends: 69625 [2025-03-08 15:28:18,881 INFO L226 Difference]: Without dead ends: 45107 [2025-03-08 15:28:18,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2025-03-08 15:28:18,908 INFO L435 NwaCegarLoop]: 693 mSDtfsCounter, 457 mSDsluCounter, 3119 mSDsCounter, 0 mSdLazyCounter, 2521 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 3812 SdHoareTripleChecker+Invalid, 2537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-08 15:28:18,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 3812 Invalid, 2537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2521 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-08 15:28:18,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45107 states. [2025-03-08 15:28:19,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45107 to 24961. [2025-03-08 15:28:19,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24961 states, 24568 states have (on average 1.5654509931618366) internal successors, (38460), 24576 states have internal predecessors, (38460), 360 states have call successors, (360), 32 states have call predecessors, (360), 32 states have return successors, (360), 352 states have call predecessors, (360), 360 states have call successors, (360) [2025-03-08 15:28:19,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24961 states to 24961 states and 39180 transitions. [2025-03-08 15:28:19,391 INFO L78 Accepts]: Start accepts. Automaton has 24961 states and 39180 transitions. Word has length 302 [2025-03-08 15:28:19,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:28:19,392 INFO L471 AbstractCegarLoop]: Abstraction has 24961 states and 39180 transitions. [2025-03-08 15:28:19,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-08 15:28:19,392 INFO L276 IsEmpty]: Start isEmpty. Operand 24961 states and 39180 transitions. [2025-03-08 15:28:19,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2025-03-08 15:28:19,408 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:28:19,408 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:28:19,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 15:28:19,409 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:28:19,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:28:19,409 INFO L85 PathProgramCache]: Analyzing trace with hash -228460167, now seen corresponding path program 1 times [2025-03-08 15:28:19,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:28:19,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713980540] [2025-03-08 15:28:19,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:28:19,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:28:19,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-03-08 15:28:19,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-03-08 15:28:19,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:28:19,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:28:19,808 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 6 proven. 120 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-03-08 15:28:19,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:28:19,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713980540] [2025-03-08 15:28:19,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713980540] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:28:19,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372135549] [2025-03-08 15:28:19,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:28:19,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:28:19,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:28:19,811 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-08 15:28:19,813 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-08 15:28:19,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-03-08 15:28:19,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-03-08 15:28:19,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:28:19,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:28:19,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 15:28:19,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:28:20,284 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 658 proven. 114 refuted. 0 times theorem prover too weak. 2840 trivial. 0 not checked. [2025-03-08 15:28:20,284 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:28:20,531 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 12 proven. 114 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-03-08 15:28:20,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372135549] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:28:20,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:28:20,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-08 15:28:20,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943459500] [2025-03-08 15:28:20,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:28:20,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 15:28:20,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:28:20,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 15:28:20,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:28:20,534 INFO L87 Difference]: Start difference. First operand 24961 states and 39180 transitions. Second operand has 8 states, 8 states have (on average 16.875) internal successors, (135), 8 states have internal predecessors, (135), 3 states have call successors, (121), 2 states have call predecessors, (121), 4 states have return successors, (123), 3 states have call predecessors, (123), 3 states have call successors, (123) [2025-03-08 15:28:21,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:28:21,053 INFO L93 Difference]: Finished difference Result 33147 states and 52228 transitions. [2025-03-08 15:28:21,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 15:28:21,054 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 16.875) internal successors, (135), 8 states have internal predecessors, (135), 3 states have call successors, (121), 2 states have call predecessors, (121), 4 states have return successors, (123), 3 states have call predecessors, (123), 3 states have call successors, (123) Word has length 303 [2025-03-08 15:28:21,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:28:21,078 INFO L225 Difference]: With dead ends: 33147 [2025-03-08 15:28:21,078 INFO L226 Difference]: Without dead ends: 8189 [2025-03-08 15:28:21,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 618 GetRequests, 603 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2025-03-08 15:28:21,102 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 355 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:28:21,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 572 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:28:21,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8189 states. [2025-03-08 15:28:21,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8189 to 8172. [2025-03-08 15:28:21,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8172 states, 7756 states have (on average 1.5546673543063434) internal successors, (12058), 7765 states have internal predecessors, (12058), 364 states have call successors, (364), 51 states have call predecessors, (364), 51 states have return successors, (364), 355 states have call predecessors, (364), 364 states have call successors, (364) [2025-03-08 15:28:21,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8172 states to 8172 states and 12786 transitions. [2025-03-08 15:28:21,462 INFO L78 Accepts]: Start accepts. Automaton has 8172 states and 12786 transitions. Word has length 303 [2025-03-08 15:28:21,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:28:21,463 INFO L471 AbstractCegarLoop]: Abstraction has 8172 states and 12786 transitions. [2025-03-08 15:28:21,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.875) internal successors, (135), 8 states have internal predecessors, (135), 3 states have call successors, (121), 2 states have call predecessors, (121), 4 states have return successors, (123), 3 states have call predecessors, (123), 3 states have call successors, (123) [2025-03-08 15:28:21,463 INFO L276 IsEmpty]: Start isEmpty. Operand 8172 states and 12786 transitions. [2025-03-08 15:28:21,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2025-03-08 15:28:21,469 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:28:21,469 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:28:21,477 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-08 15:28:21,670 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,SelfDestructingSolverStorable21 [2025-03-08 15:28:21,670 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:28:21,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:28:21,671 INFO L85 PathProgramCache]: Analyzing trace with hash -224455241, now seen corresponding path program 1 times [2025-03-08 15:28:21,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:28:21,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815699259] [2025-03-08 15:28:21,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:28:21,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:28:21,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-03-08 15:28:21,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-03-08 15:28:21,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:28:21,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:28:22,000 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 18 proven. 108 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-03-08 15:28:22,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:28:22,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815699259] [2025-03-08 15:28:22,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815699259] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:28:22,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894454759] [2025-03-08 15:28:22,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:28:22,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:28:22,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:28:22,002 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-08 15:28:22,004 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-08 15:28:22,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-03-08 15:28:22,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-03-08 15:28:22,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:28:22,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:28:22,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 712 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 15:28:22,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:28:22,479 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 918 proven. 108 refuted. 0 times theorem prover too weak. 2586 trivial. 0 not checked. [2025-03-08 15:28:22,479 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:28:22,700 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 18 proven. 108 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-03-08 15:28:22,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894454759] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:28:22,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:28:22,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-08 15:28:22,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522583139] [2025-03-08 15:28:22,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:28:22,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 15:28:22,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:28:22,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 15:28:22,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:28:22,702 INFO L87 Difference]: Start difference. First operand 8172 states and 12786 transitions. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 2 states have call successors, (79), 2 states have call predecessors, (79), 4 states have return successors, (80), 2 states have call predecessors, (80), 2 states have call successors, (80) [2025-03-08 15:28:23,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:28:23,119 INFO L93 Difference]: Finished difference Result 13760 states and 21363 transitions. [2025-03-08 15:28:23,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 15:28:23,119 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 2 states have call successors, (79), 2 states have call predecessors, (79), 4 states have return successors, (80), 2 states have call predecessors, (80), 2 states have call successors, (80) Word has length 303 [2025-03-08 15:28:23,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:28:23,129 INFO L225 Difference]: With dead ends: 13760 [2025-03-08 15:28:23,129 INFO L226 Difference]: Without dead ends: 5610 [2025-03-08 15:28:23,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 603 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-08 15:28:23,137 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 166 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:28:23,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 615 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:28:23,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5610 states. [2025-03-08 15:28:23,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5610 to 5404. [2025-03-08 15:28:23,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5404 states, 4980 states have (on average 1.5180722891566265) internal successors, (7560), 4989 states have internal predecessors, (7560), 364 states have call successors, (364), 59 states have call predecessors, (364), 59 states have return successors, (364), 355 states have call predecessors, (364), 364 states have call successors, (364) [2025-03-08 15:28:23,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5404 states to 5404 states and 8288 transitions. [2025-03-08 15:28:23,321 INFO L78 Accepts]: Start accepts. Automaton has 5404 states and 8288 transitions. Word has length 303 [2025-03-08 15:28:23,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:28:23,321 INFO L471 AbstractCegarLoop]: Abstraction has 5404 states and 8288 transitions. [2025-03-08 15:28:23,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 2 states have call successors, (79), 2 states have call predecessors, (79), 4 states have return successors, (80), 2 states have call predecessors, (80), 2 states have call successors, (80) [2025-03-08 15:28:23,322 INFO L276 IsEmpty]: Start isEmpty. Operand 5404 states and 8288 transitions. [2025-03-08 15:28:23,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2025-03-08 15:28:23,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:28:23,325 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:28:23,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 15:28:23,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:28:23,526 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:28:23,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:28:23,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1835278293, now seen corresponding path program 1 times [2025-03-08 15:28:23,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:28:23,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126708774] [2025-03-08 15:28:23,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:28:23,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:28:23,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-03-08 15:28:23,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-03-08 15:28:23,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:28:23,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:28:23,769 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-08 15:28:23,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:28:23,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126708774] [2025-03-08 15:28:23,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126708774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:28:23,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:28:23,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 15:28:23,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457649523] [2025-03-08 15:28:23,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:28:23,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 15:28:23,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:28:23,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 15:28:23,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:28:23,771 INFO L87 Difference]: Start difference. First operand 5404 states and 8288 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-08 15:28:24,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:28:24,088 INFO L93 Difference]: Finished difference Result 13043 states and 20053 transitions. [2025-03-08 15:28:24,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 15:28:24,089 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 303 [2025-03-08 15:28:24,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:28:24,101 INFO L225 Difference]: With dead ends: 13043 [2025-03-08 15:28:24,101 INFO L226 Difference]: Without dead ends: 7661 [2025-03-08 15:28:24,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:28:24,107 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 299 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:28:24,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 1096 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:28:24,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7661 states. [2025-03-08 15:28:24,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7661 to 5788. [2025-03-08 15:28:24,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5788 states, 5364 states have (on average 1.5257270693512304) internal successors, (8184), 5373 states have internal predecessors, (8184), 364 states have call successors, (364), 59 states have call predecessors, (364), 59 states have return successors, (364), 355 states have call predecessors, (364), 364 states have call successors, (364) [2025-03-08 15:28:24,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5788 states to 5788 states and 8912 transitions. [2025-03-08 15:28:24,302 INFO L78 Accepts]: Start accepts. Automaton has 5788 states and 8912 transitions. Word has length 303 [2025-03-08 15:28:24,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:28:24,303 INFO L471 AbstractCegarLoop]: Abstraction has 5788 states and 8912 transitions. [2025-03-08 15:28:24,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-08 15:28:24,303 INFO L276 IsEmpty]: Start isEmpty. Operand 5788 states and 8912 transitions. [2025-03-08 15:28:24,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2025-03-08 15:28:24,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:28:24,306 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:28:24,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 15:28:24,307 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:28:24,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:28:24,307 INFO L85 PathProgramCache]: Analyzing trace with hash -174825548, now seen corresponding path program 1 times [2025-03-08 15:28:24,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:28:24,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871942683] [2025-03-08 15:28:24,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:28:24,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:28:24,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-03-08 15:28:24,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-03-08 15:28:24,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:28:24,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:28:25,266 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 33 proven. 93 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-03-08 15:28:25,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:28:25,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871942683] [2025-03-08 15:28:25,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871942683] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:28:25,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005968907] [2025-03-08 15:28:25,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:28:25,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:28:25,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:28:25,269 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:28:25,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 15:28:25,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-03-08 15:28:25,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-03-08 15:28:25,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:28:25,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:28:25,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 709 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-08 15:28:25,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:28:26,704 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 1986 proven. 246 refuted. 0 times theorem prover too weak. 1380 trivial. 0 not checked. [2025-03-08 15:28:26,705 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:28:27,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005968907] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:28:27,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 15:28:27,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2025-03-08 15:28:27,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658639640] [2025-03-08 15:28:27,155 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 15:28:27,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 15:28:27,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:28:27,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 15:28:27,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=544, Unknown=0, NotChecked=0, Total=650 [2025-03-08 15:28:27,156 INFO L87 Difference]: Start difference. First operand 5788 states and 8912 transitions. Second operand has 23 states, 23 states have (on average 8.0) internal successors, (184), 22 states have internal predecessors, (184), 8 states have call successors, (86), 5 states have call predecessors, (86), 8 states have return successors, (86), 8 states have call predecessors, (86), 8 states have call successors, (86) [2025-03-08 15:28:31,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:28:31,155 INFO L93 Difference]: Finished difference Result 37193 states and 56283 transitions. [2025-03-08 15:28:31,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-03-08 15:28:31,155 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 8.0) internal successors, (184), 22 states have internal predecessors, (184), 8 states have call successors, (86), 5 states have call predecessors, (86), 8 states have return successors, (86), 8 states have call predecessors, (86), 8 states have call successors, (86) Word has length 303 [2025-03-08 15:28:31,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:28:31,198 INFO L225 Difference]: With dead ends: 37193 [2025-03-08 15:28:31,199 INFO L226 Difference]: Without dead ends: 31427 [2025-03-08 15:28:31,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 556 GetRequests, 493 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1049 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=801, Invalid=3359, Unknown=0, NotChecked=0, Total=4160 [2025-03-08 15:28:31,212 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 2226 mSDsluCounter, 4284 mSDsCounter, 0 mSdLazyCounter, 3204 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2248 SdHoareTripleChecker+Valid, 4557 SdHoareTripleChecker+Invalid, 3618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 3204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:28:31,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2248 Valid, 4557 Invalid, 3618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 3204 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-08 15:28:31,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31427 states. [2025-03-08 15:28:31,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31427 to 22515. [2025-03-08 15:28:32,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22515 states, 21179 states have (on average 1.507294961990651) internal successors, (31923), 21224 states have internal predecessors, (31923), 1060 states have call successors, (1060), 275 states have call predecessors, (1060), 275 states have return successors, (1060), 1015 states have call predecessors, (1060), 1060 states have call successors, (1060) [2025-03-08 15:28:32,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22515 states to 22515 states and 34043 transitions. [2025-03-08 15:28:32,035 INFO L78 Accepts]: Start accepts. Automaton has 22515 states and 34043 transitions. Word has length 303 [2025-03-08 15:28:32,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:28:32,035 INFO L471 AbstractCegarLoop]: Abstraction has 22515 states and 34043 transitions. [2025-03-08 15:28:32,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 8.0) internal successors, (184), 22 states have internal predecessors, (184), 8 states have call successors, (86), 5 states have call predecessors, (86), 8 states have return successors, (86), 8 states have call predecessors, (86), 8 states have call successors, (86) [2025-03-08 15:28:32,036 INFO L276 IsEmpty]: Start isEmpty. Operand 22515 states and 34043 transitions. [2025-03-08 15:28:32,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2025-03-08 15:28:32,045 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:28:32,045 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:28:32,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 15:28:32,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:28:32,249 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:28:32,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:28:32,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1408563629, now seen corresponding path program 1 times [2025-03-08 15:28:32,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:28:32,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561839129] [2025-03-08 15:28:32,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:28:32,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:28:32,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-03-08 15:28:32,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-03-08 15:28:32,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:28:32,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:28:32,320 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-08 15:28:32,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:28:32,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561839129] [2025-03-08 15:28:32,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561839129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:28:32,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:28:32,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:28:32,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527287123] [2025-03-08 15:28:32,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:28:32,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:28:32,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:28:32,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:28:32,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:28:32,322 INFO L87 Difference]: Start difference. First operand 22515 states and 34043 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-08 15:28:32,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:28:32,927 INFO L93 Difference]: Finished difference Result 25427 states and 38542 transitions. [2025-03-08 15:28:32,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:28:32,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 303 [2025-03-08 15:28:32,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:28:32,959 INFO L225 Difference]: With dead ends: 25427 [2025-03-08 15:28:32,959 INFO L226 Difference]: Without dead ends: 22535 [2025-03-08 15:28:32,967 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-08 15:28:32,968 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 0 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:28:32,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 551 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:28:32,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22535 states. [2025-03-08 15:28:33,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22535 to 22535. [2025-03-08 15:28:33,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22535 states, 21199 states have (on average 1.5068163592622295) internal successors, (31943), 21244 states have internal predecessors, (31943), 1060 states have call successors, (1060), 275 states have call predecessors, (1060), 275 states have return successors, (1060), 1015 states have call predecessors, (1060), 1060 states have call successors, (1060) [2025-03-08 15:28:33,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22535 states to 22535 states and 34063 transitions. [2025-03-08 15:28:33,732 INFO L78 Accepts]: Start accepts. Automaton has 22535 states and 34063 transitions. Word has length 303 [2025-03-08 15:28:33,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:28:33,732 INFO L471 AbstractCegarLoop]: Abstraction has 22535 states and 34063 transitions. [2025-03-08 15:28:33,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-08 15:28:33,732 INFO L276 IsEmpty]: Start isEmpty. Operand 22535 states and 34063 transitions. [2025-03-08 15:28:33,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-03-08 15:28:33,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:28:33,741 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:28:33,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 15:28:33,741 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:28:33,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:28:33,742 INFO L85 PathProgramCache]: Analyzing trace with hash 956666716, now seen corresponding path program 1 times [2025-03-08 15:28:33,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:28:33,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561509681] [2025-03-08 15:28:33,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:28:33,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:28:33,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-03-08 15:28:33,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-03-08 15:28:33,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:28:33,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:28:33,925 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-08 15:28:33,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:28:33,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561509681] [2025-03-08 15:28:33,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561509681] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:28:33,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:28:33,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:28:33,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177405650] [2025-03-08 15:28:33,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:28:33,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:28:33,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:28:33,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:28:33,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:28:33,926 INFO L87 Difference]: Start difference. First operand 22535 states and 34063 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-08 15:28:35,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:28:35,236 INFO L93 Difference]: Finished difference Result 63380 states and 95952 transitions. [2025-03-08 15:28:35,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:28:35,236 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 304 [2025-03-08 15:28:35,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:28:35,295 INFO L225 Difference]: With dead ends: 63380 [2025-03-08 15:28:35,295 INFO L226 Difference]: Without dead ends: 40867 [2025-03-08 15:28:35,320 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-08 15:28:35,321 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 229 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:28:35,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 876 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:28:35,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40867 states. [2025-03-08 15:28:36,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40867 to 33093. [2025-03-08 15:28:36,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33093 states, 31093 states have (on average 1.4957385906795742) internal successors, (46507), 31160 states have internal predecessors, (46507), 1588 states have call successors, (1588), 411 states have call predecessors, (1588), 411 states have return successors, (1588), 1521 states have call predecessors, (1588), 1588 states have call successors, (1588) [2025-03-08 15:28:36,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33093 states to 33093 states and 49683 transitions. [2025-03-08 15:28:36,644 INFO L78 Accepts]: Start accepts. Automaton has 33093 states and 49683 transitions. Word has length 304 [2025-03-08 15:28:36,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:28:36,644 INFO L471 AbstractCegarLoop]: Abstraction has 33093 states and 49683 transitions. [2025-03-08 15:28:36,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-08 15:28:36,644 INFO L276 IsEmpty]: Start isEmpty. Operand 33093 states and 49683 transitions. [2025-03-08 15:28:36,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-03-08 15:28:36,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:28:36,657 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:28:36,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 15:28:36,657 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:28:36,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:28:36,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1649768413, now seen corresponding path program 1 times [2025-03-08 15:28:36,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:28:36,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619115447] [2025-03-08 15:28:36,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:28:36,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:28:36,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-03-08 15:28:36,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-03-08 15:28:36,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:28:36,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:28:38,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 192 proven. 378 refuted. 0 times theorem prover too weak. 3042 trivial. 0 not checked. [2025-03-08 15:28:38,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:28:38,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619115447] [2025-03-08 15:28:38,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619115447] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:28:38,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618997333] [2025-03-08 15:28:38,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:28:38,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:28:38,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:28:38,493 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:28:38,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 15:28:38,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-03-08 15:28:38,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-03-08 15:28:38,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:28:38,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:28:38,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 714 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-08 15:28:38,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:28:40,349 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 2555 proven. 240 refuted. 0 times theorem prover too weak. 817 trivial. 0 not checked. [2025-03-08 15:28:40,349 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:28:41,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618997333] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:28:41,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 15:28:41,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 21] total 34 [2025-03-08 15:28:41,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152740919] [2025-03-08 15:28:41,699 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 15:28:41,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-08 15:28:41,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:28:41,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-08 15:28:41,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=376, Invalid=1430, Unknown=0, NotChecked=0, Total=1806 [2025-03-08 15:28:41,700 INFO L87 Difference]: Start difference. First operand 33093 states and 49683 transitions. Second operand has 34 states, 32 states have (on average 6.03125) internal successors, (193), 29 states have internal predecessors, (193), 13 states have call successors, (86), 8 states have call predecessors, (86), 12 states have return successors, (86), 13 states have call predecessors, (86), 13 states have call successors, (86) [2025-03-08 15:28:47,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:28:47,670 INFO L93 Difference]: Finished difference Result 83756 states and 123877 transitions. [2025-03-08 15:28:47,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-03-08 15:28:47,671 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 6.03125) internal successors, (193), 29 states have internal predecessors, (193), 13 states have call successors, (86), 8 states have call predecessors, (86), 12 states have return successors, (86), 13 states have call predecessors, (86), 13 states have call successors, (86) Word has length 304 [2025-03-08 15:28:47,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:28:47,756 INFO L225 Difference]: With dead ends: 83756 [2025-03-08 15:28:47,756 INFO L226 Difference]: Without dead ends: 50685 [2025-03-08 15:28:47,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 433 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2034 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1719, Invalid=5763, Unknown=0, NotChecked=0, Total=7482 [2025-03-08 15:28:47,795 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 2147 mSDsluCounter, 2566 mSDsCounter, 0 mSdLazyCounter, 2217 mSolverCounterSat, 452 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2149 SdHoareTripleChecker+Valid, 2885 SdHoareTripleChecker+Invalid, 2669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 452 IncrementalHoareTripleChecker+Valid, 2217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:28:47,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2149 Valid, 2885 Invalid, 2669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [452 Valid, 2217 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-08 15:28:47,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50685 states. [2025-03-08 15:28:49,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50685 to 27697. [2025-03-08 15:28:49,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27697 states, 25584 states have (on average 1.4908145716072545) internal successors, (38141), 25608 states have internal predecessors, (38141), 1650 states have call successors, (1650), 462 states have call predecessors, (1650), 462 states have return successors, (1650), 1626 states have call predecessors, (1650), 1650 states have call successors, (1650) [2025-03-08 15:28:49,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27697 states to 27697 states and 41441 transitions. [2025-03-08 15:28:49,100 INFO L78 Accepts]: Start accepts. Automaton has 27697 states and 41441 transitions. Word has length 304 [2025-03-08 15:28:49,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:28:49,100 INFO L471 AbstractCegarLoop]: Abstraction has 27697 states and 41441 transitions. [2025-03-08 15:28:49,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 6.03125) internal successors, (193), 29 states have internal predecessors, (193), 13 states have call successors, (86), 8 states have call predecessors, (86), 12 states have return successors, (86), 13 states have call predecessors, (86), 13 states have call successors, (86) [2025-03-08 15:28:49,100 INFO L276 IsEmpty]: Start isEmpty. Operand 27697 states and 41441 transitions. [2025-03-08 15:28:49,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-03-08 15:28:49,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:28:49,110 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:28:49,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 15:28:49,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-08 15:28:49,311 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:28:49,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:28:49,311 INFO L85 PathProgramCache]: Analyzing trace with hash -459915765, now seen corresponding path program 1 times [2025-03-08 15:28:49,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:28:49,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866332534] [2025-03-08 15:28:49,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:28:49,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:28:49,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-03-08 15:28:49,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-03-08 15:28:49,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:28:49,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:28:50,628 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 123 proven. 123 refuted. 0 times theorem prover too weak. 3366 trivial. 0 not checked. [2025-03-08 15:28:50,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:28:50,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866332534] [2025-03-08 15:28:50,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866332534] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:28:50,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220397189] [2025-03-08 15:28:50,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:28:50,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:28:50,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:28:50,631 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:28:50,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 15:28:50,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-03-08 15:28:50,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-03-08 15:28:50,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:28:50,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:28:50,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-08 15:28:50,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:28:52,028 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 2616 proven. 264 refuted. 0 times theorem prover too weak. 732 trivial. 0 not checked. [2025-03-08 15:28:52,029 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:29:01,688 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 177 proven. 192 refuted. 0 times theorem prover too weak. 3243 trivial. 0 not checked. [2025-03-08 15:29:01,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220397189] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:29:01,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:29:01,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19, 16] total 40 [2025-03-08 15:29:01,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011311256] [2025-03-08 15:29:01,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:29:01,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-08 15:29:01,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:29:01,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-08 15:29:01,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=1251, Unknown=2, NotChecked=0, Total=1560 [2025-03-08 15:29:01,690 INFO L87 Difference]: Start difference. First operand 27697 states and 41441 transitions. Second operand has 40 states, 40 states have (on average 6.1) internal successors, (244), 40 states have internal predecessors, (244), 10 states have call successors, (105), 5 states have call predecessors, (105), 11 states have return successors, (106), 10 states have call predecessors, (106), 10 states have call successors, (106)