./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-39.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-39.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 4f3611a875fdf984da4dbe6a7960e00cbc86546d93a80a5be72248390d98dd3b --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:16:56,944 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:16:57,018 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 02:16:57,028 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:16:57,029 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:16:57,055 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:16:57,056 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:16:57,056 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:16:57,056 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:16:57,056 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:16:57,057 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:16:57,057 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:16:57,057 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:16:57,058 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:16:57,058 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:16:57,058 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:16:57,058 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:16:57,058 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:16:57,059 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:16:57,059 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:16:57,059 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:16:57,059 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:16:57,059 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:16:57,059 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:16:57,059 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:16:57,059 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:16:57,059 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:16:57,059 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:16:57,059 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:16:57,060 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:16:57,060 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:16:57,060 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:16:57,060 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:16:57,060 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:16:57,061 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:16:57,061 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:16:57,061 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:16:57,061 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:16:57,061 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:16:57,061 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:16:57,061 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:16:57,061 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:16:57,061 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:16:57,061 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 -> 4f3611a875fdf984da4dbe6a7960e00cbc86546d93a80a5be72248390d98dd3b [2025-02-06 02:16:57,321 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:16:57,331 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:16:57,333 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:16:57,334 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:16:57,334 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:16:57,335 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-39.i [2025-02-06 02:16:58,683 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1d3f8cdc8/16cf14ebf2ed4f1b97138a7426b7706e/FLAG7e3ec8030 [2025-02-06 02:16:59,065 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:16:59,066 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-39.i [2025-02-06 02:16:59,082 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1d3f8cdc8/16cf14ebf2ed4f1b97138a7426b7706e/FLAG7e3ec8030 [2025-02-06 02:16:59,100 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1d3f8cdc8/16cf14ebf2ed4f1b97138a7426b7706e [2025-02-06 02:16:59,103 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:16:59,104 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:16:59,106 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:16:59,106 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:16:59,113 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:16:59,115 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:16:59" (1/1) ... [2025-02-06 02:16:59,116 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57ac0d54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:16:59, skipping insertion in model container [2025-02-06 02:16:59,116 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:16:59" (1/1) ... [2025-02-06 02:16:59,150 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:16:59,295 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-39.i[916,929] [2025-02-06 02:16:59,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:16:59,445 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:16:59,453 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-39.i[916,929] [2025-02-06 02:16:59,513 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:16:59,534 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:16:59,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:16:59 WrapperNode [2025-02-06 02:16:59,535 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:16:59,535 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:16:59,535 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:16:59,536 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:16:59,540 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:16:59" (1/1) ... [2025-02-06 02:16:59,552 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:16:59" (1/1) ... [2025-02-06 02:16:59,610 INFO L138 Inliner]: procedures = 26, calls = 55, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 355 [2025-02-06 02:16:59,611 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:16:59,611 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:16:59,612 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:16:59,612 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:16:59,619 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:16:59" (1/1) ... [2025-02-06 02:16:59,620 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:16:59" (1/1) ... [2025-02-06 02:16:59,632 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:16:59" (1/1) ... [2025-02-06 02:16:59,672 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 02:16:59,673 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:16:59" (1/1) ... [2025-02-06 02:16:59,674 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:16:59" (1/1) ... [2025-02-06 02:16:59,693 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:16:59" (1/1) ... [2025-02-06 02:16:59,700 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:16:59" (1/1) ... [2025-02-06 02:16:59,707 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:16:59" (1/1) ... [2025-02-06 02:16:59,716 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:16:59" (1/1) ... [2025-02-06 02:16:59,726 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:16:59,728 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:16:59,729 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:16:59,729 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:16:59,730 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:16:59" (1/1) ... [2025-02-06 02:16:59,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:16:59,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:16:59,762 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 02:16:59,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 02:16:59,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:16:59,791 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:16:59,791 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:16:59,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:16:59,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:16:59,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:16:59,898 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:16:59,900 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:17:00,686 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L360: havoc property_#t~bitwise31#1; [2025-02-06 02:17:00,752 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2025-02-06 02:17:00,752 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:17:00,774 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:17:00,775 INFO L337 CfgBuilder]: Removed 2 assume(true) statements. [2025-02-06 02:17:00,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:17:00 BoogieIcfgContainer [2025-02-06 02:17:00,775 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:17:00,779 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:17:00,779 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:17:00,784 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:17:00,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:16:59" (1/3) ... [2025-02-06 02:17:00,785 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b57849d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:17:00, skipping insertion in model container [2025-02-06 02:17:00,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:16:59" (2/3) ... [2025-02-06 02:17:00,786 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b57849d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:17:00, skipping insertion in model container [2025-02-06 02:17:00,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:17:00" (3/3) ... [2025-02-06 02:17:00,787 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-39.i [2025-02-06 02:17:00,800 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:17:00,803 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-39.i that has 2 procedures, 145 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:17:00,865 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:17:00,876 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;@54560d0f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:17:00,876 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:17:00,882 INFO L276 IsEmpty]: Start isEmpty. Operand has 145 states, 100 states have (on average 1.5) internal successors, (150), 101 states have internal predecessors, (150), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-06 02:17:00,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2025-02-06 02:17:00,898 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:17:00,899 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:17:00,899 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:17:00,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:17:00,903 INFO L85 PathProgramCache]: Analyzing trace with hash 49916149, now seen corresponding path program 1 times [2025-02-06 02:17:00,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:17:00,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407989253] [2025-02-06 02:17:00,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:17:00,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:17:01,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 285 statements into 1 equivalence classes. [2025-02-06 02:17:01,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 285 of 285 statements. [2025-02-06 02:17:01,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:17:01,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:17:01,496 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2025-02-06 02:17:01,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:17:01,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407989253] [2025-02-06 02:17:01,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407989253] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:17:01,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223431223] [2025-02-06 02:17:01,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:17:01,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:17:01,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:17:01,502 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:17:01,505 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:17:01,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 285 statements into 1 equivalence classes. [2025-02-06 02:17:01,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 285 of 285 statements. [2025-02-06 02:17:01,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:17:01,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:17:01,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 699 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:17:01,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:17:01,877 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2025-02-06 02:17:01,877 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:17:01,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [223431223] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:17:01,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:17:01,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 02:17:01,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879789377] [2025-02-06 02:17:01,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:17:01,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:17:01,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:17:01,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:17:01,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:17:01,908 INFO L87 Difference]: Start difference. First operand has 145 states, 100 states have (on average 1.5) internal successors, (150), 101 states have internal predecessors, (150), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) Second operand has 2 states, 2 states have (on average 40.0) internal successors, (80), 2 states have internal predecessors, (80), 2 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 2 states have call successors, (42) [2025-02-06 02:17:01,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:17:01,950 INFO L93 Difference]: Finished difference Result 284 states and 505 transitions. [2025-02-06 02:17:01,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:17:01,952 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 40.0) internal successors, (80), 2 states have internal predecessors, (80), 2 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 2 states have call successors, (42) Word has length 285 [2025-02-06 02:17:01,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:17:01,958 INFO L225 Difference]: With dead ends: 284 [2025-02-06 02:17:01,959 INFO L226 Difference]: Without dead ends: 142 [2025-02-06 02:17:01,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 286 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:17:01,967 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:17:01,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 227 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:17:01,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-02-06 02:17:02,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2025-02-06 02:17:02,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 98 states have (on average 1.4795918367346939) internal successors, (145), 98 states have internal predecessors, (145), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-06 02:17:02,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 229 transitions. [2025-02-06 02:17:02,020 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 229 transitions. Word has length 285 [2025-02-06 02:17:02,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:17:02,020 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 229 transitions. [2025-02-06 02:17:02,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 40.0) internal successors, (80), 2 states have internal predecessors, (80), 2 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 2 states have call successors, (42) [2025-02-06 02:17:02,021 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 229 transitions. [2025-02-06 02:17:02,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2025-02-06 02:17:02,028 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:17:02,028 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:17:02,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 02:17:02,229 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:17:02,230 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:17:02,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:17:02,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1813244441, now seen corresponding path program 1 times [2025-02-06 02:17:02,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:17:02,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124231428] [2025-02-06 02:17:02,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:17:02,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:17:02,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 285 statements into 1 equivalence classes. [2025-02-06 02:17:02,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 285 of 285 statements. [2025-02-06 02:17:02,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:17:02,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:17:02,685 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-02-06 02:17:02,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:17:02,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124231428] [2025-02-06 02:17:02,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124231428] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:17:02,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:17:02,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:17:02,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101398104] [2025-02-06 02:17:02,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:17:02,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:17:02,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:17:02,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:17:02,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:17:02,695 INFO L87 Difference]: Start difference. First operand 142 states and 229 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-06 02:17:02,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:17:02,827 INFO L93 Difference]: Finished difference Result 384 states and 619 transitions. [2025-02-06 02:17:02,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:17:02,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 285 [2025-02-06 02:17:02,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:17:02,836 INFO L225 Difference]: With dead ends: 384 [2025-02-06 02:17:02,836 INFO L226 Difference]: Without dead ends: 245 [2025-02-06 02:17:02,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:17:02,838 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 139 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:17:02,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 544 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:17:02,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-02-06 02:17:02,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 242. [2025-02-06 02:17:02,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 172 states have (on average 1.4709302325581395) internal successors, (253), 173 states have internal predecessors, (253), 67 states have call successors, (67), 2 states have call predecessors, (67), 2 states have return successors, (67), 66 states have call predecessors, (67), 67 states have call successors, (67) [2025-02-06 02:17:02,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 387 transitions. [2025-02-06 02:17:02,876 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 387 transitions. Word has length 285 [2025-02-06 02:17:02,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:17:02,877 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 387 transitions. [2025-02-06 02:17:02,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-06 02:17:02,877 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 387 transitions. [2025-02-06 02:17:02,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-02-06 02:17:02,884 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:17:02,885 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:17:02,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:17:02,885 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:17:02,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:17:02,886 INFO L85 PathProgramCache]: Analyzing trace with hash 2064346964, now seen corresponding path program 1 times [2025-02-06 02:17:02,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:17:02,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429270272] [2025-02-06 02:17:02,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:17:02,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:17:02,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-02-06 02:17:03,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-02-06 02:17:03,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:17:03,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:17:03,741 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-02-06 02:17:03,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:17:03,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429270272] [2025-02-06 02:17:03,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429270272] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:17:03,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:17:03,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:17:03,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466231784] [2025-02-06 02:17:03,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:17:03,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:17:03,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:17:03,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:17:03,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:17:03,747 INFO L87 Difference]: Start difference. First operand 242 states and 387 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-06 02:17:03,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:17:03,862 INFO L93 Difference]: Finished difference Result 713 states and 1142 transitions. [2025-02-06 02:17:03,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:17:03,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 286 [2025-02-06 02:17:03,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:17:03,871 INFO L225 Difference]: With dead ends: 713 [2025-02-06 02:17:03,872 INFO L226 Difference]: Without dead ends: 474 [2025-02-06 02:17:03,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:17:03,875 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 110 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:17:03,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 435 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:17:03,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2025-02-06 02:17:03,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 444. [2025-02-06 02:17:03,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 305 states have (on average 1.4360655737704917) internal successors, (438), 307 states have internal predecessors, (438), 134 states have call successors, (134), 4 states have call predecessors, (134), 4 states have return successors, (134), 132 states have call predecessors, (134), 134 states have call successors, (134) [2025-02-06 02:17:03,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 706 transitions. [2025-02-06 02:17:03,971 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 706 transitions. Word has length 286 [2025-02-06 02:17:03,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:17:03,972 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 706 transitions. [2025-02-06 02:17:03,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-06 02:17:03,973 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 706 transitions. [2025-02-06 02:17:03,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-02-06 02:17:03,976 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:17:03,977 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:17:03,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 02:17:03,977 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:17:03,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:17:03,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1770943957, now seen corresponding path program 1 times [2025-02-06 02:17:03,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:17:03,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346458720] [2025-02-06 02:17:03,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:17:03,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:17:04,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-02-06 02:17:04,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-02-06 02:17:04,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:17:04,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:17:04,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-02-06 02:17:04,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:17:04,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346458720] [2025-02-06 02:17:04,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346458720] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:17:04,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:17:04,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:17:04,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990164346] [2025-02-06 02:17:04,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:17:04,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:17:04,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:17:04,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:17:04,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:17:04,678 INFO L87 Difference]: Start difference. First operand 444 states and 706 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2025-02-06 02:17:05,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:17:05,165 INFO L93 Difference]: Finished difference Result 1216 states and 1945 transitions. [2025-02-06 02:17:05,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:17:05,166 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 286 [2025-02-06 02:17:05,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:17:05,174 INFO L225 Difference]: With dead ends: 1216 [2025-02-06 02:17:05,176 INFO L226 Difference]: Without dead ends: 775 [2025-02-06 02:17:05,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:17:05,178 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 230 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:17:05,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 926 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:17:05,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2025-02-06 02:17:05,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 585. [2025-02-06 02:17:05,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 403 states have (on average 1.4218362282878412) internal successors, (573), 405 states have internal predecessors, (573), 176 states have call successors, (176), 5 states have call predecessors, (176), 5 states have return successors, (176), 174 states have call predecessors, (176), 176 states have call successors, (176) [2025-02-06 02:17:05,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 925 transitions. [2025-02-06 02:17:05,284 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 925 transitions. Word has length 286 [2025-02-06 02:17:05,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:17:05,286 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 925 transitions. [2025-02-06 02:17:05,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2025-02-06 02:17:05,286 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 925 transitions. [2025-02-06 02:17:05,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-02-06 02:17:05,291 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:17:05,291 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:17:05,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 02:17:05,292 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:17:05,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:17:05,292 INFO L85 PathProgramCache]: Analyzing trace with hash 2121743894, now seen corresponding path program 1 times [2025-02-06 02:17:05,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:17:05,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003202719] [2025-02-06 02:17:05,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:17:05,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:17:05,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-02-06 02:17:05,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-02-06 02:17:05,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:17:05,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:17:06,360 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-02-06 02:17:06,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:17:06,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003202719] [2025-02-06 02:17:06,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003202719] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:17:06,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:17:06,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:17:06,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408069299] [2025-02-06 02:17:06,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:17:06,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:17:06,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:17:06,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:17:06,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:17:06,363 INFO L87 Difference]: Start difference. First operand 585 states and 925 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-06 02:17:06,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:17:06,874 INFO L93 Difference]: Finished difference Result 1300 states and 2074 transitions. [2025-02-06 02:17:06,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 02:17:06,876 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 286 [2025-02-06 02:17:06,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:17:06,884 INFO L225 Difference]: With dead ends: 1300 [2025-02-06 02:17:06,884 INFO L226 Difference]: Without dead ends: 859 [2025-02-06 02:17:06,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:17:06,887 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 382 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:17:06,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 779 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:17:06,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2025-02-06 02:17:06,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 599. [2025-02-06 02:17:06,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 417 states have (on average 1.4268585131894485) internal successors, (595), 419 states have internal predecessors, (595), 176 states have call successors, (176), 5 states have call predecessors, (176), 5 states have return successors, (176), 174 states have call predecessors, (176), 176 states have call successors, (176) [2025-02-06 02:17:06,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 947 transitions. [2025-02-06 02:17:06,996 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 947 transitions. Word has length 286 [2025-02-06 02:17:06,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:17:06,998 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 947 transitions. [2025-02-06 02:17:06,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-06 02:17:06,999 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 947 transitions. [2025-02-06 02:17:07,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-02-06 02:17:07,003 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:17:07,003 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:17:07,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 02:17:07,004 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:17:07,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:17:07,005 INFO L85 PathProgramCache]: Analyzing trace with hash -96014059, now seen corresponding path program 1 times [2025-02-06 02:17:07,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:17:07,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324636856] [2025-02-06 02:17:07,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:17:07,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:17:07,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-02-06 02:17:07,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-02-06 02:17:07,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:17:07,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:17:19,401 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-02-06 02:17:19,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:17:19,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324636856] [2025-02-06 02:17:19,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324636856] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:17:19,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:17:19,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-02-06 02:17:19,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910695134] [2025-02-06 02:17:19,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:17:19,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 02:17:19,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:17:19,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 02:17:19,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2025-02-06 02:17:19,404 INFO L87 Difference]: Start difference. First operand 599 states and 947 transitions. Second operand has 19 states, 19 states have (on average 4.157894736842105) internal successors, (79), 19 states have internal predecessors, (79), 5 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 4 states have call predecessors, (42), 5 states have call successors, (42) [2025-02-06 02:17:24,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:17:24,327 INFO L93 Difference]: Finished difference Result 2027 states and 3255 transitions. [2025-02-06 02:17:24,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 02:17:24,327 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.157894736842105) internal successors, (79), 19 states have internal predecessors, (79), 5 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 4 states have call predecessors, (42), 5 states have call successors, (42) Word has length 286 [2025-02-06 02:17:24,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:17:24,339 INFO L225 Difference]: With dead ends: 2027 [2025-02-06 02:17:24,339 INFO L226 Difference]: Without dead ends: 1578 [2025-02-06 02:17:24,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=360, Invalid=1046, Unknown=0, NotChecked=0, Total=1406 [2025-02-06 02:17:24,344 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 3428 mSDsluCounter, 2043 mSDsCounter, 0 mSdLazyCounter, 1858 mSolverCounterSat, 302 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3428 SdHoareTripleChecker+Valid, 2251 SdHoareTripleChecker+Invalid, 2160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 302 IncrementalHoareTripleChecker+Valid, 1858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:17:24,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3428 Valid, 2251 Invalid, 2160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [302 Valid, 1858 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-02-06 02:17:24,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2025-02-06 02:17:24,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 655. [2025-02-06 02:17:24,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 472 states have (on average 1.4427966101694916) internal successors, (681), 474 states have internal predecessors, (681), 176 states have call successors, (176), 6 states have call predecessors, (176), 6 states have return successors, (176), 174 states have call predecessors, (176), 176 states have call successors, (176) [2025-02-06 02:17:24,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1033 transitions. [2025-02-06 02:17:24,425 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1033 transitions. Word has length 286 [2025-02-06 02:17:24,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:17:24,426 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 1033 transitions. [2025-02-06 02:17:24,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.157894736842105) internal successors, (79), 19 states have internal predecessors, (79), 5 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 4 states have call predecessors, (42), 5 states have call successors, (42) [2025-02-06 02:17:24,426 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1033 transitions. [2025-02-06 02:17:24,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-02-06 02:17:24,431 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:17:24,431 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:17:24,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 02:17:24,432 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:17:24,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:17:24,433 INFO L85 PathProgramCache]: Analyzing trace with hash 409544566, now seen corresponding path program 1 times [2025-02-06 02:17:24,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:17:24,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612364974] [2025-02-06 02:17:24,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:17:24,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:17:24,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-02-06 02:17:25,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-02-06 02:17:25,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:17:25,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:17:37,907 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-02-06 02:17:37,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:17:37,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612364974] [2025-02-06 02:17:37,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612364974] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:17:37,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:17:37,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-02-06 02:17:37,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819761595] [2025-02-06 02:17:37,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:17:37,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-06 02:17:37,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:17:37,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 02:17:37,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2025-02-06 02:17:37,909 INFO L87 Difference]: Start difference. First operand 655 states and 1033 transitions. Second operand has 17 states, 17 states have (on average 4.647058823529412) internal successors, (79), 17 states have internal predecessors, (79), 5 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 4 states have call predecessors, (42), 5 states have call successors, (42) [2025-02-06 02:17:41,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:17:41,615 INFO L93 Difference]: Finished difference Result 1919 states and 3081 transitions. [2025-02-06 02:17:41,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 02:17:41,616 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.647058823529412) internal successors, (79), 17 states have internal predecessors, (79), 5 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 4 states have call predecessors, (42), 5 states have call successors, (42) Word has length 286 [2025-02-06 02:17:41,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:17:41,625 INFO L225 Difference]: With dead ends: 1919 [2025-02-06 02:17:41,625 INFO L226 Difference]: Without dead ends: 1450 [2025-02-06 02:17:41,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=231, Invalid=699, Unknown=0, NotChecked=0, Total=930 [2025-02-06 02:17:41,629 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 1862 mSDsluCounter, 1526 mSDsCounter, 0 mSdLazyCounter, 1382 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1862 SdHoareTripleChecker+Valid, 1775 SdHoareTripleChecker+Invalid, 1622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 1382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-06 02:17:41,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1862 Valid, 1775 Invalid, 1622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 1382 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-06 02:17:41,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2025-02-06 02:17:41,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 627. [2025-02-06 02:17:41,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 444 states have (on average 1.427927927927928) internal successors, (634), 446 states have internal predecessors, (634), 176 states have call successors, (176), 6 states have call predecessors, (176), 6 states have return successors, (176), 174 states have call predecessors, (176), 176 states have call successors, (176) [2025-02-06 02:17:41,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 986 transitions. [2025-02-06 02:17:41,690 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 986 transitions. Word has length 286 [2025-02-06 02:17:41,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:17:41,691 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 986 transitions. [2025-02-06 02:17:41,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.647058823529412) internal successors, (79), 17 states have internal predecessors, (79), 5 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 4 states have call predecessors, (42), 5 states have call successors, (42) [2025-02-06 02:17:41,691 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 986 transitions. [2025-02-06 02:17:41,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-02-06 02:17:41,694 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:17:41,694 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:17:41,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 02:17:41,694 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:17:41,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:17:41,695 INFO L85 PathProgramCache]: Analyzing trace with hash -2134070348, now seen corresponding path program 1 times [2025-02-06 02:17:41,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:17:41,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713978185] [2025-02-06 02:17:41,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:17:41,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:17:41,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-02-06 02:17:42,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-02-06 02:17:42,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:17:42,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:17:42,537 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 18 proven. 105 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2025-02-06 02:17:42,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:17:42,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713978185] [2025-02-06 02:17:42,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713978185] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:17:42,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348682804] [2025-02-06 02:17:42,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:17:42,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:17:42,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:17:42,541 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:17:42,543 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:17:42,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-02-06 02:17:42,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-02-06 02:17:42,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:17:42,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:17:42,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-02-06 02:17:42,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:17:46,918 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 1180 proven. 489 refuted. 0 times theorem prover too weak. 1775 trivial. 0 not checked. [2025-02-06 02:17:46,919 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:17:50,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348682804] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:17:50,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 02:17:50,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 24] total 26 [2025-02-06 02:17:50,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131286570] [2025-02-06 02:17:50,896 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 02:17:50,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-06 02:17:50,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:17:50,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-06 02:17:50,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=959, Unknown=0, NotChecked=0, Total=1122 [2025-02-06 02:17:50,899 INFO L87 Difference]: Start difference. First operand 627 states and 986 transitions. Second operand has 26 states, 26 states have (on average 6.3076923076923075) internal successors, (164), 25 states have internal predecessors, (164), 7 states have call successors, (83), 6 states have call predecessors, (83), 10 states have return successors, (84), 7 states have call predecessors, (84), 7 states have call successors, (84) [2025-02-06 02:17:53,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:17:53,241 INFO L93 Difference]: Finished difference Result 1267 states and 1895 transitions. [2025-02-06 02:17:53,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-06 02:17:53,243 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 6.3076923076923075) internal successors, (164), 25 states have internal predecessors, (164), 7 states have call successors, (83), 6 states have call predecessors, (83), 10 states have return successors, (84), 7 states have call predecessors, (84), 7 states have call successors, (84) Word has length 286 [2025-02-06 02:17:53,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:17:53,252 INFO L225 Difference]: With dead ends: 1267 [2025-02-06 02:17:53,253 INFO L226 Difference]: Without dead ends: 770 [2025-02-06 02:17:53,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 661 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=437, Invalid=2425, Unknown=0, NotChecked=0, Total=2862 [2025-02-06 02:17:53,257 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 521 mSDsluCounter, 1246 mSDsCounter, 0 mSdLazyCounter, 1796 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 1412 SdHoareTripleChecker+Invalid, 1854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:17:53,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 1412 Invalid, 1854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1796 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-06 02:17:53,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2025-02-06 02:17:53,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 727. [2025-02-06 02:17:53,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 513 states have (on average 1.3391812865497077) internal successors, (687), 515 states have internal predecessors, (687), 176 states have call successors, (176), 37 states have call predecessors, (176), 37 states have return successors, (176), 174 states have call predecessors, (176), 176 states have call successors, (176) [2025-02-06 02:17:53,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1039 transitions. [2025-02-06 02:17:53,339 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1039 transitions. Word has length 286 [2025-02-06 02:17:53,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:17:53,340 INFO L471 AbstractCegarLoop]: Abstraction has 727 states and 1039 transitions. [2025-02-06 02:17:53,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.3076923076923075) internal successors, (164), 25 states have internal predecessors, (164), 7 states have call successors, (83), 6 states have call predecessors, (83), 10 states have return successors, (84), 7 states have call predecessors, (84), 7 states have call successors, (84) [2025-02-06 02:17:53,341 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1039 transitions. [2025-02-06 02:17:53,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-02-06 02:17:53,344 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:17:53,344 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:17:53,355 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:17:53,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:17:53,550 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:17:53,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:17:53,550 INFO L85 PathProgramCache]: Analyzing trace with hash -2031674346, now seen corresponding path program 1 times [2025-02-06 02:17:53,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:17:53,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504261535] [2025-02-06 02:17:53,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:17:53,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:17:53,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-02-06 02:17:54,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-02-06 02:17:54,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:17:54,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:17:59,445 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-02-06 02:17:59,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:17:59,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504261535] [2025-02-06 02:17:59,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504261535] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:17:59,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:17:59,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-06 02:17:59,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855027408] [2025-02-06 02:17:59,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:17:59,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 02:17:59,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:17:59,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 02:17:59,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-02-06 02:17:59,448 INFO L87 Difference]: Start difference. First operand 727 states and 1039 transitions. Second operand has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 states have internal predecessors, (79), 4 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 3 states have call predecessors, (42), 4 states have call successors, (42) [2025-02-06 02:18:02,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:18:02,060 INFO L93 Difference]: Finished difference Result 2023 states and 3031 transitions. [2025-02-06 02:18:02,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 02:18:02,061 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 states have internal predecessors, (79), 4 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 3 states have call predecessors, (42), 4 states have call successors, (42) Word has length 286 [2025-02-06 02:18:02,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:18:02,067 INFO L225 Difference]: With dead ends: 2023 [2025-02-06 02:18:02,067 INFO L226 Difference]: Without dead ends: 1486 [2025-02-06 02:18:02,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=202, Invalid=500, Unknown=0, NotChecked=0, Total=702 [2025-02-06 02:18:02,072 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 1585 mSDsluCounter, 1198 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1585 SdHoareTripleChecker+Valid, 1405 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-06 02:18:02,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1585 Valid, 1405 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-06 02:18:02,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2025-02-06 02:18:02,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 839. [2025-02-06 02:18:02,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 625 states have (on average 1.3728) internal successors, (858), 627 states have internal predecessors, (858), 176 states have call successors, (176), 37 states have call predecessors, (176), 37 states have return successors, (176), 174 states have call predecessors, (176), 176 states have call successors, (176) [2025-02-06 02:18:02,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1210 transitions. [2025-02-06 02:18:02,161 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1210 transitions. Word has length 286 [2025-02-06 02:18:02,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:18:02,161 INFO L471 AbstractCegarLoop]: Abstraction has 839 states and 1210 transitions. [2025-02-06 02:18:02,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 states have internal predecessors, (79), 4 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 3 states have call predecessors, (42), 4 states have call successors, (42) [2025-02-06 02:18:02,162 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1210 transitions. [2025-02-06 02:18:02,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-02-06 02:18:02,165 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:18:02,165 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:02,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 02:18:02,165 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:18:02,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:18:02,165 INFO L85 PathProgramCache]: Analyzing trace with hash 225236661, now seen corresponding path program 1 times [2025-02-06 02:18:02,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:18:02,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470738415] [2025-02-06 02:18:02,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:18:02,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:18:02,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-02-06 02:18:02,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-02-06 02:18:02,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:18:02,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:18:03,836 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 3 proven. 120 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2025-02-06 02:18:03,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:18:03,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470738415] [2025-02-06 02:18:03,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470738415] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:18:03,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887023109] [2025-02-06 02:18:03,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:18:03,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:18:03,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:18:03,839 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:18:03,840 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:18:03,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-02-06 02:18:04,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-02-06 02:18:04,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:18:04,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:18:04,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 02:18:04,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:18:04,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 893 proven. 105 refuted. 0 times theorem prover too weak. 2446 trivial. 0 not checked. [2025-02-06 02:18:04,896 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:18:06,423 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 18 proven. 105 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2025-02-06 02:18:06,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887023109] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:18:06,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:18:06,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 20 [2025-02-06 02:18:06,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575214179] [2025-02-06 02:18:06,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:18:06,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-06 02:18:06,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:18:06,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-06 02:18:06,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2025-02-06 02:18:06,426 INFO L87 Difference]: Start difference. First operand 839 states and 1210 transitions. Second operand has 20 states, 19 states have (on average 10.368421052631579) internal successors, (197), 19 states have internal predecessors, (197), 6 states have call successors, (126), 3 states have call predecessors, (126), 6 states have return successors, (126), 6 states have call predecessors, (126), 6 states have call successors, (126)