./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-37.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_amount250_file-37.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 ba821d92d2796d52ea5c7f089d2638cf5b82e930c6cce78adee479c044ea4833 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:16:34,929 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:16:34,969 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:16:34,973 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:16:34,973 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:16:34,986 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:16:34,987 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:16:34,987 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:16:34,987 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:16:34,987 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:16:34,987 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:16:34,987 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:16:34,988 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:16:34,988 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:16:34,988 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:16:34,988 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:16:34,988 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:16:34,988 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:16:34,988 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:16:34,988 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:16:34,988 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:16:34,988 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:16:34,989 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:16:34,989 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:16:34,989 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:16:34,989 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:16:34,989 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:16:34,989 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:16:34,989 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:16:34,989 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:16:34,989 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:16:34,989 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:16:34,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:16:34,990 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:16:34,990 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:16:34,990 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:16:34,990 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:16:34,990 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:16:34,990 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:16:34,990 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:16:34,990 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:16:34,990 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:16:34,990 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:16:34,990 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 -> ba821d92d2796d52ea5c7f089d2638cf5b82e930c6cce78adee479c044ea4833 [2025-02-06 02:16:35,208 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:16:35,214 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:16:35,216 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:16:35,218 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:16:35,219 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:16:35,220 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-37.i [2025-02-06 02:16:36,462 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1aad9a3a5/c0c8c59147c94f388a20b1117c0ee20b/FLAGe13413f07 [2025-02-06 02:16:36,683 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:16:36,684 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-37.i [2025-02-06 02:16:36,692 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1aad9a3a5/c0c8c59147c94f388a20b1117c0ee20b/FLAGe13413f07 [2025-02-06 02:16:36,703 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1aad9a3a5/c0c8c59147c94f388a20b1117c0ee20b [2025-02-06 02:16:36,705 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:16:36,706 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:16:36,707 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:16:36,707 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:16:36,710 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:16:36,710 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:16:36" (1/1) ... [2025-02-06 02:16:36,711 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a883f74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:16:36, skipping insertion in model container [2025-02-06 02:16:36,711 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:16:36" (1/1) ... [2025-02-06 02:16:36,742 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:16:36,855 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_amount250_file-37.i[916,929] [2025-02-06 02:16:36,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:16:37,010 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:16:37,019 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_amount250_file-37.i[916,929] [2025-02-06 02:16:37,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:16:37,113 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:16:37,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:16:37 WrapperNode [2025-02-06 02:16:37,114 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:16:37,116 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:16:37,116 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:16:37,116 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:16:37,121 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:16:37" (1/1) ... [2025-02-06 02:16:37,135 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:16:37" (1/1) ... [2025-02-06 02:16:37,179 INFO L138 Inliner]: procedures = 26, calls = 64, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 385 [2025-02-06 02:16:37,179 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:16:37,180 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:16:37,180 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:16:37,180 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:16:37,186 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:16:37" (1/1) ... [2025-02-06 02:16:37,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:16:37" (1/1) ... [2025-02-06 02:16:37,198 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:16:37" (1/1) ... [2025-02-06 02:16:37,229 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:16:37,229 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:16:37" (1/1) ... [2025-02-06 02:16:37,229 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:16:37" (1/1) ... [2025-02-06 02:16:37,249 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:16:37" (1/1) ... [2025-02-06 02:16:37,256 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:16:37" (1/1) ... [2025-02-06 02:16:37,266 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:16:37" (1/1) ... [2025-02-06 02:16:37,271 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:16:37" (1/1) ... [2025-02-06 02:16:37,281 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:16:37,283 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:16:37,284 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:16:37,284 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:16:37,285 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:16:37" (1/1) ... [2025-02-06 02:16:37,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:16:37,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:16:37,314 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:16:37,317 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:16:37,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:16:37,335 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:16:37,335 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:16:37,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:16:37,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:16:37,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:16:37,431 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:16:37,432 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:16:38,114 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L336: havoc property_#t~bitwise35#1;havoc property_#t~short36#1;havoc property_#t~bitwise37#1;havoc property_#t~short38#1; [2025-02-06 02:16:38,183 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2025-02-06 02:16:38,183 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:16:38,206 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:16:38,206 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:16:38,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:16:38 BoogieIcfgContainer [2025-02-06 02:16:38,206 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:16:38,209 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:16:38,210 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:16:38,213 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:16:38,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:16:36" (1/3) ... [2025-02-06 02:16:38,214 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19bd86f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:16:38, skipping insertion in model container [2025-02-06 02:16:38,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:16:37" (2/3) ... [2025-02-06 02:16:38,214 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19bd86f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:16:38, skipping insertion in model container [2025-02-06 02:16:38,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:16:38" (3/3) ... [2025-02-06 02:16:38,215 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-37.i [2025-02-06 02:16:38,227 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:16:38,228 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-37.i that has 2 procedures, 161 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:16:38,281 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:16:38,290 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;@777205e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:16:38,291 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:16:38,294 INFO L276 IsEmpty]: Start isEmpty. Operand has 161 states, 107 states have (on average 1.4579439252336448) internal successors, (156), 108 states have internal predecessors, (156), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-02-06 02:16:38,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-02-06 02:16:38,310 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:16:38,311 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:38,311 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:16:38,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:16:38,317 INFO L85 PathProgramCache]: Analyzing trace with hash -522544107, now seen corresponding path program 1 times [2025-02-06 02:16:38,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:16:38,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749273294] [2025-02-06 02:16:38,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:16:38,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:16:38,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-02-06 02:16:38,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-02-06 02:16:38,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:16:38,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:16:38,801 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 5000 trivial. 0 not checked. [2025-02-06 02:16:38,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:16:38,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749273294] [2025-02-06 02:16:38,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749273294] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:16:38,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939786547] [2025-02-06 02:16:38,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:16:38,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:16:38,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:16:38,806 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:16:38,807 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:16:38,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-02-06 02:16:39,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-02-06 02:16:39,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:16:39,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:16:39,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 775 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:16:39,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:16:39,099 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 5000 trivial. 0 not checked. [2025-02-06 02:16:39,099 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:16:39,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939786547] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:16:39,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:16:39,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 02:16:39,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936988969] [2025-02-06 02:16:39,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:16:39,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:16:39,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:16:39,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:16:39,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:16:39,124 INFO L87 Difference]: Start difference. First operand has 161 states, 107 states have (on average 1.4579439252336448) internal successors, (156), 108 states have internal predecessors, (156), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) Second operand has 2 states, 2 states have (on average 41.5) internal successors, (83), 2 states have internal predecessors, (83), 2 states have call successors, (51), 2 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 2 states have call successors, (51) [2025-02-06 02:16:39,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:16:39,167 INFO L93 Difference]: Finished difference Result 316 states and 562 transitions. [2025-02-06 02:16:39,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:16:39,169 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 41.5) internal successors, (83), 2 states have internal predecessors, (83), 2 states have call successors, (51), 2 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 2 states have call successors, (51) Word has length 333 [2025-02-06 02:16:39,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:16:39,176 INFO L225 Difference]: With dead ends: 316 [2025-02-06 02:16:39,176 INFO L226 Difference]: Without dead ends: 158 [2025-02-06 02:16:39,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:16:39,185 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:16:39,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 249 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:16:39,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-02-06 02:16:39,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2025-02-06 02:16:39,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 105 states have (on average 1.438095238095238) internal successors, (151), 105 states have internal predecessors, (151), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-02-06 02:16:39,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 253 transitions. [2025-02-06 02:16:39,237 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 253 transitions. Word has length 333 [2025-02-06 02:16:39,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:16:39,238 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 253 transitions. [2025-02-06 02:16:39,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 41.5) internal successors, (83), 2 states have internal predecessors, (83), 2 states have call successors, (51), 2 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 2 states have call successors, (51) [2025-02-06 02:16:39,239 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 253 transitions. [2025-02-06 02:16:39,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-02-06 02:16:39,245 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:16:39,245 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:39,256 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:16:39,445 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,SelfDestructingSolverStorable0 [2025-02-06 02:16:39,446 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:16:39,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:16:39,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1694187790, now seen corresponding path program 1 times [2025-02-06 02:16:39,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:16:39,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676374063] [2025-02-06 02:16:39,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:16:39,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:16:39,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-02-06 02:16:39,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-02-06 02:16:39,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:16:39,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:16:39,824 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-02-06 02:16:39,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:16:39,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676374063] [2025-02-06 02:16:39,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676374063] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:16:39,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:16:39,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:16:39,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293302526] [2025-02-06 02:16:39,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:16:39,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:16:39,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:16:39,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:16:39,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:16:39,827 INFO L87 Difference]: Start difference. First operand 158 states and 253 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-02-06 02:16:39,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:16:39,930 INFO L93 Difference]: Finished difference Result 466 states and 749 transitions. [2025-02-06 02:16:39,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:16:39,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 333 [2025-02-06 02:16:39,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:16:39,936 INFO L225 Difference]: With dead ends: 466 [2025-02-06 02:16:39,936 INFO L226 Difference]: Without dead ends: 311 [2025-02-06 02:16:39,937 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:16:39,938 INFO L435 NwaCegarLoop]: 485 mSDtfsCounter, 246 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:16:39,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 723 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:16:39,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2025-02-06 02:16:39,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 309. [2025-02-06 02:16:39,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 204 states have (on average 1.4313725490196079) internal successors, (292), 204 states have internal predecessors, (292), 102 states have call successors, (102), 2 states have call predecessors, (102), 2 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-02-06 02:16:39,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 496 transitions. [2025-02-06 02:16:39,994 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 496 transitions. Word has length 333 [2025-02-06 02:16:39,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:16:39,994 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 496 transitions. [2025-02-06 02:16:39,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-02-06 02:16:39,996 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 496 transitions. [2025-02-06 02:16:40,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-02-06 02:16:40,001 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:16:40,001 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:40,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:16:40,001 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:16:40,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:16:40,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1343387853, now seen corresponding path program 1 times [2025-02-06 02:16:40,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:16:40,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274356397] [2025-02-06 02:16:40,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:16:40,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:16:40,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-02-06 02:16:40,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-02-06 02:16:40,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:16:40,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:16:40,838 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-02-06 02:16:40,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:16:40,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274356397] [2025-02-06 02:16:40,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274356397] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:16:40,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:16:40,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 02:16:40,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177238572] [2025-02-06 02:16:40,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:16:40,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 02:16:40,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:16:40,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 02:16:40,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:16:40,843 INFO L87 Difference]: Start difference. First operand 309 states and 496 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 3 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2025-02-06 02:16:41,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:16:41,508 INFO L93 Difference]: Finished difference Result 1005 states and 1599 transitions. [2025-02-06 02:16:41,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 02:16:41,509 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 3 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) Word has length 333 [2025-02-06 02:16:41,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:16:41,518 INFO L225 Difference]: With dead ends: 1005 [2025-02-06 02:16:41,519 INFO L226 Difference]: Without dead ends: 699 [2025-02-06 02:16:41,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-02-06 02:16:41,522 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 867 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 403 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 867 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 403 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:16:41,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [867 Valid, 816 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [403 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 02:16:41,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2025-02-06 02:16:41,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 627. [2025-02-06 02:16:41,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 414 states have (on average 1.4154589371980677) internal successors, (586), 414 states have internal predecessors, (586), 204 states have call successors, (204), 8 states have call predecessors, (204), 8 states have return successors, (204), 204 states have call predecessors, (204), 204 states have call successors, (204) [2025-02-06 02:16:41,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 994 transitions. [2025-02-06 02:16:41,671 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 994 transitions. Word has length 333 [2025-02-06 02:16:41,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:16:41,672 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 994 transitions. [2025-02-06 02:16:41,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 3 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2025-02-06 02:16:41,673 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 994 transitions. [2025-02-06 02:16:41,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-02-06 02:16:41,675 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:16:41,675 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:41,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 02:16:41,675 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:16:41,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:16:41,676 INFO L85 PathProgramCache]: Analyzing trace with hash 2107107572, now seen corresponding path program 1 times [2025-02-06 02:16:41,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:16:41,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222621703] [2025-02-06 02:16:41,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:16:41,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:16:41,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-02-06 02:16:41,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-02-06 02:16:41,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:16:41,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:16:42,210 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-02-06 02:16:42,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:16:42,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222621703] [2025-02-06 02:16:42,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222621703] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:16:42,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:16:42,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:16:42,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850987326] [2025-02-06 02:16:42,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:16:42,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:16:42,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:16:42,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:16:42,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:16:42,213 INFO L87 Difference]: Start difference. First operand 627 states and 994 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-02-06 02:16:42,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:16:42,455 INFO L93 Difference]: Finished difference Result 1845 states and 2881 transitions. [2025-02-06 02:16:42,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:16:42,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 333 [2025-02-06 02:16:42,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:16:42,466 INFO L225 Difference]: With dead ends: 1845 [2025-02-06 02:16:42,466 INFO L226 Difference]: Without dead ends: 1221 [2025-02-06 02:16:42,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:16:42,470 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 192 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:16:42,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 712 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:16:42,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2025-02-06 02:16:42,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 981. [2025-02-06 02:16:42,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 712 states have (on average 1.4438202247191012) internal successors, (1028), 716 states have internal predecessors, (1028), 252 states have call successors, (252), 16 states have call predecessors, (252), 16 states have return successors, (252), 248 states have call predecessors, (252), 252 states have call successors, (252) [2025-02-06 02:16:42,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1532 transitions. [2025-02-06 02:16:42,590 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1532 transitions. Word has length 333 [2025-02-06 02:16:42,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:16:42,591 INFO L471 AbstractCegarLoop]: Abstraction has 981 states and 1532 transitions. [2025-02-06 02:16:42,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-02-06 02:16:42,591 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1532 transitions. [2025-02-06 02:16:42,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-02-06 02:16:42,595 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:16:42,595 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:42,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 02:16:42,596 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:16:42,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:16:42,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1110035219, now seen corresponding path program 1 times [2025-02-06 02:16:42,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:16:42,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097838764] [2025-02-06 02:16:42,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:16:42,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:16:42,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-02-06 02:16:42,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-02-06 02:16:42,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:16:42,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:16:42,767 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-02-06 02:16:42,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:16:42,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097838764] [2025-02-06 02:16:42,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097838764] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:16:42,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:16:42,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:16:42,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032964189] [2025-02-06 02:16:42,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:16:42,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:16:42,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:16:42,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:16:42,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:16:42,770 INFO L87 Difference]: Start difference. First operand 981 states and 1532 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-02-06 02:16:42,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:16:42,934 INFO L93 Difference]: Finished difference Result 2921 states and 4570 transitions. [2025-02-06 02:16:42,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:16:42,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 333 [2025-02-06 02:16:42,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:16:42,945 INFO L225 Difference]: With dead ends: 2921 [2025-02-06 02:16:42,945 INFO L226 Difference]: Without dead ends: 1943 [2025-02-06 02:16:42,948 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:16:42,948 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 242 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:16:42,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 526 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:16:42,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1943 states. [2025-02-06 02:16:43,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1943 to 1941. [2025-02-06 02:16:43,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1941 states, 1404 states have (on average 1.4387464387464388) internal successors, (2020), 1412 states have internal predecessors, (2020), 504 states have call successors, (504), 32 states have call predecessors, (504), 32 states have return successors, (504), 496 states have call predecessors, (504), 504 states have call successors, (504) [2025-02-06 02:16:43,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1941 states to 1941 states and 3028 transitions. [2025-02-06 02:16:43,122 INFO L78 Accepts]: Start accepts. Automaton has 1941 states and 3028 transitions. Word has length 333 [2025-02-06 02:16:43,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:16:43,122 INFO L471 AbstractCegarLoop]: Abstraction has 1941 states and 3028 transitions. [2025-02-06 02:16:43,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-02-06 02:16:43,123 INFO L276 IsEmpty]: Start isEmpty. Operand 1941 states and 3028 transitions. [2025-02-06 02:16:43,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-02-06 02:16:43,129 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:16:43,130 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:43,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 02:16:43,130 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:16:43,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:16:43,130 INFO L85 PathProgramCache]: Analyzing trace with hash -967174124, now seen corresponding path program 1 times [2025-02-06 02:16:43,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:16:43,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515887863] [2025-02-06 02:16:43,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:16:43,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:16:43,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-02-06 02:16:43,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-02-06 02:16:43,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:16:43,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:16:43,432 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-02-06 02:16:43,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:16:43,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515887863] [2025-02-06 02:16:43,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515887863] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:16:43,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:16:43,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:16:43,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076821606] [2025-02-06 02:16:43,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:16:43,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:16:43,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:16:43,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:16:43,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:16:43,435 INFO L87 Difference]: Start difference. First operand 1941 states and 3028 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-02-06 02:16:43,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:16:43,627 INFO L93 Difference]: Finished difference Result 5074 states and 7920 transitions. [2025-02-06 02:16:43,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:16:43,627 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 333 [2025-02-06 02:16:43,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:16:43,644 INFO L225 Difference]: With dead ends: 5074 [2025-02-06 02:16:43,644 INFO L226 Difference]: Without dead ends: 3136 [2025-02-06 02:16:43,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:16:43,652 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 138 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:16:43,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 535 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:16:43,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3136 states. [2025-02-06 02:16:43,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3136 to 3070. [2025-02-06 02:16:43,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3070 states, 2210 states have (on average 1.4389140271493213) internal successors, (3180), 2222 states have internal predecessors, (3180), 807 states have call successors, (807), 52 states have call predecessors, (807), 52 states have return successors, (807), 795 states have call predecessors, (807), 807 states have call successors, (807) [2025-02-06 02:16:43,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3070 states to 3070 states and 4794 transitions. [2025-02-06 02:16:43,935 INFO L78 Accepts]: Start accepts. Automaton has 3070 states and 4794 transitions. Word has length 333 [2025-02-06 02:16:43,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:16:43,936 INFO L471 AbstractCegarLoop]: Abstraction has 3070 states and 4794 transitions. [2025-02-06 02:16:43,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-02-06 02:16:43,936 INFO L276 IsEmpty]: Start isEmpty. Operand 3070 states and 4794 transitions. [2025-02-06 02:16:43,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-02-06 02:16:43,940 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:16:43,940 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:43,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 02:16:43,940 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:16:43,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:16:43,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1648963308, now seen corresponding path program 1 times [2025-02-06 02:16:43,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:16:43,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342771307] [2025-02-06 02:16:43,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:16:43,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:16:43,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-02-06 02:16:44,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-02-06 02:16:44,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:16:44,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:16:44,606 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-02-06 02:16:44,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:16:44,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342771307] [2025-02-06 02:16:44,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342771307] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:16:44,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:16:44,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:16:44,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158118515] [2025-02-06 02:16:44,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:16:44,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:16:44,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:16:44,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:16:44,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:16:44,607 INFO L87 Difference]: Start difference. First operand 3070 states and 4794 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-02-06 02:16:45,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:16:45,073 INFO L93 Difference]: Finished difference Result 9314 states and 14451 transitions. [2025-02-06 02:16:45,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:16:45,073 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 333 [2025-02-06 02:16:45,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:16:45,102 INFO L225 Difference]: With dead ends: 9314 [2025-02-06 02:16:45,102 INFO L226 Difference]: Without dead ends: 6368 [2025-02-06 02:16:45,109 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:16:45,109 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 294 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:16:45,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 762 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:16:45,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6368 states. [2025-02-06 02:16:45,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6368 to 5276. [2025-02-06 02:16:45,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5276 states, 3984 states have (on average 1.448293172690763) internal successors, (5770), 4020 states have internal predecessors, (5770), 1191 states have call successors, (1191), 100 states have call predecessors, (1191), 100 states have return successors, (1191), 1155 states have call predecessors, (1191), 1191 states have call successors, (1191) [2025-02-06 02:16:45,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5276 states to 5276 states and 8152 transitions. [2025-02-06 02:16:45,466 INFO L78 Accepts]: Start accepts. Automaton has 5276 states and 8152 transitions. Word has length 333 [2025-02-06 02:16:45,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:16:45,467 INFO L471 AbstractCegarLoop]: Abstraction has 5276 states and 8152 transitions. [2025-02-06 02:16:45,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-02-06 02:16:45,467 INFO L276 IsEmpty]: Start isEmpty. Operand 5276 states and 8152 transitions. [2025-02-06 02:16:45,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-02-06 02:16:45,472 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:16:45,473 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:45,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 02:16:45,473 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:16:45,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:16:45,473 INFO L85 PathProgramCache]: Analyzing trace with hash 76517589, now seen corresponding path program 1 times [2025-02-06 02:16:45,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:16:45,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534201259] [2025-02-06 02:16:45,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:16:45,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:16:45,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-02-06 02:16:45,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-02-06 02:16:45,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:16:45,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:17:13,298 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-02-06 02:17:13,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:17:13,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534201259] [2025-02-06 02:17:13,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534201259] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:17:13,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:17:13,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-02-06 02:17:13,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877887022] [2025-02-06 02:17:13,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:17:13,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-06 02:17:13,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:17:13,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 02:17:13,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2025-02-06 02:17:13,300 INFO L87 Difference]: Start difference. First operand 5276 states and 8152 transitions. Second operand has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 17 states have internal predecessors, (81), 3 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2025-02-06 02:17:16,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:17:16,748 INFO L93 Difference]: Finished difference Result 14430 states and 22172 transitions. [2025-02-06 02:17:16,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 02:17:16,749 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 17 states have internal predecessors, (81), 3 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) Word has length 333 [2025-02-06 02:17:16,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:17:16,806 INFO L225 Difference]: With dead ends: 14430 [2025-02-06 02:17:16,806 INFO L226 Difference]: Without dead ends: 9320 [2025-02-06 02:17:16,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=412, Invalid=920, Unknown=0, NotChecked=0, Total=1332 [2025-02-06 02:17:16,823 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 2553 mSDsluCounter, 1618 mSDsCounter, 0 mSdLazyCounter, 1925 mSolverCounterSat, 440 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2553 SdHoareTripleChecker+Valid, 1902 SdHoareTripleChecker+Invalid, 2365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 440 IncrementalHoareTripleChecker+Valid, 1925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:17:16,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2553 Valid, 1902 Invalid, 2365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [440 Valid, 1925 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-06 02:17:16,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9320 states. [2025-02-06 02:17:17,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9320 to 8442. [2025-02-06 02:17:17,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8442 states, 6508 states have (on average 1.4417639827904118) internal successors, (9383), 6562 states have internal predecessors, (9383), 1761 states have call successors, (1761), 172 states have call predecessors, (1761), 172 states have return successors, (1761), 1707 states have call predecessors, (1761), 1761 states have call successors, (1761) [2025-02-06 02:17:17,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8442 states to 8442 states and 12905 transitions. [2025-02-06 02:17:17,324 INFO L78 Accepts]: Start accepts. Automaton has 8442 states and 12905 transitions. Word has length 333 [2025-02-06 02:17:17,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:17:17,325 INFO L471 AbstractCegarLoop]: Abstraction has 8442 states and 12905 transitions. [2025-02-06 02:17:17,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 17 states have internal predecessors, (81), 3 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2025-02-06 02:17:17,325 INFO L276 IsEmpty]: Start isEmpty. Operand 8442 states and 12905 transitions. [2025-02-06 02:17:17,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-02-06 02:17:17,329 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:17:17,330 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:17,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 02:17:17,330 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:17:17,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:17:17,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1176778507, now seen corresponding path program 1 times [2025-02-06 02:17:17,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:17:17,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913019000] [2025-02-06 02:17:17,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:17:17,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:17:17,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-02-06 02:17:17,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-02-06 02:17:17,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:17:17,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:17:17,770 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-02-06 02:17:17,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:17:17,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913019000] [2025-02-06 02:17:17,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913019000] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:17:17,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:17:17,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:17:17,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406684897] [2025-02-06 02:17:17,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:17:17,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 02:17:17,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:17:17,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 02:17:17,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:17:17,776 INFO L87 Difference]: Start difference. First operand 8442 states and 12905 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-02-06 02:17:18,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:17:18,456 INFO L93 Difference]: Finished difference Result 12114 states and 18700 transitions. [2025-02-06 02:17:18,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 02:17:18,456 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 333 [2025-02-06 02:17:18,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:17:18,490 INFO L225 Difference]: With dead ends: 12114 [2025-02-06 02:17:18,490 INFO L226 Difference]: Without dead ends: 9262 [2025-02-06 02:17:18,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-02-06 02:17:18,498 INFO L435 NwaCegarLoop]: 393 mSDtfsCounter, 375 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 1129 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:17:18,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 1129 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:17:18,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9262 states. [2025-02-06 02:17:18,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9262 to 8466. [2025-02-06 02:17:18,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8466 states, 6532 states have (on average 1.4358542559706062) internal successors, (9379), 6586 states have internal predecessors, (9379), 1761 states have call successors, (1761), 172 states have call predecessors, (1761), 172 states have return successors, (1761), 1707 states have call predecessors, (1761), 1761 states have call successors, (1761) [2025-02-06 02:17:18,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8466 states to 8466 states and 12901 transitions. [2025-02-06 02:17:18,887 INFO L78 Accepts]: Start accepts. Automaton has 8466 states and 12901 transitions. Word has length 333 [2025-02-06 02:17:18,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:17:18,888 INFO L471 AbstractCegarLoop]: Abstraction has 8466 states and 12901 transitions. [2025-02-06 02:17:18,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-02-06 02:17:18,889 INFO L276 IsEmpty]: Start isEmpty. Operand 8466 states and 12901 transitions. [2025-02-06 02:17:18,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-02-06 02:17:18,893 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:17:18,894 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:18,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 02:17:18,894 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:17:18,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:17:18,895 INFO L85 PathProgramCache]: Analyzing trace with hash -2000691754, now seen corresponding path program 1 times [2025-02-06 02:17:18,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:17:18,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808314096] [2025-02-06 02:17:18,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:17:18,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:17:18,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-02-06 02:17:19,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-02-06 02:17:19,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:17:19,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:17:46,271 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-02-06 02:17:46,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:17:46,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808314096] [2025-02-06 02:17:46,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808314096] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:17:46,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:17:46,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-06 02:17:46,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777751523] [2025-02-06 02:17:46,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:17:46,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 02:17:46,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:17:46,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 02:17:46,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-02-06 02:17:46,273 INFO L87 Difference]: Start difference. First operand 8466 states and 12901 transitions. Second operand has 16 states, 16 states have (on average 5.0625) internal successors, (81), 16 states have internal predecessors, (81), 3 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2025-02-06 02:17:48,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:17:48,907 INFO L93 Difference]: Finished difference Result 15432 states and 23362 transitions. [2025-02-06 02:17:48,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-06 02:17:48,908 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.0625) internal successors, (81), 16 states have internal predecessors, (81), 3 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) Word has length 333 [2025-02-06 02:17:48,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:17:48,945 INFO L225 Difference]: With dead ends: 15432 [2025-02-06 02:17:48,945 INFO L226 Difference]: Without dead ends: 9898 [2025-02-06 02:17:48,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=324, Invalid=732, Unknown=0, NotChecked=0, Total=1056 [2025-02-06 02:17:48,962 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 2017 mSDsluCounter, 1429 mSDsCounter, 0 mSdLazyCounter, 1399 mSolverCounterSat, 373 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2017 SdHoareTripleChecker+Valid, 1698 SdHoareTripleChecker+Invalid, 1772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 373 IncrementalHoareTripleChecker+Valid, 1399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-06 02:17:48,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2017 Valid, 1698 Invalid, 1772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [373 Valid, 1399 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-06 02:17:48,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9898 states. [2025-02-06 02:17:49,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9898 to 8486. [2025-02-06 02:17:49,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8486 states, 6552 states have (on average 1.4381868131868132) internal successors, (9423), 6606 states have internal predecessors, (9423), 1761 states have call successors, (1761), 172 states have call predecessors, (1761), 172 states have return successors, (1761), 1707 states have call predecessors, (1761), 1761 states have call successors, (1761) [2025-02-06 02:17:49,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8486 states to 8486 states and 12945 transitions. [2025-02-06 02:17:49,426 INFO L78 Accepts]: Start accepts. Automaton has 8486 states and 12945 transitions. Word has length 333 [2025-02-06 02:17:49,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:17:49,427 INFO L471 AbstractCegarLoop]: Abstraction has 8486 states and 12945 transitions. [2025-02-06 02:17:49,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.0625) internal successors, (81), 16 states have internal predecessors, (81), 3 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2025-02-06 02:17:49,427 INFO L276 IsEmpty]: Start isEmpty. Operand 8486 states and 12945 transitions. [2025-02-06 02:17:49,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-02-06 02:17:49,433 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:17:49,433 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:49,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 02:17:49,434 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:17:49,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:17:49,435 INFO L85 PathProgramCache]: Analyzing trace with hash -755927273, now seen corresponding path program 1 times [2025-02-06 02:17:49,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:17:49,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193460332] [2025-02-06 02:17:49,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:17:49,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:17:49,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-02-06 02:17:49,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-02-06 02:17:49,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:17:49,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:17:49,526 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-02-06 02:17:49,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:17:49,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193460332] [2025-02-06 02:17:49,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193460332] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:17:49,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:17:49,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:17:49,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123519078] [2025-02-06 02:17:49,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:17:49,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:17:49,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:17:49,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:17:49,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:17:49,528 INFO L87 Difference]: Start difference. First operand 8486 states and 12945 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-02-06 02:17:49,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:17:49,912 INFO L93 Difference]: Finished difference Result 14390 states and 21959 transitions. [2025-02-06 02:17:49,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:17:49,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 333 [2025-02-06 02:17:49,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:17:49,942 INFO L225 Difference]: With dead ends: 14390 [2025-02-06 02:17:49,942 INFO L226 Difference]: Without dead ends: 8864 [2025-02-06 02:17:49,952 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:17:49,952 INFO L435 NwaCegarLoop]: 487 mSDtfsCounter, 241 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:17:49,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 726 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:17:49,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8864 states. [2025-02-06 02:17:50,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8864 to 8806. [2025-02-06 02:17:50,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8806 states, 6872 states have (on average 1.4294237485448196) internal successors, (9823), 6926 states have internal predecessors, (9823), 1761 states have call successors, (1761), 172 states have call predecessors, (1761), 172 states have return successors, (1761), 1707 states have call predecessors, (1761), 1761 states have call successors, (1761) [2025-02-06 02:17:50,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8806 states to 8806 states and 13345 transitions. [2025-02-06 02:17:50,578 INFO L78 Accepts]: Start accepts. Automaton has 8806 states and 13345 transitions. Word has length 333 [2025-02-06 02:17:50,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:17:50,578 INFO L471 AbstractCegarLoop]: Abstraction has 8806 states and 13345 transitions. [2025-02-06 02:17:50,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-02-06 02:17:50,579 INFO L276 IsEmpty]: Start isEmpty. Operand 8806 states and 13345 transitions. [2025-02-06 02:17:50,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2025-02-06 02:17:50,583 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:17:50,583 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:50,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 02:17:50,583 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:17:50,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:17:50,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1427955040, now seen corresponding path program 1 times [2025-02-06 02:17:50,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:17:50,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893912000] [2025-02-06 02:17:50,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:17:50,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:17:50,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes. [2025-02-06 02:17:51,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements. [2025-02-06 02:17:51,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:17:51,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat