./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-64.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-64.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 a9f11f8c88de8998bc882c7dd2efba11633c83e29912cc5a80cdbf720cc0a7ec --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:20:10,123 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:20:10,173 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:20:10,179 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:20:10,181 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:20:10,201 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:20:10,202 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:20:10,202 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:20:10,203 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:20:10,203 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:20:10,203 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:20:10,203 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:20:10,204 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:20:10,204 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:20:10,204 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:20:10,204 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:20:10,204 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:20:10,205 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:20:10,205 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:20:10,205 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:20:10,205 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:20:10,205 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:20:10,205 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:20:10,205 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:20:10,205 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:20:10,205 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:20:10,205 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:20:10,205 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:20:10,205 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:20:10,205 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:20:10,206 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:20:10,206 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:20:10,206 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:20:10,206 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:20:10,206 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:20:10,206 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:20:10,206 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:20:10,207 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:20:10,207 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:20:10,207 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:20:10,207 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:20:10,207 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:20:10,207 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:20:10,207 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 -> a9f11f8c88de8998bc882c7dd2efba11633c83e29912cc5a80cdbf720cc0a7ec [2025-02-06 02:20:10,395 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:20:10,400 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:20:10,403 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:20:10,404 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:20:10,404 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:20:10,405 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-64.i [2025-02-06 02:20:11,453 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2f5dd308f/b2e31f1a78d2406684871a33722e58cb/FLAG464d6bb8e [2025-02-06 02:20:11,705 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:20:11,705 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-64.i [2025-02-06 02:20:11,712 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2f5dd308f/b2e31f1a78d2406684871a33722e58cb/FLAG464d6bb8e [2025-02-06 02:20:12,022 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2f5dd308f/b2e31f1a78d2406684871a33722e58cb [2025-02-06 02:20:12,024 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:20:12,025 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:20:12,026 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:20:12,026 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:20:12,028 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:20:12,029 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:20:12" (1/1) ... [2025-02-06 02:20:12,029 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@367aa7ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:20:12, skipping insertion in model container [2025-02-06 02:20:12,029 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:20:12" (1/1) ... [2025-02-06 02:20:12,052 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:20:12,143 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-64.i[916,929] [2025-02-06 02:20:12,275 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:20:12,288 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:20:12,296 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-64.i[916,929] [2025-02-06 02:20:12,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:20:12,372 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:20:12,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:20:12 WrapperNode [2025-02-06 02:20:12,374 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:20:12,375 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:20:12,375 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:20:12,375 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:20:12,380 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:20:12" (1/1) ... [2025-02-06 02:20:12,397 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:20:12" (1/1) ... [2025-02-06 02:20:12,441 INFO L138 Inliner]: procedures = 26, calls = 52, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 369 [2025-02-06 02:20:12,442 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:20:12,442 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:20:12,442 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:20:12,442 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:20:12,448 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:20:12" (1/1) ... [2025-02-06 02:20:12,448 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:20:12" (1/1) ... [2025-02-06 02:20:12,456 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:20:12" (1/1) ... [2025-02-06 02:20:12,496 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:20:12,496 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:20:12" (1/1) ... [2025-02-06 02:20:12,496 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:20:12" (1/1) ... [2025-02-06 02:20:12,511 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:20:12" (1/1) ... [2025-02-06 02:20:12,513 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:20:12" (1/1) ... [2025-02-06 02:20:12,516 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:20:12" (1/1) ... [2025-02-06 02:20:12,518 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:20:12" (1/1) ... [2025-02-06 02:20:12,526 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:20:12,526 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:20:12,526 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:20:12,526 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:20:12,527 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:20:12" (1/1) ... [2025-02-06 02:20:12,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:20:12,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:20:12,553 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:20:12,555 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:20:12,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:20:12,572 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:20:12,572 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:20:12,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:20:12,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:20:12,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:20:12,684 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:20:12,685 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:20:13,258 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L350: havoc property_#t~ite30#1;havoc property_#t~bitwise28#1;havoc property_#t~bitwise29#1;havoc property_#t~short31#1; [2025-02-06 02:20:13,336 INFO L? ?]: Removed 40 outVars from TransFormulas that were not future-live. [2025-02-06 02:20:13,336 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:20:13,354 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:20:13,357 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:20:13,357 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:20:13 BoogieIcfgContainer [2025-02-06 02:20:13,357 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:20:13,359 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:20:13,359 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:20:13,362 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:20:13,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:20:12" (1/3) ... [2025-02-06 02:20:13,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b8d9cae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:20:13, skipping insertion in model container [2025-02-06 02:20:13,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:20:12" (2/3) ... [2025-02-06 02:20:13,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b8d9cae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:20:13, skipping insertion in model container [2025-02-06 02:20:13,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:20:13" (3/3) ... [2025-02-06 02:20:13,364 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-64.i [2025-02-06 02:20:13,376 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:20:13,379 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-64.i that has 2 procedures, 152 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:20:13,420 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:20:13,430 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;@259c4a5c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:20:13,431 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:20:13,435 INFO L276 IsEmpty]: Start isEmpty. Operand has 152 states, 110 states have (on average 1.5272727272727273) internal successors, (168), 111 states have internal predecessors, (168), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-02-06 02:20:13,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-02-06 02:20:13,448 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:20:13,449 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:13,450 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:20:13,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:20:13,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1062474065, now seen corresponding path program 1 times [2025-02-06 02:20:13,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:20:13,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967153755] [2025-02-06 02:20:13,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:20:13,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:20:13,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-02-06 02:20:13,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-02-06 02:20:13,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:20:13,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:20:13,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 2888 trivial. 0 not checked. [2025-02-06 02:20:13,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:20:13,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967153755] [2025-02-06 02:20:13,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967153755] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:20:13,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647086001] [2025-02-06 02:20:13,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:20:13,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:20:13,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:20:13,812 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:20:13,813 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:20:13,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-02-06 02:20:14,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-02-06 02:20:14,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:20:14,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:20:14,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:20:14,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:20:14,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 2888 trivial. 0 not checked. [2025-02-06 02:20:14,063 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:20:14,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647086001] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:20:14,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:20:14,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 02:20:14,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926079580] [2025-02-06 02:20:14,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:20:14,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:20:14,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:20:14,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:20:14,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:20:14,081 INFO L87 Difference]: Start difference. First operand has 152 states, 110 states have (on average 1.5272727272727273) internal successors, (168), 111 states have internal predecessors, (168), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 2 states have call successors, (39) [2025-02-06 02:20:14,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:20:14,116 INFO L93 Difference]: Finished difference Result 298 states and 526 transitions. [2025-02-06 02:20:14,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:20:14,118 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 2 states have call successors, (39) Word has length 260 [2025-02-06 02:20:14,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:20:14,124 INFO L225 Difference]: With dead ends: 298 [2025-02-06 02:20:14,124 INFO L226 Difference]: Without dead ends: 149 [2025-02-06 02:20:14,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 261 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:20:14,131 INFO L435 NwaCegarLoop]: 237 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, 237 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:20:14,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 237 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:20:14,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-02-06 02:20:14,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2025-02-06 02:20:14,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 108 states have (on average 1.5092592592592593) internal successors, (163), 108 states have internal predecessors, (163), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-02-06 02:20:14,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 241 transitions. [2025-02-06 02:20:14,178 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 241 transitions. Word has length 260 [2025-02-06 02:20:14,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:20:14,179 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 241 transitions. [2025-02-06 02:20:14,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 2 states have call successors, (39) [2025-02-06 02:20:14,179 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 241 transitions. [2025-02-06 02:20:14,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-02-06 02:20:14,184 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:20:14,184 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:14,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 02:20:14,389 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:20:14,390 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:20:14,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:20:14,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1555505836, now seen corresponding path program 1 times [2025-02-06 02:20:14,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:20:14,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994953060] [2025-02-06 02:20:14,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:20:14,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:20:14,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-02-06 02:20:14,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-02-06 02:20:14,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:20:14,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:20:14,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-02-06 02:20:14,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:20:14,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994953060] [2025-02-06 02:20:14,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994953060] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:20:14,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:20:14,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:20:14,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213065910] [2025-02-06 02:20:14,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:20:14,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:20:14,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:20:14,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:20:14,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:20:14,692 INFO L87 Difference]: Start difference. First operand 149 states and 241 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-02-06 02:20:14,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:20:14,763 INFO L93 Difference]: Finished difference Result 373 states and 609 transitions. [2025-02-06 02:20:14,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:20:14,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 260 [2025-02-06 02:20:14,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:20:14,772 INFO L225 Difference]: With dead ends: 373 [2025-02-06 02:20:14,773 INFO L226 Difference]: Without dead ends: 227 [2025-02-06 02:20:14,774 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:20:14,774 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 121 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:20:14,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 466 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:20:14,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-02-06 02:20:14,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 169. [2025-02-06 02:20:14,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 128 states have (on average 1.5390625) internal successors, (197), 128 states have internal predecessors, (197), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-02-06 02:20:14,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 275 transitions. [2025-02-06 02:20:14,796 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 275 transitions. Word has length 260 [2025-02-06 02:20:14,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:20:14,797 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 275 transitions. [2025-02-06 02:20:14,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-02-06 02:20:14,799 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 275 transitions. [2025-02-06 02:20:14,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-02-06 02:20:14,804 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:20:14,804 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:14,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:20:14,805 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:20:14,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:20:14,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1225740075, now seen corresponding path program 1 times [2025-02-06 02:20:14,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:20:14,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631608423] [2025-02-06 02:20:14,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:20:14,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:20:14,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-02-06 02:20:14,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-02-06 02:20:14,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:20:14,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:20:15,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-02-06 02:20:15,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:20:15,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631608423] [2025-02-06 02:20:15,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631608423] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:20:15,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:20:15,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:20:15,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92601197] [2025-02-06 02:20:15,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:20:15,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:20:15,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:20:15,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:20:15,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:20:15,028 INFO L87 Difference]: Start difference. First operand 169 states and 275 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-02-06 02:20:15,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:20:15,084 INFO L93 Difference]: Finished difference Result 393 states and 642 transitions. [2025-02-06 02:20:15,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:20:15,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 260 [2025-02-06 02:20:15,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:20:15,087 INFO L225 Difference]: With dead ends: 393 [2025-02-06 02:20:15,088 INFO L226 Difference]: Without dead ends: 227 [2025-02-06 02:20:15,090 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:20:15,090 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 118 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:20:15,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 575 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:20:15,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-02-06 02:20:15,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 175. [2025-02-06 02:20:15,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 134 states have (on average 1.544776119402985) internal successors, (207), 134 states have internal predecessors, (207), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-02-06 02:20:15,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 285 transitions. [2025-02-06 02:20:15,109 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 285 transitions. Word has length 260 [2025-02-06 02:20:15,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:20:15,110 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 285 transitions. [2025-02-06 02:20:15,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-02-06 02:20:15,111 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 285 transitions. [2025-02-06 02:20:15,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-02-06 02:20:15,114 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:20:15,114 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:15,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 02:20:15,114 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:20:15,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:20:15,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1207671567, now seen corresponding path program 1 times [2025-02-06 02:20:15,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:20:15,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90775312] [2025-02-06 02:20:15,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:20:15,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:20:15,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-02-06 02:20:15,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-02-06 02:20:15,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:20:15,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:20:15,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-02-06 02:20:15,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:20:15,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90775312] [2025-02-06 02:20:15,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90775312] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:20:15,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:20:15,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:20:15,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675364721] [2025-02-06 02:20:15,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:20:15,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:20:15,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:20:15,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:20:15,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:20:15,632 INFO L87 Difference]: Start difference. First operand 175 states and 285 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-02-06 02:20:15,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:20:15,875 INFO L93 Difference]: Finished difference Result 568 states and 927 transitions. [2025-02-06 02:20:15,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:20:15,875 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 262 [2025-02-06 02:20:15,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:20:15,878 INFO L225 Difference]: With dead ends: 568 [2025-02-06 02:20:15,879 INFO L226 Difference]: Without dead ends: 396 [2025-02-06 02:20:15,879 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:20:15,880 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 363 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:20:15,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 652 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:20:15,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-02-06 02:20:15,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 382. [2025-02-06 02:20:15,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 301 states have (on average 1.5614617940199336) internal successors, (470), 301 states have internal predecessors, (470), 78 states have call successors, (78), 2 states have call predecessors, (78), 2 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2025-02-06 02:20:15,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 626 transitions. [2025-02-06 02:20:15,917 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 626 transitions. Word has length 262 [2025-02-06 02:20:15,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:20:15,918 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 626 transitions. [2025-02-06 02:20:15,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-02-06 02:20:15,918 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 626 transitions. [2025-02-06 02:20:15,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-02-06 02:20:15,920 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:20:15,921 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:15,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 02:20:15,921 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:20:15,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:20:15,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1139203314, now seen corresponding path program 1 times [2025-02-06 02:20:15,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:20:15,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557927134] [2025-02-06 02:20:15,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:20:15,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:20:15,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-02-06 02:20:16,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-02-06 02:20:16,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:20:16,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:20:16,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-02-06 02:20:16,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:20:16,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557927134] [2025-02-06 02:20:16,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557927134] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:20:16,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:20:16,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:20:16,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234639318] [2025-02-06 02:20:16,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:20:16,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:20:16,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:20:16,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:20:16,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:20:16,520 INFO L87 Difference]: Start difference. First operand 382 states and 626 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-02-06 02:20:16,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:20:16,586 INFO L93 Difference]: Finished difference Result 886 states and 1444 transitions. [2025-02-06 02:20:16,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:20:16,587 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 263 [2025-02-06 02:20:16,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:20:16,589 INFO L225 Difference]: With dead ends: 886 [2025-02-06 02:20:16,589 INFO L226 Difference]: Without dead ends: 507 [2025-02-06 02:20:16,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:20:16,591 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 137 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:20:16,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 672 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:20:16,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-02-06 02:20:16,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 504. [2025-02-06 02:20:16,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 400 states have (on average 1.5375) internal successors, (615), 401 states have internal predecessors, (615), 99 states have call successors, (99), 4 states have call predecessors, (99), 4 states have return successors, (99), 98 states have call predecessors, (99), 99 states have call successors, (99) [2025-02-06 02:20:16,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 813 transitions. [2025-02-06 02:20:16,622 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 813 transitions. Word has length 263 [2025-02-06 02:20:16,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:20:16,624 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 813 transitions. [2025-02-06 02:20:16,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-02-06 02:20:16,625 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 813 transitions. [2025-02-06 02:20:16,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-02-06 02:20:16,627 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:20:16,627 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:16,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 02:20:16,628 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:20:16,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:20:16,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1910999501, now seen corresponding path program 1 times [2025-02-06 02:20:16,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:20:16,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431035586] [2025-02-06 02:20:16,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:20:16,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:20:16,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-02-06 02:20:17,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-02-06 02:20:17,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:20:17,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:20:24,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 18 proven. 96 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2025-02-06 02:20:24,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:20:24,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431035586] [2025-02-06 02:20:24,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431035586] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:20:24,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105602988] [2025-02-06 02:20:24,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:20:24,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:20:24,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:20:24,724 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:20:24,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 02:20:24,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-02-06 02:20:24,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-02-06 02:20:24,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:20:24,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:20:24,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 02:20:24,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:20:25,096 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1508 proven. 51 refuted. 0 times theorem prover too weak. 1405 trivial. 0 not checked. [2025-02-06 02:20:25,096 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:20:25,315 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 63 proven. 51 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2025-02-06 02:20:25,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105602988] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:20:25,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:20:25,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5, 5] total 16 [2025-02-06 02:20:25,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145324599] [2025-02-06 02:20:25,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:20:25,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 02:20:25,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:20:25,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 02:20:25,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2025-02-06 02:20:25,317 INFO L87 Difference]: Start difference. First operand 504 states and 813 transitions. Second operand has 16 states, 16 states have (on average 7.9375) internal successors, (127), 16 states have internal predecessors, (127), 4 states have call successors, (95), 2 states have call predecessors, (95), 4 states have return successors, (96), 4 states have call predecessors, (96), 4 states have call successors, (96) [2025-02-06 02:20:28,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:20:28,467 INFO L93 Difference]: Finished difference Result 1204 states and 1918 transitions. [2025-02-06 02:20:28,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-02-06 02:20:28,469 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.9375) internal successors, (127), 16 states have internal predecessors, (127), 4 states have call successors, (95), 2 states have call predecessors, (95), 4 states have return successors, (96), 4 states have call predecessors, (96), 4 states have call successors, (96) Word has length 263 [2025-02-06 02:20:28,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:20:28,473 INFO L225 Difference]: With dead ends: 1204 [2025-02-06 02:20:28,473 INFO L226 Difference]: Without dead ends: 703 [2025-02-06 02:20:28,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 567 GetRequests, 527 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=370, Invalid=1270, Unknown=0, NotChecked=0, Total=1640 [2025-02-06 02:20:28,476 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 2350 mSDsluCounter, 1680 mSDsCounter, 0 mSdLazyCounter, 2040 mSolverCounterSat, 358 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2371 SdHoareTripleChecker+Valid, 1933 SdHoareTripleChecker+Invalid, 2398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 358 IncrementalHoareTripleChecker+Valid, 2040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-06 02:20:28,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2371 Valid, 1933 Invalid, 2398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [358 Valid, 2040 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-06 02:20:28,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2025-02-06 02:20:28,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 364. [2025-02-06 02:20:28,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 279 states have (on average 1.4838709677419355) internal successors, (414), 279 states have internal predecessors, (414), 78 states have call successors, (78), 6 states have call predecessors, (78), 6 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2025-02-06 02:20:28,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 570 transitions. [2025-02-06 02:20:28,511 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 570 transitions. Word has length 263 [2025-02-06 02:20:28,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:20:28,512 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 570 transitions. [2025-02-06 02:20:28,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.9375) internal successors, (127), 16 states have internal predecessors, (127), 4 states have call successors, (95), 2 states have call predecessors, (95), 4 states have return successors, (96), 4 states have call predecessors, (96), 4 states have call successors, (96) [2025-02-06 02:20:28,512 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 570 transitions. [2025-02-06 02:20:28,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-02-06 02:20:28,514 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:20:28,515 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:28,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 02:20:28,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:20:28,715 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:20:28,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:20:28,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1795556647, now seen corresponding path program 1 times [2025-02-06 02:20:28,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:20:28,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755344512] [2025-02-06 02:20:28,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:20:28,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:20:28,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-02-06 02:20:28,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-02-06 02:20:28,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:20:28,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:20:29,012 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-02-06 02:20:29,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:20:29,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755344512] [2025-02-06 02:20:29,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755344512] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:20:29,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:20:29,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:20:29,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838545905] [2025-02-06 02:20:29,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:20:29,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:20:29,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:20:29,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:20:29,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:20:29,014 INFO L87 Difference]: Start difference. First operand 364 states and 570 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-02-06 02:20:29,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:20:29,171 INFO L93 Difference]: Finished difference Result 586 states and 921 transitions. [2025-02-06 02:20:29,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:20:29,172 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 263 [2025-02-06 02:20:29,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:20:29,174 INFO L225 Difference]: With dead ends: 586 [2025-02-06 02:20:29,174 INFO L226 Difference]: Without dead ends: 357 [2025-02-06 02:20:29,175 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:20:29,175 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 184 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:20:29,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 649 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:20:29,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-02-06 02:20:29,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 345. [2025-02-06 02:20:29,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 260 states have (on average 1.4653846153846153) internal successors, (381), 260 states have internal predecessors, (381), 78 states have call successors, (78), 6 states have call predecessors, (78), 6 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2025-02-06 02:20:29,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 537 transitions. [2025-02-06 02:20:29,196 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 537 transitions. Word has length 263 [2025-02-06 02:20:29,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:20:29,196 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 537 transitions. [2025-02-06 02:20:29,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-02-06 02:20:29,197 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 537 transitions. [2025-02-06 02:20:29,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-02-06 02:20:29,198 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:20:29,198 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:29,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 02:20:29,198 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:20:29,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:20:29,199 INFO L85 PathProgramCache]: Analyzing trace with hash -533338570, now seen corresponding path program 1 times [2025-02-06 02:20:29,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:20:29,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042774805] [2025-02-06 02:20:29,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:20:29,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:20:29,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-02-06 02:20:29,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-02-06 02:20:29,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:20:29,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:20:29,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-02-06 02:20:29,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:20:29,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042774805] [2025-02-06 02:20:29,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042774805] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:20:29,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:20:29,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:20:29,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113376407] [2025-02-06 02:20:29,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:20:29,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:20:29,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:20:29,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:20:29,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:20:29,415 INFO L87 Difference]: Start difference. First operand 345 states and 537 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-02-06 02:20:29,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:20:29,595 INFO L93 Difference]: Finished difference Result 785 states and 1237 transitions. [2025-02-06 02:20:29,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:20:29,595 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 265 [2025-02-06 02:20:29,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:20:29,598 INFO L225 Difference]: With dead ends: 785 [2025-02-06 02:20:29,600 INFO L226 Difference]: Without dead ends: 573 [2025-02-06 02:20:29,600 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:20:29,601 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 353 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:20:29,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 655 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:20:29,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2025-02-06 02:20:29,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 512. [2025-02-06 02:20:29,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 386 states have (on average 1.455958549222798) internal successors, (562), 386 states have internal predecessors, (562), 117 states have call successors, (117), 8 states have call predecessors, (117), 8 states have return successors, (117), 117 states have call predecessors, (117), 117 states have call successors, (117) [2025-02-06 02:20:29,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 796 transitions. [2025-02-06 02:20:29,637 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 796 transitions. Word has length 265 [2025-02-06 02:20:29,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:20:29,637 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 796 transitions. [2025-02-06 02:20:29,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-02-06 02:20:29,637 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 796 transitions. [2025-02-06 02:20:29,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-02-06 02:20:29,638 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:20:29,639 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:29,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 02:20:29,639 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:20:29,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:20:29,639 INFO L85 PathProgramCache]: Analyzing trace with hash -2007527208, now seen corresponding path program 1 times [2025-02-06 02:20:29,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:20:29,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613754167] [2025-02-06 02:20:29,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:20:29,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:20:29,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-02-06 02:20:29,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-02-06 02:20:29,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:20:29,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:20:29,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-02-06 02:20:29,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:20:29,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613754167] [2025-02-06 02:20:29,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613754167] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:20:29,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:20:29,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:20:29,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341852954] [2025-02-06 02:20:29,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:20:29,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:20:29,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:20:29,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:20:29,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:20:29,849 INFO L87 Difference]: Start difference. First operand 512 states and 796 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-02-06 02:20:30,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:20:30,012 INFO L93 Difference]: Finished difference Result 1281 states and 2010 transitions. [2025-02-06 02:20:30,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:20:30,013 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 265 [2025-02-06 02:20:30,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:20:30,018 INFO L225 Difference]: With dead ends: 1281 [2025-02-06 02:20:30,018 INFO L226 Difference]: Without dead ends: 884 [2025-02-06 02:20:30,019 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:20:30,020 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 316 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:20:30,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 658 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:20:30,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2025-02-06 02:20:30,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 826. [2025-02-06 02:20:30,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 826 states, 618 states have (on average 1.4611650485436893) internal successors, (903), 618 states have internal predecessors, (903), 195 states have call successors, (195), 12 states have call predecessors, (195), 12 states have return successors, (195), 195 states have call predecessors, (195), 195 states have call successors, (195) [2025-02-06 02:20:30,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 1293 transitions. [2025-02-06 02:20:30,057 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 1293 transitions. Word has length 265 [2025-02-06 02:20:30,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:20:30,057 INFO L471 AbstractCegarLoop]: Abstraction has 826 states and 1293 transitions. [2025-02-06 02:20:30,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-02-06 02:20:30,058 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1293 transitions. [2025-02-06 02:20:30,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-02-06 02:20:30,059 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:20:30,059 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:30,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 02:20:30,059 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:20:30,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:20:30,059 INFO L85 PathProgramCache]: Analyzing trace with hash -496751334, now seen corresponding path program 1 times [2025-02-06 02:20:30,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:20:30,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625814040] [2025-02-06 02:20:30,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:20:30,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:20:30,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-02-06 02:20:30,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-02-06 02:20:30,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:20:30,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 02:20:30,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [245290259] [2025-02-06 02:20:30,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:20:30,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:20:30,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:20:30,416 INFO L229 MonitoredProcess]: Starting monitored process 4 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:20:30,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 02:20:30,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-02-06 02:20:30,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-02-06 02:20:30,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:20:30,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:20:30,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 90 conjuncts are in the unsatisfiable core [2025-02-06 02:20:30,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:20:35,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1732 proven. 213 refuted. 0 times theorem prover too weak. 1019 trivial. 0 not checked. [2025-02-06 02:20:35,523 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:20:52,698 WARN L286 SmtUtils]: Spent 16.16s on a formula simplification. DAG size of input: 89 DAG size of output: 52 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-02-06 02:21:16,819 WARN L286 SmtUtils]: Spent 20.87s on a formula simplification. DAG size of input: 84 DAG size of output: 78 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-02-06 02:21:44,702 WARN L286 SmtUtils]: Spent 12.15s on a formula simplification. DAG size of input: 91 DAG size of output: 90 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)