./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-48.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-48.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 5054d685be7479f98d5d246ff0f244e50fabd251a7020bbdbd6362d047caf08a --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:41:01,884 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:41:01,943 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 02:41:01,946 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:41:01,947 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:41:01,962 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:41:01,962 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:41:01,962 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:41:01,962 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:41:01,963 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:41:01,963 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:41:01,963 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:41:01,963 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:41:01,963 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:41:01,963 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:41:01,963 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:41:01,963 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:41:01,963 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:41:01,963 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:41:01,963 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:41:01,964 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:41:01,964 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:41:01,964 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:41:01,964 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:41:01,964 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:41:01,964 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:41:01,964 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:41:01,964 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:41:01,964 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:41:01,964 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:41:01,964 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:41:01,964 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:41:01,964 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:41:01,964 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:41:01,964 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:41:01,964 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:41:01,964 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:41:01,964 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:41:01,965 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:41:01,965 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:41:01,965 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:41:01,965 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:41:01,965 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:41:01,965 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-jdk21/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 -> 5054d685be7479f98d5d246ff0f244e50fabd251a7020bbdbd6362d047caf08a [2025-02-06 02:41:02,183 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:41:02,190 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:41:02,191 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:41:02,192 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:41:02,192 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:41:02,193 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-48.i [2025-02-06 02:41:03,353 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/07ced0beb/5fdbad18b5894917bf3c472415bbcdd2/FLAGcb4a737a4 [2025-02-06 02:41:03,609 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:41:03,609 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-48.i [2025-02-06 02:41:03,620 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/07ced0beb/5fdbad18b5894917bf3c472415bbcdd2/FLAGcb4a737a4 [2025-02-06 02:41:03,630 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/07ced0beb/5fdbad18b5894917bf3c472415bbcdd2 [2025-02-06 02:41:03,632 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:41:03,633 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:41:03,634 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:41:03,634 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:41:03,636 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:41:03,637 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:41:03" (1/1) ... [2025-02-06 02:41:03,637 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b0a8f4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:03, skipping insertion in model container [2025-02-06 02:41:03,637 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:41:03" (1/1) ... [2025-02-06 02:41:03,664 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:41:03,770 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-48.i[916,929] [2025-02-06 02:41:03,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:41:03,917 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:41:03,924 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-48.i[916,929] [2025-02-06 02:41:04,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:41:04,025 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:41:04,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:04 WrapperNode [2025-02-06 02:41:04,025 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:41:04,026 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:41:04,026 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:41:04,026 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:41:04,030 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:04" (1/1) ... [2025-02-06 02:41:04,052 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:04" (1/1) ... [2025-02-06 02:41:04,134 INFO L138 Inliner]: procedures = 26, calls = 96, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 767 [2025-02-06 02:41:04,135 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:41:04,136 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:41:04,136 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:41:04,136 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:41:04,143 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:04" (1/1) ... [2025-02-06 02:41:04,143 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:04" (1/1) ... [2025-02-06 02:41:04,156 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:04" (1/1) ... [2025-02-06 02:41:04,196 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-02-06 02:41:04,196 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:04" (1/1) ... [2025-02-06 02:41:04,196 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:04" (1/1) ... [2025-02-06 02:41:04,222 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:04" (1/1) ... [2025-02-06 02:41:04,229 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:04" (1/1) ... [2025-02-06 02:41:04,235 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:04" (1/1) ... [2025-02-06 02:41:04,244 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:04" (1/1) ... [2025-02-06 02:41:04,256 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:41:04,258 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:41:04,258 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:41:04,259 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:41:04,259 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:04" (1/1) ... [2025-02-06 02:41:04,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:41:04,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:41:04,285 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 02:41:04,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 02:41:04,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:41:04,306 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:41:04,306 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:41:04,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:41:04,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:41:04,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:41:04,416 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:41:04,417 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:41:05,197 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L674: havoc property_#t~ite58#1;havoc property_#t~ite57#1;havoc property_#t~ite56#1;havoc property_#t~bitwise55#1;havoc property_#t~bitwise59#1;havoc property_#t~short60#1;havoc property_#t~ite63#1;havoc property_#t~ite62#1;havoc property_#t~bitwise61#1;havoc property_#t~short64#1;havoc property_#t~ite68#1;havoc property_#t~bitwise65#1;havoc property_#t~ite67#1;havoc property_#t~bitwise66#1;havoc property_#t~short69#1; [2025-02-06 02:41:05,329 INFO L? ?]: Removed 93 outVars from TransFormulas that were not future-live. [2025-02-06 02:41:05,329 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:41:05,355 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:41:05,355 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:41:05,355 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:41:05 BoogieIcfgContainer [2025-02-06 02:41:05,355 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:41:05,357 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:41:05,358 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:41:05,361 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:41:05,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:41:03" (1/3) ... [2025-02-06 02:41:05,362 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d4789eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:41:05, skipping insertion in model container [2025-02-06 02:41:05,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:04" (2/3) ... [2025-02-06 02:41:05,362 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d4789eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:41:05, skipping insertion in model container [2025-02-06 02:41:05,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:41:05" (3/3) ... [2025-02-06 02:41:05,363 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-48.i [2025-02-06 02:41:05,374 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:41:05,376 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-48.i that has 2 procedures, 306 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:41:05,429 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:41:05,440 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;@e5b9f63, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:41:05,441 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:41:05,445 INFO L276 IsEmpty]: Start isEmpty. Operand has 306 states, 220 states have (on average 1.5363636363636364) internal successors, (338), 221 states have internal predecessors, (338), 83 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) [2025-02-06 02:41:05,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 545 [2025-02-06 02:41:05,470 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:05,471 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:41:05,472 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:05,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:05,476 INFO L85 PathProgramCache]: Analyzing trace with hash -105062391, now seen corresponding path program 1 times [2025-02-06 02:41:05,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:05,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424331113] [2025-02-06 02:41:05,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:05,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:05,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 544 statements into 1 equivalence classes. [2025-02-06 02:41:05,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 544 of 544 statements. [2025-02-06 02:41:05,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:05,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:06,350 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13612 trivial. 0 not checked. [2025-02-06 02:41:06,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:06,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424331113] [2025-02-06 02:41:06,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424331113] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:06,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:06,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:41:06,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425711722] [2025-02-06 02:41:06,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:06,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:41:06,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:06,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:41:06,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:41:06,376 INFO L87 Difference]: Start difference. First operand has 306 states, 220 states have (on average 1.5363636363636364) internal successors, (338), 221 states have internal predecessors, (338), 83 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-02-06 02:41:06,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:06,579 INFO L93 Difference]: Finished difference Result 896 states and 1648 transitions. [2025-02-06 02:41:06,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:41:06,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) Word has length 544 [2025-02-06 02:41:06,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:06,594 INFO L225 Difference]: With dead ends: 896 [2025-02-06 02:41:06,594 INFO L226 Difference]: Without dead ends: 593 [2025-02-06 02:41:06,601 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-02-06 02:41:06,602 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 454 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 1297 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:06,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 1297 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:41:06,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-02-06 02:41:06,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 358. [2025-02-06 02:41:06,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 273 states have (on average 1.5494505494505495) internal successors, (423), 273 states have internal predecessors, (423), 83 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) [2025-02-06 02:41:06,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 589 transitions. [2025-02-06 02:41:06,694 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 589 transitions. Word has length 544 [2025-02-06 02:41:06,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:06,699 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 589 transitions. [2025-02-06 02:41:06,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-02-06 02:41:06,699 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 589 transitions. [2025-02-06 02:41:06,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2025-02-06 02:41:06,709 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:06,709 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:41:06,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 02:41:06,710 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:06,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:06,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1276555603, now seen corresponding path program 1 times [2025-02-06 02:41:06,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:06,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440366106] [2025-02-06 02:41:06,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:06,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:06,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 545 statements into 1 equivalence classes. [2025-02-06 02:41:06,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 545 of 545 statements. [2025-02-06 02:41:06,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:06,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:07,093 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13612 trivial. 0 not checked. [2025-02-06 02:41:07,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:07,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440366106] [2025-02-06 02:41:07,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440366106] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:07,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:07,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:41:07,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501344876] [2025-02-06 02:41:07,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:07,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:41:07,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:07,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:41:07,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:41:07,101 INFO L87 Difference]: Start difference. First operand 358 states and 589 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-02-06 02:41:07,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:07,213 INFO L93 Difference]: Finished difference Result 991 states and 1633 transitions. [2025-02-06 02:41:07,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:41:07,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) Word has length 545 [2025-02-06 02:41:07,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:07,224 INFO L225 Difference]: With dead ends: 991 [2025-02-06 02:41:07,224 INFO L226 Difference]: Without dead ends: 636 [2025-02-06 02:41:07,226 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-02-06 02:41:07,226 INFO L435 NwaCegarLoop]: 743 mSDtfsCounter, 334 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:07,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 1217 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:41:07,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2025-02-06 02:41:07,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 633. [2025-02-06 02:41:07,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 506 states have (on average 1.5711462450592886) internal successors, (795), 507 states have internal predecessors, (795), 124 states have call successors, (124), 2 states have call predecessors, (124), 2 states have return successors, (124), 123 states have call predecessors, (124), 124 states have call successors, (124) [2025-02-06 02:41:07,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 1043 transitions. [2025-02-06 02:41:07,296 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 1043 transitions. Word has length 545 [2025-02-06 02:41:07,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:07,298 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 1043 transitions. [2025-02-06 02:41:07,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-02-06 02:41:07,299 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 1043 transitions. [2025-02-06 02:41:07,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2025-02-06 02:41:07,309 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:07,310 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:41:07,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:41:07,310 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:07,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:07,313 INFO L85 PathProgramCache]: Analyzing trace with hash -832477646, now seen corresponding path program 1 times [2025-02-06 02:41:07,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:07,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015066999] [2025-02-06 02:41:07,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:07,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:07,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 545 statements into 1 equivalence classes. [2025-02-06 02:41:07,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 545 of 545 statements. [2025-02-06 02:41:07,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:07,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:07,817 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13612 trivial. 0 not checked. [2025-02-06 02:41:07,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:07,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015066999] [2025-02-06 02:41:07,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015066999] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:07,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:07,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:41:07,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298020957] [2025-02-06 02:41:07,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:07,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:41:07,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:07,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:41:07,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:41:07,822 INFO L87 Difference]: Start difference. First operand 633 states and 1043 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-02-06 02:41:07,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:07,921 INFO L93 Difference]: Finished difference Result 1263 states and 2083 transitions. [2025-02-06 02:41:07,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:41:07,922 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) Word has length 545 [2025-02-06 02:41:07,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:07,929 INFO L225 Difference]: With dead ends: 1263 [2025-02-06 02:41:07,931 INFO L226 Difference]: Without dead ends: 633 [2025-02-06 02:41:07,933 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-02-06 02:41:07,935 INFO L435 NwaCegarLoop]: 448 mSDtfsCounter, 317 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:07,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 448 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:41:07,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2025-02-06 02:41:07,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 633. [2025-02-06 02:41:07,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 506 states have (on average 1.5632411067193677) internal successors, (791), 507 states have internal predecessors, (791), 124 states have call successors, (124), 2 states have call predecessors, (124), 2 states have return successors, (124), 123 states have call predecessors, (124), 124 states have call successors, (124) [2025-02-06 02:41:07,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 1039 transitions. [2025-02-06 02:41:07,984 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 1039 transitions. Word has length 545 [2025-02-06 02:41:07,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:07,985 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 1039 transitions. [2025-02-06 02:41:07,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-02-06 02:41:07,985 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 1039 transitions. [2025-02-06 02:41:07,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 547 [2025-02-06 02:41:07,996 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:07,996 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:41:07,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 02:41:07,996 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:07,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:07,997 INFO L85 PathProgramCache]: Analyzing trace with hash 2123787730, now seen corresponding path program 1 times [2025-02-06 02:41:07,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:07,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825524123] [2025-02-06 02:41:07,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:07,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:08,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 546 statements into 1 equivalence classes. [2025-02-06 02:41:08,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 546 of 546 statements. [2025-02-06 02:41:08,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:08,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:08,256 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13612 trivial. 0 not checked. [2025-02-06 02:41:08,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:08,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825524123] [2025-02-06 02:41:08,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825524123] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:08,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:08,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:41:08,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191921691] [2025-02-06 02:41:08,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:08,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:41:08,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:08,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:41:08,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:41:08,258 INFO L87 Difference]: Start difference. First operand 633 states and 1039 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-02-06 02:41:08,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:08,386 INFO L93 Difference]: Finished difference Result 1712 states and 2797 transitions. [2025-02-06 02:41:08,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:41:08,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) Word has length 546 [2025-02-06 02:41:08,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:08,392 INFO L225 Difference]: With dead ends: 1712 [2025-02-06 02:41:08,392 INFO L226 Difference]: Without dead ends: 1082 [2025-02-06 02:41:08,394 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-02-06 02:41:08,395 INFO L435 NwaCegarLoop]: 795 mSDtfsCounter, 408 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 1223 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:08,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 1223 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:41:08,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2025-02-06 02:41:08,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 807. [2025-02-06 02:41:08,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 807 states, 680 states have (on average 1.575) internal successors, (1071), 681 states have internal predecessors, (1071), 124 states have call successors, (124), 2 states have call predecessors, (124), 2 states have return successors, (124), 123 states have call predecessors, (124), 124 states have call successors, (124) [2025-02-06 02:41:08,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1319 transitions. [2025-02-06 02:41:08,470 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1319 transitions. Word has length 546 [2025-02-06 02:41:08,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:08,471 INFO L471 AbstractCegarLoop]: Abstraction has 807 states and 1319 transitions. [2025-02-06 02:41:08,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-02-06 02:41:08,471 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1319 transitions. [2025-02-06 02:41:08,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 548 [2025-02-06 02:41:08,475 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:08,476 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:41:08,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 02:41:08,476 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:08,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:08,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1668508903, now seen corresponding path program 1 times [2025-02-06 02:41:08,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:08,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159329773] [2025-02-06 02:41:08,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:08,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:08,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 547 statements into 1 equivalence classes. [2025-02-06 02:41:08,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 547 of 547 statements. [2025-02-06 02:41:08,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:08,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:09,176 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13612 trivial. 0 not checked. [2025-02-06 02:41:09,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:09,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159329773] [2025-02-06 02:41:09,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159329773] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:09,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:09,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 02:41:09,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023899487] [2025-02-06 02:41:09,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:09,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 02:41:09,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:09,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 02:41:09,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:41:09,181 INFO L87 Difference]: Start difference. First operand 807 states and 1319 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 7 states have internal predecessors, (135), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-02-06 02:41:09,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:09,688 INFO L93 Difference]: Finished difference Result 1615 states and 2643 transitions. [2025-02-06 02:41:09,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 02:41:09,688 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 7 states have internal predecessors, (135), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) Word has length 547 [2025-02-06 02:41:09,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:09,693 INFO L225 Difference]: With dead ends: 1615 [2025-02-06 02:41:09,693 INFO L226 Difference]: Without dead ends: 811 [2025-02-06 02:41:09,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-06 02:41:09,695 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 714 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:09,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 1095 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:41:09,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2025-02-06 02:41:09,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 811. [2025-02-06 02:41:09,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 684 states have (on average 1.5716374269005848) internal successors, (1075), 685 states have internal predecessors, (1075), 124 states have call successors, (124), 2 states have call predecessors, (124), 2 states have return successors, (124), 123 states have call predecessors, (124), 124 states have call successors, (124) [2025-02-06 02:41:09,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1323 transitions. [2025-02-06 02:41:09,731 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1323 transitions. Word has length 547 [2025-02-06 02:41:09,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:09,732 INFO L471 AbstractCegarLoop]: Abstraction has 811 states and 1323 transitions. [2025-02-06 02:41:09,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 7 states have internal predecessors, (135), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-02-06 02:41:09,732 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1323 transitions. [2025-02-06 02:41:09,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2025-02-06 02:41:09,735 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:09,736 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:41:09,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 02:41:09,736 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:09,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:09,736 INFO L85 PathProgramCache]: Analyzing trace with hash -882051502, now seen corresponding path program 1 times [2025-02-06 02:41:09,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:09,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619621538] [2025-02-06 02:41:09,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:09,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:09,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 548 statements into 1 equivalence classes. [2025-02-06 02:41:09,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 548 of 548 statements. [2025-02-06 02:41:09,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:09,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:10,180 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13612 trivial. 0 not checked. [2025-02-06 02:41:10,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:10,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619621538] [2025-02-06 02:41:10,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619621538] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:10,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:10,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:41:10,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543405657] [2025-02-06 02:41:10,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:10,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:41:10,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:10,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:41:10,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:41:10,188 INFO L87 Difference]: Start difference. First operand 811 states and 1323 transitions. Second operand has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-02-06 02:41:10,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:10,630 INFO L93 Difference]: Finished difference Result 2361 states and 3857 transitions. [2025-02-06 02:41:10,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:41:10,630 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) Word has length 548 [2025-02-06 02:41:10,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:10,637 INFO L225 Difference]: With dead ends: 2361 [2025-02-06 02:41:10,637 INFO L226 Difference]: Without dead ends: 1553 [2025-02-06 02:41:10,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:41:10,639 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 322 mSDsluCounter, 1241 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 1714 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:10,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 1714 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:41:10,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1553 states. [2025-02-06 02:41:10,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1553 to 946. [2025-02-06 02:41:10,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 946 states, 735 states have (on average 1.5319727891156463) internal successors, (1126), 736 states have internal predecessors, (1126), 207 states have call successors, (207), 3 states have call predecessors, (207), 3 states have return successors, (207), 206 states have call predecessors, (207), 207 states have call successors, (207) [2025-02-06 02:41:10,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1540 transitions. [2025-02-06 02:41:10,703 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 1540 transitions. Word has length 548 [2025-02-06 02:41:10,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:10,703 INFO L471 AbstractCegarLoop]: Abstraction has 946 states and 1540 transitions. [2025-02-06 02:41:10,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-02-06 02:41:10,704 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1540 transitions. [2025-02-06 02:41:10,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2025-02-06 02:41:10,706 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:10,707 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:41:10,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 02:41:10,707 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:10,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:10,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1927860243, now seen corresponding path program 1 times [2025-02-06 02:41:10,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:10,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540998268] [2025-02-06 02:41:10,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:10,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:10,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 548 statements into 1 equivalence classes. [2025-02-06 02:41:10,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 548 of 548 statements. [2025-02-06 02:41:10,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:10,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:11,194 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13612 trivial. 0 not checked. [2025-02-06 02:41:11,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:11,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540998268] [2025-02-06 02:41:11,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540998268] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:11,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:11,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:41:11,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224234130] [2025-02-06 02:41:11,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:11,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:41:11,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:11,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:41:11,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:41:11,196 INFO L87 Difference]: Start difference. First operand 946 states and 1540 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-02-06 02:41:11,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:11,357 INFO L93 Difference]: Finished difference Result 2562 states and 4180 transitions. [2025-02-06 02:41:11,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:41:11,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) Word has length 548 [2025-02-06 02:41:11,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:11,366 INFO L225 Difference]: With dead ends: 2562 [2025-02-06 02:41:11,367 INFO L226 Difference]: Without dead ends: 1754 [2025-02-06 02:41:11,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:41:11,370 INFO L435 NwaCegarLoop]: 460 mSDtfsCounter, 283 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 1370 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:11,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 1370 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:41:11,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1754 states. [2025-02-06 02:41:11,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1754 to 1736. [2025-02-06 02:41:11,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1736 states, 1399 states have (on average 1.544674767691208) internal successors, (2161), 1401 states have internal predecessors, (2161), 331 states have call successors, (331), 5 states have call predecessors, (331), 5 states have return successors, (331), 329 states have call predecessors, (331), 331 states have call successors, (331) [2025-02-06 02:41:11,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1736 states to 1736 states and 2823 transitions. [2025-02-06 02:41:11,491 INFO L78 Accepts]: Start accepts. Automaton has 1736 states and 2823 transitions. Word has length 548 [2025-02-06 02:41:11,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:11,492 INFO L471 AbstractCegarLoop]: Abstraction has 1736 states and 2823 transitions. [2025-02-06 02:41:11,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-02-06 02:41:11,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1736 states and 2823 transitions. [2025-02-06 02:41:11,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 550 [2025-02-06 02:41:11,497 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:11,497 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:41:11,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 02:41:11,498 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:11,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:11,498 INFO L85 PathProgramCache]: Analyzing trace with hash -975212493, now seen corresponding path program 1 times [2025-02-06 02:41:11,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:11,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467805656] [2025-02-06 02:41:11,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:11,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:11,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 549 statements into 1 equivalence classes. [2025-02-06 02:41:11,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 549 of 549 statements. [2025-02-06 02:41:11,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:11,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:12,025 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13612 trivial. 0 not checked. [2025-02-06 02:41:12,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:12,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467805656] [2025-02-06 02:41:12,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467805656] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:12,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:12,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:41:12,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252237401] [2025-02-06 02:41:12,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:12,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:41:12,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:12,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:41:12,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:41:12,027 INFO L87 Difference]: Start difference. First operand 1736 states and 2823 transitions. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-02-06 02:41:12,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:12,470 INFO L93 Difference]: Finished difference Result 6116 states and 9964 transitions. [2025-02-06 02:41:12,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 02:41:12,471 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) Word has length 549 [2025-02-06 02:41:12,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:12,489 INFO L225 Difference]: With dead ends: 6116 [2025-02-06 02:41:12,490 INFO L226 Difference]: Without dead ends: 4518 [2025-02-06 02:41:12,495 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-02-06 02:41:12,495 INFO L435 NwaCegarLoop]: 712 mSDtfsCounter, 580 mSDsluCounter, 1644 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 2356 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:12,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 2356 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:41:12,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4518 states. [2025-02-06 02:41:12,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4518 to 3336. [2025-02-06 02:41:12,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3336 states, 2747 states have (on average 1.5540589734255552) internal successors, (4269), 2751 states have internal predecessors, (4269), 579 states have call successors, (579), 9 states have call predecessors, (579), 9 states have return successors, (579), 575 states have call predecessors, (579), 579 states have call successors, (579) [2025-02-06 02:41:12,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 5427 transitions. [2025-02-06 02:41:12,715 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 5427 transitions. Word has length 549 [2025-02-06 02:41:12,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:12,716 INFO L471 AbstractCegarLoop]: Abstraction has 3336 states and 5427 transitions. [2025-02-06 02:41:12,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-02-06 02:41:12,716 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 5427 transitions. [2025-02-06 02:41:12,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 550 [2025-02-06 02:41:12,722 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:12,723 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:41:12,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 02:41:12,723 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:12,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:12,724 INFO L85 PathProgramCache]: Analyzing trace with hash -961679692, now seen corresponding path program 1 times [2025-02-06 02:41:12,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:12,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744769166] [2025-02-06 02:41:12,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:12,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:12,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 549 statements into 1 equivalence classes. [2025-02-06 02:41:12,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 549 of 549 statements. [2025-02-06 02:41:12,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:12,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:13,900 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13612 trivial. 0 not checked. [2025-02-06 02:41:13,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:13,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744769166] [2025-02-06 02:41:13,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744769166] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:13,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:13,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:41:13,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392021888] [2025-02-06 02:41:13,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:13,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 02:41:13,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:13,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 02:41:13,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:41:13,902 INFO L87 Difference]: Start difference. First operand 3336 states and 5427 transitions. Second operand has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-02-06 02:41:15,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:15,248 INFO L93 Difference]: Finished difference Result 13278 states and 21539 transitions. [2025-02-06 02:41:15,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 02:41:15,248 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) Word has length 549 [2025-02-06 02:41:15,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:15,284 INFO L225 Difference]: With dead ends: 13278 [2025-02-06 02:41:15,285 INFO L226 Difference]: Without dead ends: 10080 [2025-02-06 02:41:15,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-02-06 02:41:15,297 INFO L435 NwaCegarLoop]: 844 mSDtfsCounter, 1174 mSDsluCounter, 1792 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 546 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1174 SdHoareTripleChecker+Valid, 2636 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 546 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:15,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1174 Valid, 2636 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [546 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 02:41:15,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10080 states. [2025-02-06 02:41:15,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10080 to 6488. [2025-02-06 02:41:15,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6488 states, 5728 states have (on average 1.6024790502793296) internal successors, (9179), 5732 states have internal predecessors, (9179), 745 states have call successors, (745), 14 states have call predecessors, (745), 14 states have return successors, (745), 741 states have call predecessors, (745), 745 states have call successors, (745) [2025-02-06 02:41:15,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6488 states to 6488 states and 10669 transitions. [2025-02-06 02:41:15,670 INFO L78 Accepts]: Start accepts. Automaton has 6488 states and 10669 transitions. Word has length 549 [2025-02-06 02:41:15,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:15,671 INFO L471 AbstractCegarLoop]: Abstraction has 6488 states and 10669 transitions. [2025-02-06 02:41:15,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-02-06 02:41:15,676 INFO L276 IsEmpty]: Start isEmpty. Operand 6488 states and 10669 transitions. [2025-02-06 02:41:15,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 550 [2025-02-06 02:41:15,685 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:15,685 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:41:15,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 02:41:15,686 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:15,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:15,687 INFO L85 PathProgramCache]: Analyzing trace with hash 342714037, now seen corresponding path program 1 times [2025-02-06 02:41:15,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:15,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185152194] [2025-02-06 02:41:15,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:15,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:15,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 549 statements into 1 equivalence classes. [2025-02-06 02:41:16,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 549 of 549 statements. [2025-02-06 02:41:16,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:16,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:16,760 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13612 trivial. 0 not checked. [2025-02-06 02:41:16,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:16,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185152194] [2025-02-06 02:41:16,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185152194] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:16,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:16,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:41:16,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920443348] [2025-02-06 02:41:16,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:16,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:41:16,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:16,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:41:16,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:41:16,762 INFO L87 Difference]: Start difference. First operand 6488 states and 10669 transitions. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-02-06 02:41:17,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:17,498 INFO L93 Difference]: Finished difference Result 21096 states and 34484 transitions. [2025-02-06 02:41:17,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:41:17,499 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) Word has length 549 [2025-02-06 02:41:17,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:17,551 INFO L225 Difference]: With dead ends: 21096 [2025-02-06 02:41:17,551 INFO L226 Difference]: Without dead ends: 15316 [2025-02-06 02:41:17,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:41:17,564 INFO L435 NwaCegarLoop]: 676 mSDtfsCounter, 913 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 1391 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:17,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [913 Valid, 1391 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:41:17,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15316 states. [2025-02-06 02:41:17,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15316 to 14534. [2025-02-06 02:41:18,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14534 states, 13268 states have (on average 1.5974525173349412) internal successors, (21195), 13282 states have internal predecessors, (21195), 1239 states have call successors, (1239), 26 states have call predecessors, (1239), 26 states have return successors, (1239), 1225 states have call predecessors, (1239), 1239 states have call successors, (1239) [2025-02-06 02:41:18,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14534 states to 14534 states and 23673 transitions. [2025-02-06 02:41:18,063 INFO L78 Accepts]: Start accepts. Automaton has 14534 states and 23673 transitions. Word has length 549 [2025-02-06 02:41:18,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:18,064 INFO L471 AbstractCegarLoop]: Abstraction has 14534 states and 23673 transitions. [2025-02-06 02:41:18,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-02-06 02:41:18,064 INFO L276 IsEmpty]: Start isEmpty. Operand 14534 states and 23673 transitions. [2025-02-06 02:41:18,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 550 [2025-02-06 02:41:18,080 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:18,080 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:41:18,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 02:41:18,081 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:18,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:18,081 INFO L85 PathProgramCache]: Analyzing trace with hash 462833910, now seen corresponding path program 1 times [2025-02-06 02:41:18,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:18,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499095953] [2025-02-06 02:41:18,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:18,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:18,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 549 statements into 1 equivalence classes. [2025-02-06 02:41:18,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 549 of 549 statements. [2025-02-06 02:41:18,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:18,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:18,265 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13612 trivial. 0 not checked. [2025-02-06 02:41:18,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:18,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499095953] [2025-02-06 02:41:18,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499095953] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:18,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:18,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:41:18,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375163160] [2025-02-06 02:41:18,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:18,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:41:18,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:18,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:41:18,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:41:18,267 INFO L87 Difference]: Start difference. First operand 14534 states and 23673 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-02-06 02:41:18,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:18,821 INFO L93 Difference]: Finished difference Result 26604 states and 43213 transitions. [2025-02-06 02:41:18,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:41:18,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) Word has length 549 [2025-02-06 02:41:18,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:18,877 INFO L225 Difference]: With dead ends: 26604 [2025-02-06 02:41:18,878 INFO L226 Difference]: Without dead ends: 18296 [2025-02-06 02:41:18,899 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-02-06 02:41:18,899 INFO L435 NwaCegarLoop]: 793 mSDtfsCounter, 417 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 1257 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:18,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 1257 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:41:18,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18296 states. [2025-02-06 02:41:19,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18296 to 18294. [2025-02-06 02:41:19,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18294 states, 16580 states have (on average 1.582086851628468) internal successors, (26231), 16600 states have internal predecessors, (26231), 1679 states have call successors, (1679), 34 states have call predecessors, (1679), 34 states have return successors, (1679), 1659 states have call predecessors, (1679), 1679 states have call successors, (1679) [2025-02-06 02:41:19,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18294 states to 18294 states and 29589 transitions. [2025-02-06 02:41:19,541 INFO L78 Accepts]: Start accepts. Automaton has 18294 states and 29589 transitions. Word has length 549 [2025-02-06 02:41:19,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:19,541 INFO L471 AbstractCegarLoop]: Abstraction has 18294 states and 29589 transitions. [2025-02-06 02:41:19,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-02-06 02:41:19,542 INFO L276 IsEmpty]: Start isEmpty. Operand 18294 states and 29589 transitions. [2025-02-06 02:41:19,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 550 [2025-02-06 02:41:19,559 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:19,559 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:41:19,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 02:41:19,560 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:19,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:19,560 INFO L85 PathProgramCache]: Analyzing trace with hash -534238443, now seen corresponding path program 1 times [2025-02-06 02:41:19,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:19,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459642891] [2025-02-06 02:41:19,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:19,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:19,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 549 statements into 1 equivalence classes. [2025-02-06 02:41:19,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 549 of 549 statements. [2025-02-06 02:41:19,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:19,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:20,590 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13612 trivial. 0 not checked. [2025-02-06 02:41:20,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:20,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459642891] [2025-02-06 02:41:20,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459642891] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:20,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:20,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:41:20,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074068159] [2025-02-06 02:41:20,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:20,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:41:20,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:20,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:41:20,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:41:20,593 INFO L87 Difference]: Start difference. First operand 18294 states and 29589 transitions. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-02-06 02:41:21,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:21,522 INFO L93 Difference]: Finished difference Result 44128 states and 71110 transitions. [2025-02-06 02:41:21,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:41:21,523 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) Word has length 549 [2025-02-06 02:41:21,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:21,594 INFO L225 Difference]: With dead ends: 44128 [2025-02-06 02:41:21,594 INFO L226 Difference]: Without dead ends: 26722 [2025-02-06 02:41:21,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:41:21,632 INFO L435 NwaCegarLoop]: 720 mSDtfsCounter, 664 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 1354 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:21,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 1354 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:41:21,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26722 states. [2025-02-06 02:41:22,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26722 to 17752. [2025-02-06 02:41:22,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17752 states, 16202 states have (on average 1.596531292433033) internal successors, (25867), 16218 states have internal predecessors, (25867), 1515 states have call successors, (1515), 34 states have call predecessors, (1515), 34 states have return successors, (1515), 1499 states have call predecessors, (1515), 1515 states have call successors, (1515) [2025-02-06 02:41:22,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17752 states to 17752 states and 28897 transitions. [2025-02-06 02:41:22,555 INFO L78 Accepts]: Start accepts. Automaton has 17752 states and 28897 transitions. Word has length 549 [2025-02-06 02:41:22,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:22,556 INFO L471 AbstractCegarLoop]: Abstraction has 17752 states and 28897 transitions. [2025-02-06 02:41:22,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-02-06 02:41:22,556 INFO L276 IsEmpty]: Start isEmpty. Operand 17752 states and 28897 transitions. [2025-02-06 02:41:22,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 551 [2025-02-06 02:41:22,569 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:22,570 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:41:22,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 02:41:22,570 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:22,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:22,571 INFO L85 PathProgramCache]: Analyzing trace with hash -683211962, now seen corresponding path program 1 times [2025-02-06 02:41:22,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:22,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886386298] [2025-02-06 02:41:22,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:22,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:22,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 550 statements into 1 equivalence classes. [2025-02-06 02:41:25,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 550 of 550 statements. [2025-02-06 02:41:25,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:25,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:26,148 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 111 proven. 135 refuted. 0 times theorem prover too weak. 13366 trivial. 0 not checked. [2025-02-06 02:41:26,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:26,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886386298] [2025-02-06 02:41:26,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886386298] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:41:26,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405613255] [2025-02-06 02:41:26,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:26,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:41:26,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:41:26,151 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:41:26,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 02:41:26,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 550 statements into 1 equivalence classes. [2025-02-06 02:41:26,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 550 of 550 statements. [2025-02-06 02:41:26,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:26,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:26,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 1320 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 02:41:26,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:41:27,341 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 8947 proven. 99 refuted. 0 times theorem prover too weak. 4566 trivial. 0 not checked. [2025-02-06 02:41:27,342 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:41:28,007 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 147 proven. 99 refuted. 0 times theorem prover too weak. 13366 trivial. 0 not checked. [2025-02-06 02:41:28,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405613255] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:41:28,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:41:28,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-02-06 02:41:28,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021724661] [2025-02-06 02:41:28,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:41:28,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-06 02:41:28,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:28,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 02:41:28,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2025-02-06 02:41:28,011 INFO L87 Difference]: Start difference. First operand 17752 states and 28897 transitions. Second operand has 17 states, 17 states have (on average 17.88235294117647) internal successors, (304), 17 states have internal predecessors, (304), 7 states have call successors, (230), 3 states have call predecessors, (230), 6 states have return successors, (230), 7 states have call predecessors, (230), 7 states have call successors, (230) [2025-02-06 02:41:30,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:30,358 INFO L93 Difference]: Finished difference Result 52236 states and 84803 transitions. [2025-02-06 02:41:30,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 02:41:30,358 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 17.88235294117647) internal successors, (304), 17 states have internal predecessors, (304), 7 states have call successors, (230), 3 states have call predecessors, (230), 6 states have return successors, (230), 7 states have call predecessors, (230), 7 states have call successors, (230) Word has length 550 [2025-02-06 02:41:30,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:30,448 INFO L225 Difference]: With dead ends: 52236 [2025-02-06 02:41:30,448 INFO L226 Difference]: Without dead ends: 34830 [2025-02-06 02:41:30,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1124 GetRequests, 1093 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=265, Invalid=791, Unknown=0, NotChecked=0, Total=1056 [2025-02-06 02:41:30,470 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 2174 mSDsluCounter, 2260 mSDsCounter, 0 mSdLazyCounter, 1764 mSolverCounterSat, 636 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2223 SdHoareTripleChecker+Valid, 2608 SdHoareTripleChecker+Invalid, 2400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 636 IncrementalHoareTripleChecker+Valid, 1764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:30,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2223 Valid, 2608 Invalid, 2400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [636 Valid, 1764 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-06 02:41:30,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34830 states. [2025-02-06 02:41:31,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34830 to 34762. [2025-02-06 02:41:31,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34762 states, 31690 states have (on average 1.5770590091511518) internal successors, (49977), 31722 states have internal predecessors, (49977), 2947 states have call successors, (2947), 124 states have call predecessors, (2947), 124 states have return successors, (2947), 2915 states have call predecessors, (2947), 2947 states have call successors, (2947) [2025-02-06 02:41:31,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34762 states to 34762 states and 55871 transitions. [2025-02-06 02:41:31,793 INFO L78 Accepts]: Start accepts. Automaton has 34762 states and 55871 transitions. Word has length 550 [2025-02-06 02:41:31,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:31,795 INFO L471 AbstractCegarLoop]: Abstraction has 34762 states and 55871 transitions. [2025-02-06 02:41:31,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 17.88235294117647) internal successors, (304), 17 states have internal predecessors, (304), 7 states have call successors, (230), 3 states have call predecessors, (230), 6 states have return successors, (230), 7 states have call predecessors, (230), 7 states have call successors, (230) [2025-02-06 02:41:31,795 INFO L276 IsEmpty]: Start isEmpty. Operand 34762 states and 55871 transitions. [2025-02-06 02:41:31,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 553 [2025-02-06 02:41:31,808 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:31,808 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:41:31,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 02:41:32,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-06 02:41:32,010 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:32,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:32,011 INFO L85 PathProgramCache]: Analyzing trace with hash 629674291, now seen corresponding path program 1 times [2025-02-06 02:41:32,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:32,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861692623] [2025-02-06 02:41:32,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:32,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:32,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 552 statements into 1 equivalence classes. [2025-02-06 02:41:33,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 552 of 552 statements. [2025-02-06 02:41:33,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:33,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 02:41:33,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [91959375] [2025-02-06 02:41:33,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:33,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:41:33,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:41:33,444 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:41:33,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 02:41:33,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 552 statements into 1 equivalence classes. [2025-02-06 02:41:34,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 552 of 552 statements. [2025-02-06 02:41:34,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:34,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:34,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 1324 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-02-06 02:41:34,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:41:37,999 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 6234 proven. 978 refuted. 0 times theorem prover too weak. 6400 trivial. 0 not checked. [2025-02-06 02:41:37,999 INFO L312 TraceCheckSpWp]: Computing backward predicates...