./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-83.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_amount500_file-83.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 e31a340a728b4b13c53c35406dccb6504a466f013456cf371c6079f0f2b7f2d6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:48:14,133 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:48:14,195 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:48:14,198 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:48:14,198 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:48:14,222 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:48:14,223 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:48:14,223 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:48:14,224 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:48:14,224 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:48:14,224 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:48:14,224 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:48:14,224 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:48:14,224 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:48:14,225 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:48:14,225 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:48:14,225 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:48:14,225 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:48:14,225 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:48:14,225 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:48:14,226 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:48:14,226 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:48:14,226 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:48:14,226 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:48:14,226 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:48:14,226 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:48:14,226 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:48:14,226 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:48:14,226 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:48:14,227 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:48:14,227 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:48:14,227 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:48:14,227 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:48:14,227 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:48:14,227 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:48:14,227 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:48:14,228 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:48:14,228 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:48:14,228 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:48:14,228 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:48:14,228 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:48:14,228 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:48:14,228 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:48:14,228 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 -> e31a340a728b4b13c53c35406dccb6504a466f013456cf371c6079f0f2b7f2d6 [2025-03-08 15:48:14,436 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:48:14,445 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:48:14,447 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:48:14,449 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:48:14,449 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:48:14,450 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-83.i [2025-03-08 15:48:15,589 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b93bcbf15/e300fc1999354e43a6be559418aef1b4/FLAG3ca51e705 [2025-03-08 15:48:15,870 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:48:15,871 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-83.i [2025-03-08 15:48:15,882 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b93bcbf15/e300fc1999354e43a6be559418aef1b4/FLAG3ca51e705 [2025-03-08 15:48:16,162 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b93bcbf15/e300fc1999354e43a6be559418aef1b4 [2025-03-08 15:48:16,164 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:48:16,165 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:48:16,166 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:48:16,166 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:48:16,168 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:48:16,169 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:48:16" (1/1) ... [2025-03-08 15:48:16,169 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f72a2e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:16, skipping insertion in model container [2025-03-08 15:48:16,169 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:48:16" (1/1) ... [2025-03-08 15:48:16,195 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:48:16,298 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_amount500_file-83.i[916,929] [2025-03-08 15:48:16,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:48:16,538 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:48:16,546 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_amount500_file-83.i[916,929] [2025-03-08 15:48:16,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:48:16,623 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:48:16,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:16 WrapperNode [2025-03-08 15:48:16,624 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:48:16,627 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:48:16,627 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:48:16,627 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:48:16,632 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:48:16" (1/1) ... [2025-03-08 15:48:16,653 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:48:16" (1/1) ... [2025-03-08 15:48:16,750 INFO L138 Inliner]: procedures = 26, calls = 73, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 699 [2025-03-08 15:48:16,752 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:48:16,752 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:48:16,752 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:48:16,752 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:48:16,759 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:16" (1/1) ... [2025-03-08 15:48:16,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:16" (1/1) ... [2025-03-08 15:48:16,784 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:16" (1/1) ... [2025-03-08 15:48:16,872 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:48:16,873 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:16" (1/1) ... [2025-03-08 15:48:16,873 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:16" (1/1) ... [2025-03-08 15:48:16,904 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:16" (1/1) ... [2025-03-08 15:48:16,908 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:16" (1/1) ... [2025-03-08 15:48:16,917 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:16" (1/1) ... [2025-03-08 15:48:16,922 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:16" (1/1) ... [2025-03-08 15:48:16,938 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:48:16,940 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:48:16,940 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:48:16,940 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:48:16,941 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:16" (1/1) ... [2025-03-08 15:48:16,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:48:16,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:48:16,967 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:48:16,991 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:48:17,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:48:17,009 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:48:17,009 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:48:17,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:48:17,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:48:17,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:48:17,107 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:48:17,108 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:48:18,053 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L604: havoc property_#t~ite48#1;havoc property_#t~ite47#1;havoc property_#t~bitwise46#1;havoc property_#t~short49#1;havoc property_#t~bitwise50#1;havoc property_#t~ite52#1;havoc property_#t~bitwise51#1;havoc property_#t~short53#1;havoc property_#t~bitwise54#1;havoc property_#t~short55#1;havoc property_#t~ite61#1;havoc property_#t~ite60#1;havoc property_#t~ite59#1;havoc property_#t~bitwise56#1;havoc property_#t~ite58#1;havoc property_#t~bitwise57#1;havoc property_#t~short62#1; [2025-03-08 15:48:18,159 INFO L? ?]: Removed 59 outVars from TransFormulas that were not future-live. [2025-03-08 15:48:18,159 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:48:18,183 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:48:18,186 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:48:18,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:48:18 BoogieIcfgContainer [2025-03-08 15:48:18,187 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:48:18,188 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:48:18,188 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:48:18,195 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:48:18,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:48:16" (1/3) ... [2025-03-08 15:48:18,196 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7882ef78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:48:18, skipping insertion in model container [2025-03-08 15:48:18,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:16" (2/3) ... [2025-03-08 15:48:18,196 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7882ef78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:48:18, skipping insertion in model container [2025-03-08 15:48:18,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:48:18" (3/3) ... [2025-03-08 15:48:18,197 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-83.i [2025-03-08 15:48:18,207 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:48:18,210 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-83.i that has 2 procedures, 267 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:48:18,258 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:48:18,265 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;@4aeb3053, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:48:18,265 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:48:18,269 INFO L276 IsEmpty]: Start isEmpty. Operand has 267 states, 204 states have (on average 1.5637254901960784) internal successors, (319), 205 states have internal predecessors, (319), 60 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-08 15:48:18,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2025-03-08 15:48:18,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:48:18,289 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:18,289 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:48:18,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:48:18,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1621188869, now seen corresponding path program 1 times [2025-03-08 15:48:18,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:48:18,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121099679] [2025-03-08 15:48:18,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:18,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:48:18,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 412 statements into 1 equivalence classes. [2025-03-08 15:48:18,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 412 of 412 statements. [2025-03-08 15:48:18,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:18,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:18,804 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 118 refuted. 0 times theorem prover too weak. 6962 trivial. 0 not checked. [2025-03-08 15:48:18,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:48:18,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121099679] [2025-03-08 15:48:18,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121099679] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:48:18,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518493871] [2025-03-08 15:48:18,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:18,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:48:18,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:48:18,830 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:48:18,832 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:48:18,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 412 statements into 1 equivalence classes. [2025-03-08 15:48:19,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 412 of 412 statements. [2025-03-08 15:48:19,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:19,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:19,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 1053 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:48:19,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:48:19,207 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 6962 trivial. 0 not checked. [2025-03-08 15:48:19,207 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:48:19,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518493871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:48:19,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:48:19,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:48:19,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671438436] [2025-03-08 15:48:19,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:48:19,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:48:19,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:48:19,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:48:19,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:48:19,227 INFO L87 Difference]: Start difference. First operand has 267 states, 204 states have (on average 1.5637254901960784) internal successors, (319), 205 states have internal predecessors, (319), 60 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) Second operand has 2 states, 2 states have (on average 58.5) internal successors, (117), 2 states have internal predecessors, (117), 2 states have call successors, (60), 2 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 2 states have call successors, (60) [2025-03-08 15:48:19,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:48:19,285 INFO L93 Difference]: Finished difference Result 528 states and 933 transitions. [2025-03-08 15:48:19,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:48:19,287 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 58.5) internal successors, (117), 2 states have internal predecessors, (117), 2 states have call successors, (60), 2 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 2 states have call successors, (60) Word has length 412 [2025-03-08 15:48:19,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:48:19,293 INFO L225 Difference]: With dead ends: 528 [2025-03-08 15:48:19,293 INFO L226 Difference]: Without dead ends: 264 [2025-03-08 15:48:19,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 413 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:48:19,301 INFO L435 NwaCegarLoop]: 419 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:48:19,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 419 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:48:19,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-03-08 15:48:19,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2025-03-08 15:48:19,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 202 states have (on average 1.5396039603960396) internal successors, (311), 202 states have internal predecessors, (311), 60 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-08 15:48:19,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 431 transitions. [2025-03-08 15:48:19,363 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 431 transitions. Word has length 412 [2025-03-08 15:48:19,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:48:19,364 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 431 transitions. [2025-03-08 15:48:19,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 58.5) internal successors, (117), 2 states have internal predecessors, (117), 2 states have call successors, (60), 2 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 2 states have call successors, (60) [2025-03-08 15:48:19,364 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 431 transitions. [2025-03-08 15:48:19,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2025-03-08 15:48:19,372 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:48:19,372 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:19,382 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:48:19,574 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:48:19,574 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:48:19,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:48:19,575 INFO L85 PathProgramCache]: Analyzing trace with hash 2058742918, now seen corresponding path program 1 times [2025-03-08 15:48:19,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:48:19,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687569317] [2025-03-08 15:48:19,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:19,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:48:19,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 412 statements into 1 equivalence classes. [2025-03-08 15:48:19,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 412 of 412 statements. [2025-03-08 15:48:19,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:19,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:19,986 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-03-08 15:48:19,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:48:19,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687569317] [2025-03-08 15:48:19,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687569317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:48:19,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:48:19,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:48:19,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902197303] [2025-03-08 15:48:19,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:48:19,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:48:19,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:48:19,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:48:19,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:48:19,991 INFO L87 Difference]: Start difference. First operand 264 states and 431 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:48:20,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:48:20,114 INFO L93 Difference]: Finished difference Result 784 states and 1283 transitions. [2025-03-08 15:48:20,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:48:20,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 412 [2025-03-08 15:48:20,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:48:20,121 INFO L225 Difference]: With dead ends: 784 [2025-03-08 15:48:20,121 INFO L226 Difference]: Without dead ends: 523 [2025-03-08 15:48:20,122 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:48:20,122 INFO L435 NwaCegarLoop]: 413 mSDtfsCounter, 397 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:48:20,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 814 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:48:20,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-03-08 15:48:20,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 314. [2025-03-08 15:48:20,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 252 states have (on average 1.5674603174603174) internal successors, (395), 252 states have internal predecessors, (395), 60 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-08 15:48:20,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 515 transitions. [2025-03-08 15:48:20,159 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 515 transitions. Word has length 412 [2025-03-08 15:48:20,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:48:20,160 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 515 transitions. [2025-03-08 15:48:20,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:48:20,161 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 515 transitions. [2025-03-08 15:48:20,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2025-03-08 15:48:20,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:48:20,165 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:20,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:48:20,166 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:48:20,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:48:20,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1465468924, now seen corresponding path program 1 times [2025-03-08 15:48:20,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:48:20,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84920056] [2025-03-08 15:48:20,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:20,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:48:20,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 412 statements into 1 equivalence classes. [2025-03-08 15:48:20,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 412 of 412 statements. [2025-03-08 15:48:20,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:20,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:20,451 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-03-08 15:48:20,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:48:20,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84920056] [2025-03-08 15:48:20,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84920056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:48:20,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:48:20,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:48:20,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913959031] [2025-03-08 15:48:20,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:48:20,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:48:20,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:48:20,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:48:20,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:48:20,453 INFO L87 Difference]: Start difference. First operand 314 states and 515 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:48:20,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:48:20,602 INFO L93 Difference]: Finished difference Result 932 states and 1531 transitions. [2025-03-08 15:48:20,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:48:20,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 412 [2025-03-08 15:48:20,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:48:20,610 INFO L225 Difference]: With dead ends: 932 [2025-03-08 15:48:20,611 INFO L226 Difference]: Without dead ends: 621 [2025-03-08 15:48:20,612 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:48:20,612 INFO L435 NwaCegarLoop]: 609 mSDtfsCounter, 388 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:48:20,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 1007 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:48:20,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2025-03-08 15:48:20,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 618. [2025-03-08 15:48:20,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 495 states have (on average 1.5515151515151515) internal successors, (768), 495 states have internal predecessors, (768), 120 states have call successors, (120), 2 states have call predecessors, (120), 2 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2025-03-08 15:48:20,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 1008 transitions. [2025-03-08 15:48:20,695 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 1008 transitions. Word has length 412 [2025-03-08 15:48:20,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:48:20,696 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 1008 transitions. [2025-03-08 15:48:20,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:48:20,697 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 1008 transitions. [2025-03-08 15:48:20,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2025-03-08 15:48:20,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:48:20,703 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:20,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 15:48:20,703 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:48:20,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:48:20,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1500439203, now seen corresponding path program 1 times [2025-03-08 15:48:20,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:48:20,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555127354] [2025-03-08 15:48:20,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:20,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:48:20,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 412 statements into 1 equivalence classes. [2025-03-08 15:48:20,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 412 of 412 statements. [2025-03-08 15:48:20,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:20,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:21,352 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-03-08 15:48:21,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:48:21,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555127354] [2025-03-08 15:48:21,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555127354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:48:21,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:48:21,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 15:48:21,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587825709] [2025-03-08 15:48:21,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:48:21,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 15:48:21,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:48:21,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 15:48:21,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:48:21,354 INFO L87 Difference]: Start difference. First operand 618 states and 1008 transitions. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 2 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 2 states have call predecessors, (60), 2 states have call successors, (60) [2025-03-08 15:48:21,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:48:21,803 INFO L93 Difference]: Finished difference Result 1728 states and 2822 transitions. [2025-03-08 15:48:21,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:48:21,803 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 2 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 2 states have call predecessors, (60), 2 states have call successors, (60) Word has length 412 [2025-03-08 15:48:21,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:48:21,811 INFO L225 Difference]: With dead ends: 1728 [2025-03-08 15:48:21,812 INFO L226 Difference]: Without dead ends: 1113 [2025-03-08 15:48:21,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:48:21,815 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 468 mSDsluCounter, 1605 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 2020 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:48:21,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 2020 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:48:21,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2025-03-08 15:48:21,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 763. [2025-03-08 15:48:21,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 763 states, 579 states have (on average 1.528497409326425) internal successors, (885), 579 states have internal predecessors, (885), 180 states have call successors, (180), 3 states have call predecessors, (180), 3 states have return successors, (180), 180 states have call predecessors, (180), 180 states have call successors, (180) [2025-03-08 15:48:21,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1245 transitions. [2025-03-08 15:48:21,898 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 1245 transitions. Word has length 412 [2025-03-08 15:48:21,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:48:21,899 INFO L471 AbstractCegarLoop]: Abstraction has 763 states and 1245 transitions. [2025-03-08 15:48:21,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 2 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 2 states have call predecessors, (60), 2 states have call successors, (60) [2025-03-08 15:48:21,899 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1245 transitions. [2025-03-08 15:48:21,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2025-03-08 15:48:21,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:48:21,907 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:21,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 15:48:21,907 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:48:21,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:48:21,908 INFO L85 PathProgramCache]: Analyzing trace with hash 2130897828, now seen corresponding path program 1 times [2025-03-08 15:48:21,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:48:21,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230316277] [2025-03-08 15:48:21,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:21,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:48:21,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 412 statements into 1 equivalence classes. [2025-03-08 15:48:22,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 412 of 412 statements. [2025-03-08 15:48:22,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:22,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:22,545 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-03-08 15:48:22,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:48:22,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230316277] [2025-03-08 15:48:22,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230316277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:48:22,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:48:22,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:48:22,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437907511] [2025-03-08 15:48:22,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:48:22,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:48:22,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:48:22,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:48:22,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:48:22,547 INFO L87 Difference]: Start difference. First operand 763 states and 1245 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:48:22,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:48:22,828 INFO L93 Difference]: Finished difference Result 1762 states and 2876 transitions. [2025-03-08 15:48:22,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:48:22,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 412 [2025-03-08 15:48:22,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:48:22,834 INFO L225 Difference]: With dead ends: 1762 [2025-03-08 15:48:22,835 INFO L226 Difference]: Without dead ends: 1113 [2025-03-08 15:48:22,836 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:48:22,837 INFO L435 NwaCegarLoop]: 416 mSDtfsCounter, 462 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:48:22,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 1234 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:48:22,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2025-03-08 15:48:22,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 763. [2025-03-08 15:48:22,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 763 states, 579 states have (on average 1.5267702936096719) internal successors, (884), 579 states have internal predecessors, (884), 180 states have call successors, (180), 3 states have call predecessors, (180), 3 states have return successors, (180), 180 states have call predecessors, (180), 180 states have call successors, (180) [2025-03-08 15:48:22,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1244 transitions. [2025-03-08 15:48:22,885 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 1244 transitions. Word has length 412 [2025-03-08 15:48:22,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:48:22,886 INFO L471 AbstractCegarLoop]: Abstraction has 763 states and 1244 transitions. [2025-03-08 15:48:22,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:48:22,886 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1244 transitions. [2025-03-08 15:48:22,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2025-03-08 15:48:22,890 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:48:22,890 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:22,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 15:48:22,891 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:48:22,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:48:22,891 INFO L85 PathProgramCache]: Analyzing trace with hash -63946681, now seen corresponding path program 1 times [2025-03-08 15:48:22,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:48:22,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602990412] [2025-03-08 15:48:22,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:22,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:48:22,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 413 statements into 1 equivalence classes. [2025-03-08 15:48:23,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 413 of 413 statements. [2025-03-08 15:48:23,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:23,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:23,468 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-03-08 15:48:23,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:48:23,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602990412] [2025-03-08 15:48:23,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602990412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:48:23,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:48:23,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:48:23,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357280119] [2025-03-08 15:48:23,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:48:23,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:48:23,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:48:23,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:48:23,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:48:23,472 INFO L87 Difference]: Start difference. First operand 763 states and 1244 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:48:23,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:48:23,618 INFO L93 Difference]: Finished difference Result 1708 states and 2791 transitions. [2025-03-08 15:48:23,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:48:23,619 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 413 [2025-03-08 15:48:23,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:48:23,625 INFO L225 Difference]: With dead ends: 1708 [2025-03-08 15:48:23,625 INFO L226 Difference]: Without dead ends: 1082 [2025-03-08 15:48:23,627 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:48:23,628 INFO L435 NwaCegarLoop]: 410 mSDtfsCounter, 309 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:48:23,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 810 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:48:23,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2025-03-08 15:48:23,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 1079. [2025-03-08 15:48:23,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1079 states, 834 states have (on average 1.5299760191846523) internal successors, (1276), 834 states have internal predecessors, (1276), 240 states have call successors, (240), 4 states have call predecessors, (240), 4 states have return successors, (240), 240 states have call predecessors, (240), 240 states have call successors, (240) [2025-03-08 15:48:23,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1756 transitions. [2025-03-08 15:48:23,684 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1756 transitions. Word has length 413 [2025-03-08 15:48:23,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:48:23,685 INFO L471 AbstractCegarLoop]: Abstraction has 1079 states and 1756 transitions. [2025-03-08 15:48:23,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:48:23,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1756 transitions. [2025-03-08 15:48:23,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2025-03-08 15:48:23,689 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:48:23,689 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:23,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 15:48:23,689 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:48:23,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:48:23,690 INFO L85 PathProgramCache]: Analyzing trace with hash -212969272, now seen corresponding path program 1 times [2025-03-08 15:48:23,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:48:23,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360169008] [2025-03-08 15:48:23,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:23,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:48:23,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 413 statements into 1 equivalence classes. [2025-03-08 15:48:23,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 413 of 413 statements. [2025-03-08 15:48:23,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:23,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:24,060 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-03-08 15:48:24,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:48:24,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360169008] [2025-03-08 15:48:24,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360169008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:48:24,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:48:24,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:48:24,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766515261] [2025-03-08 15:48:24,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:48:24,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:48:24,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:48:24,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:48:24,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:48:24,063 INFO L87 Difference]: Start difference. First operand 1079 states and 1756 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:48:24,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:48:24,158 INFO L93 Difference]: Finished difference Result 2917 states and 4752 transitions. [2025-03-08 15:48:24,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:48:24,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 413 [2025-03-08 15:48:24,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:48:24,168 INFO L225 Difference]: With dead ends: 2917 [2025-03-08 15:48:24,169 INFO L226 Difference]: Without dead ends: 1998 [2025-03-08 15:48:24,172 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:48:24,172 INFO L435 NwaCegarLoop]: 483 mSDtfsCounter, 269 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:48:24,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 892 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:48:24,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1998 states. [2025-03-08 15:48:24,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1998 to 1993. [2025-03-08 15:48:24,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1993 states, 1565 states have (on average 1.5361022364217252) internal successors, (2404), 1565 states have internal predecessors, (2404), 420 states have call successors, (420), 7 states have call predecessors, (420), 7 states have return successors, (420), 420 states have call predecessors, (420), 420 states have call successors, (420) [2025-03-08 15:48:24,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1993 states to 1993 states and 3244 transitions. [2025-03-08 15:48:24,276 INFO L78 Accepts]: Start accepts. Automaton has 1993 states and 3244 transitions. Word has length 413 [2025-03-08 15:48:24,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:48:24,278 INFO L471 AbstractCegarLoop]: Abstraction has 1993 states and 3244 transitions. [2025-03-08 15:48:24,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:48:24,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1993 states and 3244 transitions. [2025-03-08 15:48:24,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2025-03-08 15:48:24,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:48:24,283 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:24,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 15:48:24,283 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:48:24,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:48:24,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1956366967, now seen corresponding path program 1 times [2025-03-08 15:48:24,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:48:24,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090882662] [2025-03-08 15:48:24,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:24,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:48:24,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes. [2025-03-08 15:48:24,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements. [2025-03-08 15:48:24,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:24,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:25,225 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-03-08 15:48:25,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:48:25,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090882662] [2025-03-08 15:48:25,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090882662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:48:25,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:48:25,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 15:48:25,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284946043] [2025-03-08 15:48:25,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:48:25,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 15:48:25,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:48:25,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 15:48:25,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:48:25,227 INFO L87 Difference]: Start difference. First operand 1993 states and 3244 transitions. Second operand has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:48:26,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:48:26,840 INFO L93 Difference]: Finished difference Result 9850 states and 15910 transitions. [2025-03-08 15:48:26,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 15:48:26,841 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 414 [2025-03-08 15:48:26,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:48:26,875 INFO L225 Difference]: With dead ends: 9850 [2025-03-08 15:48:26,875 INFO L226 Difference]: Without dead ends: 8017 [2025-03-08 15:48:26,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2025-03-08 15:48:26,882 INFO L435 NwaCegarLoop]: 817 mSDtfsCounter, 1607 mSDsluCounter, 2418 mSDsCounter, 0 mSdLazyCounter, 1058 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1607 SdHoareTripleChecker+Valid, 3235 SdHoareTripleChecker+Invalid, 1320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 1058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:48:26,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1607 Valid, 3235 Invalid, 1320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 1058 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 15:48:26,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8017 states. [2025-03-08 15:48:27,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8017 to 5171. [2025-03-08 15:48:27,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5171 states, 4310 states have (on average 1.5522041763341068) internal successors, (6690), 4316 states have internal predecessors, (6690), 840 states have call successors, (840), 20 states have call predecessors, (840), 20 states have return successors, (840), 834 states have call predecessors, (840), 840 states have call successors, (840) [2025-03-08 15:48:27,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5171 states to 5171 states and 8370 transitions. [2025-03-08 15:48:27,206 INFO L78 Accepts]: Start accepts. Automaton has 5171 states and 8370 transitions. Word has length 414 [2025-03-08 15:48:27,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:48:27,207 INFO L471 AbstractCegarLoop]: Abstraction has 5171 states and 8370 transitions. [2025-03-08 15:48:27,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:48:27,207 INFO L276 IsEmpty]: Start isEmpty. Operand 5171 states and 8370 transitions. [2025-03-08 15:48:27,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2025-03-08 15:48:27,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:48:27,214 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:27,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 15:48:27,215 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:48:27,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:48:27,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1715826838, now seen corresponding path program 1 times [2025-03-08 15:48:27,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:48:27,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78253304] [2025-03-08 15:48:27,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:27,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:48:27,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes. [2025-03-08 15:48:27,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements. [2025-03-08 15:48:27,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:27,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:27,394 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-03-08 15:48:27,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:48:27,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78253304] [2025-03-08 15:48:27,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78253304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:48:27,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:48:27,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:48:27,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956390131] [2025-03-08 15:48:27,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:48:27,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:48:27,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:48:27,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:48:27,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:48:27,396 INFO L87 Difference]: Start difference. First operand 5171 states and 8370 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:48:27,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:48:27,624 INFO L93 Difference]: Finished difference Result 14059 states and 22615 transitions. [2025-03-08 15:48:27,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:48:27,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 414 [2025-03-08 15:48:27,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:48:27,676 INFO L225 Difference]: With dead ends: 14059 [2025-03-08 15:48:27,679 INFO L226 Difference]: Without dead ends: 9098 [2025-03-08 15:48:27,696 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:48:27,697 INFO L435 NwaCegarLoop]: 459 mSDtfsCounter, 348 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:48:27,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 863 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:48:27,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9098 states. [2025-03-08 15:48:28,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9098 to 9084. [2025-03-08 15:48:28,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9084 states, 7460 states have (on average 1.5203753351206435) internal successors, (11342), 7484 states have internal predecessors, (11342), 1584 states have call successors, (1584), 39 states have call predecessors, (1584), 39 states have return successors, (1584), 1560 states have call predecessors, (1584), 1584 states have call successors, (1584) [2025-03-08 15:48:28,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9084 states to 9084 states and 14510 transitions. [2025-03-08 15:48:28,223 INFO L78 Accepts]: Start accepts. Automaton has 9084 states and 14510 transitions. Word has length 414 [2025-03-08 15:48:28,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:48:28,223 INFO L471 AbstractCegarLoop]: Abstraction has 9084 states and 14510 transitions. [2025-03-08 15:48:28,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:48:28,224 INFO L276 IsEmpty]: Start isEmpty. Operand 9084 states and 14510 transitions. [2025-03-08 15:48:28,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2025-03-08 15:48:28,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:48:28,232 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:28,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 15:48:28,233 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:48:28,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:48:28,233 INFO L85 PathProgramCache]: Analyzing trace with hash -615960360, now seen corresponding path program 1 times [2025-03-08 15:48:28,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:48:28,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271051266] [2025-03-08 15:48:28,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:28,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:48:28,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes. [2025-03-08 15:48:28,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements. [2025-03-08 15:48:28,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:28,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:29,335 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-03-08 15:48:29,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:48:29,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271051266] [2025-03-08 15:48:29,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271051266] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:48:29,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:48:29,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 15:48:29,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834344555] [2025-03-08 15:48:29,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:48:29,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 15:48:29,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:48:29,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 15:48:29,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:48:29,341 INFO L87 Difference]: Start difference. First operand 9084 states and 14510 transitions. Second operand has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:48:30,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:48:30,611 INFO L93 Difference]: Finished difference Result 20792 states and 33159 transitions. [2025-03-08 15:48:30,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 15:48:30,612 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 414 [2025-03-08 15:48:30,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:48:30,649 INFO L225 Difference]: With dead ends: 20792 [2025-03-08 15:48:30,649 INFO L226 Difference]: Without dead ends: 11922 [2025-03-08 15:48:30,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2025-03-08 15:48:30,672 INFO L435 NwaCegarLoop]: 818 mSDtfsCounter, 1005 mSDsluCounter, 2464 mSDsCounter, 0 mSdLazyCounter, 970 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1005 SdHoareTripleChecker+Valid, 3282 SdHoareTripleChecker+Invalid, 1204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 15:48:30,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1005 Valid, 3282 Invalid, 1204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 970 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 15:48:30,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11922 states. [2025-03-08 15:48:31,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11922 to 8922. [2025-03-08 15:48:31,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8922 states, 7298 states have (on average 1.5165798848999725) internal successors, (11068), 7322 states have internal predecessors, (11068), 1584 states have call successors, (1584), 39 states have call predecessors, (1584), 39 states have return successors, (1584), 1560 states have call predecessors, (1584), 1584 states have call successors, (1584) [2025-03-08 15:48:31,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8922 states to 8922 states and 14236 transitions. [2025-03-08 15:48:31,221 INFO L78 Accepts]: Start accepts. Automaton has 8922 states and 14236 transitions. Word has length 414 [2025-03-08 15:48:31,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:48:31,223 INFO L471 AbstractCegarLoop]: Abstraction has 8922 states and 14236 transitions. [2025-03-08 15:48:31,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:48:31,224 INFO L276 IsEmpty]: Start isEmpty. Operand 8922 states and 14236 transitions. [2025-03-08 15:48:31,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2025-03-08 15:48:31,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:48:31,231 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:31,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 15:48:31,231 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:48:31,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:48:31,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1854925002, now seen corresponding path program 1 times [2025-03-08 15:48:31,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:48:31,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924373843] [2025-03-08 15:48:31,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:31,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:48:31,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes. [2025-03-08 15:48:31,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements. [2025-03-08 15:48:31,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:31,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:33,114 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-03-08 15:48:33,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:48:33,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924373843] [2025-03-08 15:48:33,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924373843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:48:33,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:48:33,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 15:48:33,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130606126] [2025-03-08 15:48:33,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:48:33,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 15:48:33,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:48:33,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 15:48:33,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:48:33,116 INFO L87 Difference]: Start difference. First operand 8922 states and 14236 transitions. Second operand has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:48:34,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:48:34,956 INFO L93 Difference]: Finished difference Result 29891 states and 47362 transitions. [2025-03-08 15:48:34,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 15:48:34,957 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 414 [2025-03-08 15:48:34,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:48:35,026 INFO L225 Difference]: With dead ends: 29891 [2025-03-08 15:48:35,027 INFO L226 Difference]: Without dead ends: 21183 [2025-03-08 15:48:35,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-08 15:48:35,053 INFO L435 NwaCegarLoop]: 776 mSDtfsCounter, 1465 mSDsluCounter, 1576 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1465 SdHoareTripleChecker+Valid, 2352 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:48:35,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1465 Valid, 2352 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 15:48:35,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21183 states. [2025-03-08 15:48:35,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21183 to 20038. [2025-03-08 15:48:35,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20038 states, 16787 states have (on average 1.513909572883779) internal successors, (25414), 16865 states have internal predecessors, (25414), 3144 states have call successors, (3144), 106 states have call predecessors, (3144), 106 states have return successors, (3144), 3066 states have call predecessors, (3144), 3144 states have call successors, (3144) [2025-03-08 15:48:35,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20038 states to 20038 states and 31702 transitions. [2025-03-08 15:48:35,930 INFO L78 Accepts]: Start accepts. Automaton has 20038 states and 31702 transitions. Word has length 414 [2025-03-08 15:48:35,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:48:35,930 INFO L471 AbstractCegarLoop]: Abstraction has 20038 states and 31702 transitions. [2025-03-08 15:48:35,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:48:35,931 INFO L276 IsEmpty]: Start isEmpty. Operand 20038 states and 31702 transitions. [2025-03-08 15:48:35,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2025-03-08 15:48:35,946 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:48:35,946 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:35,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 15:48:35,946 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:48:35,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:48:35,947 INFO L85 PathProgramCache]: Analyzing trace with hash -501615305, now seen corresponding path program 1 times [2025-03-08 15:48:35,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:48:35,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326483569] [2025-03-08 15:48:35,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:35,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:48:35,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes. [2025-03-08 15:48:36,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements. [2025-03-08 15:48:36,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:36,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:36,941 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-03-08 15:48:36,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:48:36,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326483569] [2025-03-08 15:48:36,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326483569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:48:36,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:48:36,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:48:36,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613613627] [2025-03-08 15:48:36,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:48:36,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:48:36,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:48:36,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:48:36,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:48:36,943 INFO L87 Difference]: Start difference. First operand 20038 states and 31702 transitions. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:48:39,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:48:39,194 INFO L93 Difference]: Finished difference Result 48656 states and 76323 transitions. [2025-03-08 15:48:39,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 15:48:39,195 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 414 [2025-03-08 15:48:39,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:48:39,321 INFO L225 Difference]: With dead ends: 48656 [2025-03-08 15:48:39,322 INFO L226 Difference]: Without dead ends: 38658 [2025-03-08 15:48:39,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:48:39,344 INFO L435 NwaCegarLoop]: 787 mSDtfsCounter, 1158 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1158 SdHoareTripleChecker+Valid, 1384 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 15:48:39,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1158 Valid, 1384 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 15:48:39,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38658 states. [2025-03-08 15:48:40,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38658 to 22289. [2025-03-08 15:48:40,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22289 states, 19037 states have (on average 1.534327887797447) internal successors, (29209), 19115 states have internal predecessors, (29209), 3120 states have call successors, (3120), 131 states have call predecessors, (3120), 131 states have return successors, (3120), 3042 states have call predecessors, (3120), 3120 states have call successors, (3120) [2025-03-08 15:48:40,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22289 states to 22289 states and 35449 transitions. [2025-03-08 15:48:40,726 INFO L78 Accepts]: Start accepts. Automaton has 22289 states and 35449 transitions. Word has length 414 [2025-03-08 15:48:40,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:48:40,727 INFO L471 AbstractCegarLoop]: Abstraction has 22289 states and 35449 transitions. [2025-03-08 15:48:40,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:48:40,727 INFO L276 IsEmpty]: Start isEmpty. Operand 22289 states and 35449 transitions. [2025-03-08 15:48:40,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2025-03-08 15:48:40,745 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:48:40,745 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:40,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 15:48:40,745 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:48:40,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:48:40,746 INFO L85 PathProgramCache]: Analyzing trace with hash 23018490, now seen corresponding path program 1 times [2025-03-08 15:48:40,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:48:40,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971926598] [2025-03-08 15:48:40,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:40,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:48:40,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes. [2025-03-08 15:48:41,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements. [2025-03-08 15:48:41,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:41,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:43,128 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 177 refuted. 0 times theorem prover too weak. 6903 trivial. 0 not checked. [2025-03-08 15:48:43,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:48:43,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971926598] [2025-03-08 15:48:43,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971926598] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:48:43,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505066560] [2025-03-08 15:48:43,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:43,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:48:43,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:48:43,132 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:48:43,133 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:48:43,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes. [2025-03-08 15:48:43,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements. [2025-03-08 15:48:43,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:43,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:43,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 1058 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 15:48:43,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:48:44,300 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 4859 proven. 249 refuted. 0 times theorem prover too weak. 1972 trivial. 0 not checked. [2025-03-08 15:48:44,301 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:48:44,758 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 264 proven. 258 refuted. 0 times theorem prover too weak. 6558 trivial. 0 not checked. [2025-03-08 15:48:44,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505066560] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:48:44,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:48:44,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 25 [2025-03-08 15:48:44,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566378354] [2025-03-08 15:48:44,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:48:44,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 15:48:44,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:48:44,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 15:48:44,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2025-03-08 15:48:44,762 INFO L87 Difference]: Start difference. First operand 22289 states and 35449 transitions. Second operand has 25 states, 25 states have (on average 9.2) internal successors, (230), 25 states have internal predecessors, (230), 8 states have call successors, (160), 4 states have call predecessors, (160), 10 states have return successors, (162), 8 states have call predecessors, (162), 8 states have call successors, (162) [2025-03-08 15:48:51,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:48:51,586 INFO L93 Difference]: Finished difference Result 59700 states and 92543 transitions. [2025-03-08 15:48:51,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2025-03-08 15:48:51,587 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 9.2) internal successors, (230), 25 states have internal predecessors, (230), 8 states have call successors, (160), 4 states have call predecessors, (160), 10 states have return successors, (162), 8 states have call predecessors, (162), 8 states have call successors, (162) Word has length 414 [2025-03-08 15:48:51,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:48:51,690 INFO L225 Difference]: With dead ends: 59700 [2025-03-08 15:48:51,690 INFO L226 Difference]: Without dead ends: 37547 [2025-03-08 15:48:51,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 946 GetRequests, 826 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4989 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2747, Invalid=11773, Unknown=0, NotChecked=0, Total=14520 [2025-03-08 15:48:51,727 INFO L435 NwaCegarLoop]: 698 mSDtfsCounter, 3729 mSDsluCounter, 2822 mSDsCounter, 0 mSdLazyCounter, 3543 mSolverCounterSat, 740 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3729 SdHoareTripleChecker+Valid, 3520 SdHoareTripleChecker+Invalid, 4283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 740 IncrementalHoareTripleChecker+Valid, 3543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-08 15:48:51,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3729 Valid, 3520 Invalid, 4283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [740 Valid, 3543 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-08 15:48:51,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37547 states. [2025-03-08 15:48:53,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37547 to 30307. [2025-03-08 15:48:53,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30307 states, 27560 states have (on average 1.5159288824383164) internal successors, (41779), 27620 states have internal predecessors, (41779), 2400 states have call successors, (2400), 346 states have call predecessors, (2400), 346 states have return successors, (2400), 2340 states have call predecessors, (2400), 2400 states have call successors, (2400) [2025-03-08 15:48:53,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30307 states to 30307 states and 46579 transitions. [2025-03-08 15:48:53,494 INFO L78 Accepts]: Start accepts. Automaton has 30307 states and 46579 transitions. Word has length 414 [2025-03-08 15:48:53,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:48:53,498 INFO L471 AbstractCegarLoop]: Abstraction has 30307 states and 46579 transitions. [2025-03-08 15:48:53,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 9.2) internal successors, (230), 25 states have internal predecessors, (230), 8 states have call successors, (160), 4 states have call predecessors, (160), 10 states have return successors, (162), 8 states have call predecessors, (162), 8 states have call successors, (162) [2025-03-08 15:48:53,500 INFO L276 IsEmpty]: Start isEmpty. Operand 30307 states and 46579 transitions. [2025-03-08 15:48:53,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2025-03-08 15:48:53,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:48:53,548 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:53,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 15:48:53,753 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,SelfDestructingSolverStorable12 [2025-03-08 15:48:53,753 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:48:53,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:48:53,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1335022184, now seen corresponding path program 1 times [2025-03-08 15:48:53,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:48:53,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180221512] [2025-03-08 15:48:53,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:53,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:48:53,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 415 statements into 1 equivalence classes. [2025-03-08 15:48:54,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 415 of 415 statements. [2025-03-08 15:48:54,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:54,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:55,485 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-03-08 15:48:55,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:48:55,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180221512] [2025-03-08 15:48:55,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180221512] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:48:55,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:48:55,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 15:48:55,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075245131] [2025-03-08 15:48:55,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:48:55,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 15:48:55,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:48:55,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 15:48:55,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:48:55,492 INFO L87 Difference]: Start difference. First operand 30307 states and 46579 transitions. Second operand has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:48:59,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:48:59,087 INFO L93 Difference]: Finished difference Result 85112 states and 130948 transitions. [2025-03-08 15:48:59,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 15:48:59,088 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 415 [2025-03-08 15:48:59,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:48:59,224 INFO L225 Difference]: With dead ends: 85112 [2025-03-08 15:48:59,225 INFO L226 Difference]: Without dead ends: 55128 [2025-03-08 15:48:59,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:48:59,276 INFO L435 NwaCegarLoop]: 869 mSDtfsCounter, 1374 mSDsluCounter, 1870 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 264 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1374 SdHoareTripleChecker+Valid, 2739 SdHoareTripleChecker+Invalid, 1059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 264 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:48:59,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1374 Valid, 2739 Invalid, 1059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [264 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 15:48:59,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55128 states. [2025-03-08 15:49:01,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55128 to 41716. [2025-03-08 15:49:01,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41716 states, 38081 states have (on average 1.5191827945694703) internal successors, (57852), 38159 states have internal predecessors, (57852), 3180 states have call successors, (3180), 454 states have call predecessors, (3180), 454 states have return successors, (3180), 3102 states have call predecessors, (3180), 3180 states have call successors, (3180) [2025-03-08 15:49:01,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41716 states to 41716 states and 64212 transitions. [2025-03-08 15:49:01,616 INFO L78 Accepts]: Start accepts. Automaton has 41716 states and 64212 transitions. Word has length 415 [2025-03-08 15:49:01,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:49:01,617 INFO L471 AbstractCegarLoop]: Abstraction has 41716 states and 64212 transitions. [2025-03-08 15:49:01,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:49:01,617 INFO L276 IsEmpty]: Start isEmpty. Operand 41716 states and 64212 transitions. [2025-03-08 15:49:01,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2025-03-08 15:49:01,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:49:01,643 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:01,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 15:49:01,644 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:49:01,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:49:01,646 INFO L85 PathProgramCache]: Analyzing trace with hash 542921308, now seen corresponding path program 1 times [2025-03-08 15:49:01,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:49:01,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301184554] [2025-03-08 15:49:01,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:49:01,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:49:01,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 415 statements into 1 equivalence classes. [2025-03-08 15:49:02,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 415 of 415 statements. [2025-03-08 15:49:02,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:49:02,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:49:03,639 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 177 refuted. 0 times theorem prover too weak. 6903 trivial. 0 not checked. [2025-03-08 15:49:03,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:49:03,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301184554] [2025-03-08 15:49:03,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301184554] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:49:03,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485623935] [2025-03-08 15:49:03,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:49:03,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:49:03,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:49:03,647 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:49:03,650 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:49:03,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 415 statements into 1 equivalence classes. [2025-03-08 15:49:03,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 415 of 415 statements. [2025-03-08 15:49:03,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:49:03,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:49:03,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 1059 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 15:49:03,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:49:04,590 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 3039 proven. 171 refuted. 0 times theorem prover too weak. 3870 trivial. 0 not checked. [2025-03-08 15:49:04,591 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:49:04,903 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 6 proven. 171 refuted. 0 times theorem prover too weak. 6903 trivial. 0 not checked. [2025-03-08 15:49:04,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485623935] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:49:04,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:49:04,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 16 [2025-03-08 15:49:04,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770048712] [2025-03-08 15:49:04,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:49:04,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 15:49:04,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:49:04,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 15:49:04,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2025-03-08 15:49:04,906 INFO L87 Difference]: Start difference. First operand 41716 states and 64212 transitions. Second operand has 16 states, 16 states have (on average 14.5) internal successors, (232), 16 states have internal predecessors, (232), 7 states have call successors, (176), 3 states have call predecessors, (176), 5 states have return successors, (178), 7 states have call predecessors, (178), 7 states have call successors, (178) [2025-03-08 15:49:11,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:49:11,617 INFO L93 Difference]: Finished difference Result 92660 states and 139883 transitions. [2025-03-08 15:49:11,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2025-03-08 15:49:11,618 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 14.5) internal successors, (232), 16 states have internal predecessors, (232), 7 states have call successors, (176), 3 states have call predecessors, (176), 5 states have return successors, (178), 7 states have call predecessors, (178), 7 states have call successors, (178) Word has length 415 [2025-03-08 15:49:11,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:49:11,757 INFO L225 Difference]: With dead ends: 92660 [2025-03-08 15:49:11,757 INFO L226 Difference]: Without dead ends: 51092 [2025-03-08 15:49:11,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 921 GetRequests, 837 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2218 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1468, Invalid=5842, Unknown=0, NotChecked=0, Total=7310 [2025-03-08 15:49:11,808 INFO L435 NwaCegarLoop]: 924 mSDtfsCounter, 4032 mSDsluCounter, 2704 mSDsCounter, 0 mSdLazyCounter, 3046 mSolverCounterSat, 643 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4032 SdHoareTripleChecker+Valid, 3628 SdHoareTripleChecker+Invalid, 3689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 643 IncrementalHoareTripleChecker+Valid, 3046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-08 15:49:11,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4032 Valid, 3628 Invalid, 3689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [643 Valid, 3046 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-08 15:49:11,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51092 states. [2025-03-08 15:49:13,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51092 to 39328. [2025-03-08 15:49:13,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39328 states, 35510 states have (on average 1.4998591945930724) internal successors, (53260), 35588 states have internal predecessors, (53260), 3180 states have call successors, (3180), 637 states have call predecessors, (3180), 637 states have return successors, (3180), 3102 states have call predecessors, (3180), 3180 states have call successors, (3180) [2025-03-08 15:49:13,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39328 states to 39328 states and 59620 transitions. [2025-03-08 15:49:13,769 INFO L78 Accepts]: Start accepts. Automaton has 39328 states and 59620 transitions. Word has length 415 [2025-03-08 15:49:13,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:49:13,770 INFO L471 AbstractCegarLoop]: Abstraction has 39328 states and 59620 transitions. [2025-03-08 15:49:13,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 14.5) internal successors, (232), 16 states have internal predecessors, (232), 7 states have call successors, (176), 3 states have call predecessors, (176), 5 states have return successors, (178), 7 states have call predecessors, (178), 7 states have call successors, (178) [2025-03-08 15:49:13,770 INFO L276 IsEmpty]: Start isEmpty. Operand 39328 states and 59620 transitions. [2025-03-08 15:49:13,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2025-03-08 15:49:13,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:49:13,789 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:13,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 15:49:13,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:49:13,994 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:49:13,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:49:13,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1957195113, now seen corresponding path program 1 times [2025-03-08 15:49:13,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:49:13,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367466213] [2025-03-08 15:49:13,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:49:13,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:49:14,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 415 statements into 1 equivalence classes. [2025-03-08 15:49:14,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 415 of 415 statements. [2025-03-08 15:49:14,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:49:14,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:49:14,773 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 177 refuted. 0 times theorem prover too weak. 6903 trivial. 0 not checked. [2025-03-08 15:49:14,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:49:14,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367466213] [2025-03-08 15:49:14,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367466213] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:49:14,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114959195] [2025-03-08 15:49:14,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:49:14,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:49:14,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:49:14,775 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:49:14,777 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:49:14,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 415 statements into 1 equivalence classes. [2025-03-08 15:49:15,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 415 of 415 statements. [2025-03-08 15:49:15,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:49:15,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:49:15,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 1058 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 15:49:15,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:49:15,589 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 1049 proven. 12 refuted. 0 times theorem prover too weak. 6019 trivial. 0 not checked. [2025-03-08 15:49:15,589 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:49:16,049 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 165 proven. 12 refuted. 0 times theorem prover too weak. 6903 trivial. 0 not checked. [2025-03-08 15:49:16,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114959195] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:49:16,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:49:16,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 21 [2025-03-08 15:49:16,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273237704] [2025-03-08 15:49:16,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:49:16,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 15:49:16,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:49:16,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 15:49:16,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2025-03-08 15:49:16,052 INFO L87 Difference]: Start difference. First operand 39328 states and 59620 transitions. Second operand has 21 states, 20 states have (on average 14.1) internal successors, (282), 21 states have internal predecessors, (282), 6 states have call successors, (180), 3 states have call predecessors, (180), 6 states have return successors, (180), 5 states have call predecessors, (180), 6 states have call successors, (180)