./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-62.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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-62.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 3270c8118d1f3bdb2a198b4b5aa7f84c93b7a61bdca0993e970b844057a9b636 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:26:20,855 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:26:20,929 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 14:26:20,937 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:26:20,937 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:26:20,958 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:26:20,959 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:26:20,959 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:26:20,960 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:26:20,960 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:26:20,960 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:26:20,960 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:26:20,960 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:26:20,960 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:26:20,961 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:26:20,961 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:26:20,961 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:26:20,961 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:26:20,961 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:26:20,961 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:26:20,961 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:26:20,962 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:26:20,962 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:26:20,962 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:26:20,962 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:26:20,962 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:26:20,962 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:26:20,962 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:26:20,962 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:26:20,963 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:26:20,963 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:26:20,963 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:26:20,963 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:26:20,963 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:26:20,963 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:26:20,963 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:26:20,964 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:26:20,964 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:26:20,964 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:26:20,964 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:26:20,964 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:26:20,964 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:26:20,964 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:26:20,964 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:26:20,964 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:26:20,964 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:26:20,965 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:26:20,965 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:26:20,965 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3270c8118d1f3bdb2a198b4b5aa7f84c93b7a61bdca0993e970b844057a9b636 [2025-01-09 14:26:21,233 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:26:21,242 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:26:21,246 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:26:21,247 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:26:21,247 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:26:21,248 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-62.i [2025-01-09 14:26:22,540 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5615a84d9/5be2a2b8ebe54437ac5023b577341d96/FLAG3fe42a2d5 [2025-01-09 14:26:22,910 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:26:22,911 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-62.i [2025-01-09 14:26:22,926 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5615a84d9/5be2a2b8ebe54437ac5023b577341d96/FLAG3fe42a2d5 [2025-01-09 14:26:23,119 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5615a84d9/5be2a2b8ebe54437ac5023b577341d96 [2025-01-09 14:26:23,122 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:26:23,123 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:26:23,124 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:26:23,124 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:26:23,128 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:26:23,129 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:26:23" (1/1) ... [2025-01-09 14:26:23,130 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@120706b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:23, skipping insertion in model container [2025-01-09 14:26:23,130 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:26:23" (1/1) ... [2025-01-09 14:26:23,168 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:26:23,317 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-62.i[916,929] [2025-01-09 14:26:23,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:26:23,512 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:26:23,525 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-62.i[916,929] [2025-01-09 14:26:23,628 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:26:23,648 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:26:23,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:23 WrapperNode [2025-01-09 14:26:23,650 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:26:23,651 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:26:23,651 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:26:23,651 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:26:23,657 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:23" (1/1) ... [2025-01-09 14:26:23,672 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:23" (1/1) ... [2025-01-09 14:26:23,733 INFO L138 Inliner]: procedures = 26, calls = 69, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 446 [2025-01-09 14:26:23,734 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:26:23,735 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:26:23,736 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:26:23,736 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:26:23,743 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:23" (1/1) ... [2025-01-09 14:26:23,744 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:23" (1/1) ... [2025-01-09 14:26:23,751 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:23" (1/1) ... [2025-01-09 14:26:23,794 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-01-09 14:26:23,795 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:23" (1/1) ... [2025-01-09 14:26:23,795 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:23" (1/1) ... [2025-01-09 14:26:23,823 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:23" (1/1) ... [2025-01-09 14:26:23,830 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:23" (1/1) ... [2025-01-09 14:26:23,836 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:23" (1/1) ... [2025-01-09 14:26:23,850 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:23" (1/1) ... [2025-01-09 14:26:23,859 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:23" (1/1) ... [2025-01-09 14:26:23,873 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:26:23,875 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:26:23,875 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:26:23,876 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:26:23,876 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:23" (1/1) ... [2025-01-09 14:26:23,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:26:23,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:26:23,906 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-01-09 14:26:23,909 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-01-09 14:26:23,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:26:23,930 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:26:23,930 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:26:23,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:26:23,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:26:23,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:26:24,036 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:26:24,037 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:26:24,921 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2025-01-09 14:26:24,921 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:26:24,938 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:26:24,940 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:26:24,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:26:24 BoogieIcfgContainer [2025-01-09 14:26:24,940 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:26:24,942 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:26:24,943 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:26:24,947 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:26:24,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:26:23" (1/3) ... [2025-01-09 14:26:24,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6604aea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:26:24, skipping insertion in model container [2025-01-09 14:26:24,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:23" (2/3) ... [2025-01-09 14:26:24,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6604aea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:26:24, skipping insertion in model container [2025-01-09 14:26:24,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:26:24" (3/3) ... [2025-01-09 14:26:24,950 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-62.i [2025-01-09 14:26:24,964 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:26:24,969 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-62.i that has 2 procedures, 186 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:26:25,033 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:26:25,046 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;@2b1643be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:26:25,047 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:26:25,050 INFO L276 IsEmpty]: Start isEmpty. Operand has 186 states, 127 states have (on average 1.4645669291338583) internal successors, (186), 128 states have internal predecessors, (186), 56 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-01-09 14:26:25,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2025-01-09 14:26:25,068 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:25,069 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:26:25,069 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:25,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:25,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1102504972, now seen corresponding path program 1 times [2025-01-09 14:26:25,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:25,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800493118] [2025-01-09 14:26:25,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:25,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:25,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 369 statements into 1 equivalence classes. [2025-01-09 14:26:25,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 369 of 369 statements. [2025-01-09 14:26:25,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:25,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:25,774 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 6050 trivial. 0 not checked. [2025-01-09 14:26:25,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:25,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800493118] [2025-01-09 14:26:25,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800493118] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:26:25,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381278832] [2025-01-09 14:26:25,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:25,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:26:25,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:26:25,780 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-01-09 14:26:25,782 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-01-09 14:26:25,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 369 statements into 1 equivalence classes. [2025-01-09 14:26:26,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 369 of 369 statements. [2025-01-09 14:26:26,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:26,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:26,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 864 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:26:26,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:26:26,194 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 6050 trivial. 0 not checked. [2025-01-09 14:26:26,194 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:26:26,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381278832] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:26:26,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:26:26,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:26:26,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288685783] [2025-01-09 14:26:26,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:26:26,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:26:26,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:26:26,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:26:26,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:26:26,227 INFO L87 Difference]: Start difference. First operand has 186 states, 127 states have (on average 1.4645669291338583) internal successors, (186), 128 states have internal predecessors, (186), 56 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) Second operand has 2 states, 2 states have (on average 47.0) internal successors, (94), 2 states have internal predecessors, (94), 2 states have call successors, (56), 2 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 2 states have call successors, (56) [2025-01-09 14:26:26,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:26:26,272 INFO L93 Difference]: Finished difference Result 364 states and 645 transitions. [2025-01-09 14:26:26,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:26:26,273 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 47.0) internal successors, (94), 2 states have internal predecessors, (94), 2 states have call successors, (56), 2 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 2 states have call successors, (56) Word has length 369 [2025-01-09 14:26:26,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:26:26,281 INFO L225 Difference]: With dead ends: 364 [2025-01-09 14:26:26,281 INFO L226 Difference]: Without dead ends: 181 [2025-01-09 14:26:26,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 370 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-01-09 14:26:26,293 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:26:26,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:26:26,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-01-09 14:26:26,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2025-01-09 14:26:26,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 123 states have (on average 1.4390243902439024) internal successors, (177), 123 states have internal predecessors, (177), 56 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-01-09 14:26:26,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 289 transitions. [2025-01-09 14:26:26,355 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 289 transitions. Word has length 369 [2025-01-09 14:26:26,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:26:26,355 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 289 transitions. [2025-01-09 14:26:26,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 47.0) internal successors, (94), 2 states have internal predecessors, (94), 2 states have call successors, (56), 2 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 2 states have call successors, (56) [2025-01-09 14:26:26,356 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 289 transitions. [2025-01-09 14:26:26,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2025-01-09 14:26:26,363 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:26,363 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:26:26,374 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-01-09 14:26:26,564 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-01-09 14:26:26,564 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:26,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:26,565 INFO L85 PathProgramCache]: Analyzing trace with hash 136638152, now seen corresponding path program 1 times [2025-01-09 14:26:26,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:26,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614071136] [2025-01-09 14:26:26,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:26,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:26,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 369 statements into 1 equivalence classes. [2025-01-09 14:26:26,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 369 of 369 statements. [2025-01-09 14:26:26,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:26,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:27,053 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-01-09 14:26:27,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:27,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614071136] [2025-01-09 14:26:27,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614071136] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:26:27,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:26:27,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:26:27,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6509796] [2025-01-09 14:26:27,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:26:27,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:26:27,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:26:27,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:26:27,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:26:27,061 INFO L87 Difference]: Start difference. First operand 181 states and 289 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-01-09 14:26:27,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:26:27,187 INFO L93 Difference]: Finished difference Result 520 states and 831 transitions. [2025-01-09 14:26:27,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:26:27,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 369 [2025-01-09 14:26:27,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:26:27,193 INFO L225 Difference]: With dead ends: 520 [2025-01-09 14:26:27,193 INFO L226 Difference]: Without dead ends: 342 [2025-01-09 14:26:27,195 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-01-09 14:26:27,196 INFO L435 NwaCegarLoop]: 504 mSDtfsCounter, 244 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:26:27,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 780 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:26:27,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2025-01-09 14:26:27,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 199. [2025-01-09 14:26:27,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 141 states have (on average 1.4680851063829787) internal successors, (207), 141 states have internal predecessors, (207), 56 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-01-09 14:26:27,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 319 transitions. [2025-01-09 14:26:27,240 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 319 transitions. Word has length 369 [2025-01-09 14:26:27,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:26:27,244 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 319 transitions. [2025-01-09 14:26:27,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-01-09 14:26:27,244 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 319 transitions. [2025-01-09 14:26:27,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2025-01-09 14:26:27,248 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:27,249 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:26:27,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:26:27,251 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:27,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:27,252 INFO L85 PathProgramCache]: Analyzing trace with hash 585928419, now seen corresponding path program 1 times [2025-01-09 14:26:27,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:27,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907169748] [2025-01-09 14:26:27,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:27,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:27,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 370 statements into 1 equivalence classes. [2025-01-09 14:26:27,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 370 of 370 statements. [2025-01-09 14:26:27,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:27,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:27,833 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-01-09 14:26:27,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:27,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907169748] [2025-01-09 14:26:27,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907169748] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:26:27,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:26:27,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:26:27,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104228249] [2025-01-09 14:26:27,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:26:27,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:26:27,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:26:27,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:26:27,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:26:27,836 INFO L87 Difference]: Start difference. First operand 199 states and 319 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-01-09 14:26:27,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:26:27,875 INFO L93 Difference]: Finished difference Result 395 states and 635 transitions. [2025-01-09 14:26:27,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:26:27,876 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 370 [2025-01-09 14:26:27,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:26:27,881 INFO L225 Difference]: With dead ends: 395 [2025-01-09 14:26:27,882 INFO L226 Difference]: Without dead ends: 199 [2025-01-09 14:26:27,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:26:27,883 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 0 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:26:27,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 848 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:26:27,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-01-09 14:26:27,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2025-01-09 14:26:27,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 141 states have (on average 1.4609929078014185) internal successors, (206), 141 states have internal predecessors, (206), 56 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-01-09 14:26:27,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 318 transitions. [2025-01-09 14:26:27,911 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 318 transitions. Word has length 370 [2025-01-09 14:26:27,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:26:27,913 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 318 transitions. [2025-01-09 14:26:27,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-01-09 14:26:27,913 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 318 transitions. [2025-01-09 14:26:27,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2025-01-09 14:26:27,917 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:27,917 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:26:27,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:26:27,917 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:27,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:27,918 INFO L85 PathProgramCache]: Analyzing trace with hash -443430879, now seen corresponding path program 1 times [2025-01-09 14:26:27,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:27,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017274872] [2025-01-09 14:26:27,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:27,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:27,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 370 statements into 1 equivalence classes. [2025-01-09 14:26:28,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 370 of 370 statements. [2025-01-09 14:26:28,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:28,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:28,563 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-01-09 14:26:28,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:28,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017274872] [2025-01-09 14:26:28,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017274872] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:26:28,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:26:28,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:26:28,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619850816] [2025-01-09 14:26:28,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:26:28,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:26:28,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:26:28,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:26:28,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:26:28,568 INFO L87 Difference]: Start difference. First operand 199 states and 318 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-01-09 14:26:28,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:26:28,644 INFO L93 Difference]: Finished difference Result 395 states and 633 transitions. [2025-01-09 14:26:28,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:26:28,645 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 370 [2025-01-09 14:26:28,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:26:28,649 INFO L225 Difference]: With dead ends: 395 [2025-01-09 14:26:28,650 INFO L226 Difference]: Without dead ends: 199 [2025-01-09 14:26:28,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:26:28,652 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 163 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:26:28,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 557 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:26:28,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-01-09 14:26:28,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2025-01-09 14:26:28,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 141 states have (on average 1.4539007092198581) internal successors, (205), 141 states have internal predecessors, (205), 56 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-01-09 14:26:28,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 317 transitions. [2025-01-09 14:26:28,678 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 317 transitions. Word has length 370 [2025-01-09 14:26:28,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:26:28,680 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 317 transitions. [2025-01-09 14:26:28,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-01-09 14:26:28,680 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 317 transitions. [2025-01-09 14:26:28,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2025-01-09 14:26:28,685 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:28,686 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:26:28,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:26:28,686 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:28,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:28,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1475646153, now seen corresponding path program 1 times [2025-01-09 14:26:28,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:28,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743761247] [2025-01-09 14:26:28,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:28,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:28,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 371 statements into 1 equivalence classes. [2025-01-09 14:26:28,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 371 of 371 statements. [2025-01-09 14:26:28,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:28,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:29,672 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-01-09 14:26:29,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:29,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743761247] [2025-01-09 14:26:29,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743761247] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:26:29,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:26:29,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:26:29,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518948869] [2025-01-09 14:26:29,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:26:29,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:26:29,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:26:29,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:26:29,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:26:29,677 INFO L87 Difference]: Start difference. First operand 199 states and 317 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-01-09 14:26:30,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:26:30,096 INFO L93 Difference]: Finished difference Result 592 states and 946 transitions. [2025-01-09 14:26:30,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:26:30,097 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 371 [2025-01-09 14:26:30,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:26:30,100 INFO L225 Difference]: With dead ends: 592 [2025-01-09 14:26:30,102 INFO L226 Difference]: Without dead ends: 396 [2025-01-09 14:26:30,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:26:30,105 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 174 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:26:30,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 988 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:26:30,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-01-09 14:26:30,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 308. [2025-01-09 14:26:30,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 193 states have (on average 1.3730569948186528) internal successors, (265), 193 states have internal predecessors, (265), 112 states have call successors, (112), 2 states have call predecessors, (112), 2 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2025-01-09 14:26:30,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 489 transitions. [2025-01-09 14:26:30,162 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 489 transitions. Word has length 371 [2025-01-09 14:26:30,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:26:30,165 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 489 transitions. [2025-01-09 14:26:30,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-01-09 14:26:30,166 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 489 transitions. [2025-01-09 14:26:30,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-01-09 14:26:30,171 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:30,171 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:26:30,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:26:30,171 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:30,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:30,172 INFO L85 PathProgramCache]: Analyzing trace with hash 237656289, now seen corresponding path program 1 times [2025-01-09 14:26:30,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:30,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412840714] [2025-01-09 14:26:30,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:30,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:30,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-01-09 14:26:30,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-01-09 14:26:30,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:30,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:31,722 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 15 proven. 150 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-01-09 14:26:31,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:31,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412840714] [2025-01-09 14:26:31,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412840714] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:26:31,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644240963] [2025-01-09 14:26:31,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:31,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:26:31,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:26:31,725 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-01-09 14:26:31,728 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-01-09 14:26:31,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-01-09 14:26:32,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-01-09 14:26:32,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:32,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:32,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 864 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 14:26:32,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:26:33,643 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 4269 proven. 213 refuted. 0 times theorem prover too weak. 1678 trivial. 0 not checked. [2025-01-09 14:26:33,643 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:26:34,545 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 411 proven. 231 refuted. 0 times theorem prover too weak. 5518 trivial. 0 not checked. [2025-01-09 14:26:34,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644240963] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:26:34,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:26:34,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 14, 14] total 28 [2025-01-09 14:26:34,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574247616] [2025-01-09 14:26:34,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:26:34,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 14:26:34,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:26:34,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 14:26:34,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=575, Unknown=0, NotChecked=0, Total=756 [2025-01-09 14:26:34,552 INFO L87 Difference]: Start difference. First operand 308 states and 489 transitions. Second operand has 28 states, 28 states have (on average 9.142857142857142) internal successors, (256), 28 states have internal predecessors, (256), 9 states have call successors, (146), 5 states have call predecessors, (146), 12 states have return successors, (148), 9 states have call predecessors, (148), 9 states have call successors, (148) [2025-01-09 14:26:36,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:26:36,707 INFO L93 Difference]: Finished difference Result 664 states and 1006 transitions. [2025-01-09 14:26:36,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-01-09 14:26:36,709 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 9.142857142857142) internal successors, (256), 28 states have internal predecessors, (256), 9 states have call successors, (146), 5 states have call predecessors, (146), 12 states have return successors, (148), 9 states have call predecessors, (148), 9 states have call successors, (148) Word has length 372 [2025-01-09 14:26:36,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:26:36,714 INFO L225 Difference]: With dead ends: 664 [2025-01-09 14:26:36,714 INFO L226 Difference]: Without dead ends: 468 [2025-01-09 14:26:36,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 784 GetRequests, 727 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 837 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=894, Invalid=2412, Unknown=0, NotChecked=0, Total=3306 [2025-01-09 14:26:36,719 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 1546 mSDsluCounter, 1153 mSDsCounter, 0 mSdLazyCounter, 1384 mSolverCounterSat, 505 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1547 SdHoareTripleChecker+Valid, 1350 SdHoareTripleChecker+Invalid, 1889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 505 IncrementalHoareTripleChecker+Valid, 1384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:26:36,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1547 Valid, 1350 Invalid, 1889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [505 Valid, 1384 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 14:26:36,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-01-09 14:26:36,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 445. [2025-01-09 14:26:36,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 313 states have (on average 1.376996805111821) internal successors, (431), 314 states have internal predecessors, (431), 117 states have call successors, (117), 14 states have call predecessors, (117), 14 states have return successors, (117), 116 states have call predecessors, (117), 117 states have call successors, (117) [2025-01-09 14:26:36,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 665 transitions. [2025-01-09 14:26:36,788 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 665 transitions. Word has length 372 [2025-01-09 14:26:36,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:26:36,790 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 665 transitions. [2025-01-09 14:26:36,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 9.142857142857142) internal successors, (256), 28 states have internal predecessors, (256), 9 states have call successors, (146), 5 states have call predecessors, (146), 12 states have return successors, (148), 9 states have call predecessors, (148), 9 states have call successors, (148) [2025-01-09 14:26:36,792 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 665 transitions. [2025-01-09 14:26:36,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2025-01-09 14:26:36,795 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:36,795 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:26:36,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 14:26:36,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:26:36,996 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:36,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:36,997 INFO L85 PathProgramCache]: Analyzing trace with hash 20051848, now seen corresponding path program 1 times [2025-01-09 14:26:36,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:36,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117976465] [2025-01-09 14:26:36,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:36,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:37,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-01-09 14:26:37,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-01-09 14:26:37,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:37,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:38,172 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-01-09 14:26:38,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:38,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117976465] [2025-01-09 14:26:38,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117976465] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:26:38,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:26:38,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:26:38,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870312911] [2025-01-09 14:26:38,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:26:38,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:26:38,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:26:38,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:26:38,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:26:38,176 INFO L87 Difference]: Start difference. First operand 445 states and 665 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 1 states have call successors, (56), 1 states have call predecessors, (56), 2 states have return successors, (56), 2 states have call predecessors, (56), 1 states have call successors, (56) [2025-01-09 14:26:39,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:26:39,029 INFO L93 Difference]: Finished difference Result 760 states and 1123 transitions. [2025-01-09 14:26:39,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 14:26:39,031 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 1 states have call successors, (56), 1 states have call predecessors, (56), 2 states have return successors, (56), 2 states have call predecessors, (56), 1 states have call successors, (56) Word has length 374 [2025-01-09 14:26:39,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:26:39,036 INFO L225 Difference]: With dead ends: 760 [2025-01-09 14:26:39,039 INFO L226 Difference]: Without dead ends: 451 [2025-01-09 14:26:39,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2025-01-09 14:26:39,040 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 354 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 14:26:39,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 956 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 14:26:39,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2025-01-09 14:26:39,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 411. [2025-01-09 14:26:39,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 277 states have (on average 1.3032490974729243) internal successors, (361), 278 states have internal predecessors, (361), 117 states have call successors, (117), 16 states have call predecessors, (117), 16 states have return successors, (117), 116 states have call predecessors, (117), 117 states have call successors, (117) [2025-01-09 14:26:39,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 595 transitions. [2025-01-09 14:26:39,103 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 595 transitions. Word has length 374 [2025-01-09 14:26:39,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:26:39,103 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 595 transitions. [2025-01-09 14:26:39,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 1 states have call successors, (56), 1 states have call predecessors, (56), 2 states have return successors, (56), 2 states have call predecessors, (56), 1 states have call successors, (56) [2025-01-09 14:26:39,104 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 595 transitions. [2025-01-09 14:26:39,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2025-01-09 14:26:39,106 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:39,106 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:26:39,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:26:39,107 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:39,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:39,107 INFO L85 PathProgramCache]: Analyzing trace with hash -746405634, now seen corresponding path program 1 times [2025-01-09 14:26:39,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:39,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472021395] [2025-01-09 14:26:39,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:39,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:39,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-01-09 14:26:39,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-01-09 14:26:39,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:39,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:39,319 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-01-09 14:26:39,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:39,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472021395] [2025-01-09 14:26:39,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472021395] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:26:39,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:26:39,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:26:39,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798718500] [2025-01-09 14:26:39,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:26:39,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:26:39,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:26:39,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:26:39,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:26:39,321 INFO L87 Difference]: Start difference. First operand 411 states and 595 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-01-09 14:26:39,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:26:39,390 INFO L93 Difference]: Finished difference Result 682 states and 994 transitions. [2025-01-09 14:26:39,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:26:39,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 374 [2025-01-09 14:26:39,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:26:39,395 INFO L225 Difference]: With dead ends: 682 [2025-01-09 14:26:39,396 INFO L226 Difference]: Without dead ends: 411 [2025-01-09 14:26:39,397 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-01-09 14:26:39,397 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 0 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:26:39,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 540 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:26:39,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2025-01-09 14:26:39,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2025-01-09 14:26:39,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 277 states have (on average 1.296028880866426) internal successors, (359), 278 states have internal predecessors, (359), 117 states have call successors, (117), 16 states have call predecessors, (117), 16 states have return successors, (117), 116 states have call predecessors, (117), 117 states have call successors, (117) [2025-01-09 14:26:39,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 593 transitions. [2025-01-09 14:26:39,450 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 593 transitions. Word has length 374 [2025-01-09 14:26:39,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:26:39,451 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 593 transitions. [2025-01-09 14:26:39,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-01-09 14:26:39,451 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 593 transitions. [2025-01-09 14:26:39,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2025-01-09 14:26:39,454 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:39,454 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:26:39,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 14:26:39,454 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:39,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:39,455 INFO L85 PathProgramCache]: Analyzing trace with hash -66347264, now seen corresponding path program 1 times [2025-01-09 14:26:39,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:39,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117448676] [2025-01-09 14:26:39,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:39,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:39,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-01-09 14:26:39,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-01-09 14:26:39,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:39,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:41,048 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 15 proven. 150 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-01-09 14:26:41,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:41,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117448676] [2025-01-09 14:26:41,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117448676] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:26:41,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200627608] [2025-01-09 14:26:41,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:41,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:26:41,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:26:41,052 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-01-09 14:26:41,055 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-01-09 14:26:41,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-01-09 14:26:41,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-01-09 14:26:41,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:41,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:41,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 864 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-09 14:26:41,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:26:43,644 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 3283 proven. 357 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2025-01-09 14:26:43,644 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:26:44,555 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 72 proven. 255 refuted. 0 times theorem prover too weak. 5833 trivial. 0 not checked. [2025-01-09 14:26:44,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200627608] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:26:44,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:26:44,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 17, 12] total 32 [2025-01-09 14:26:44,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230233856] [2025-01-09 14:26:44,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:26:44,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-01-09 14:26:44,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:26:44,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-01-09 14:26:44,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=796, Unknown=0, NotChecked=0, Total=992 [2025-01-09 14:26:44,560 INFO L87 Difference]: Start difference. First operand 411 states and 593 transitions. Second operand has 32 states, 32 states have (on average 7.53125) internal successors, (241), 32 states have internal predecessors, (241), 7 states have call successors, (160), 4 states have call predecessors, (160), 9 states have return successors, (162), 7 states have call predecessors, (162), 7 states have call successors, (162) [2025-01-09 14:26:49,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:26:49,248 INFO L93 Difference]: Finished difference Result 1066 states and 1481 transitions. [2025-01-09 14:26:49,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2025-01-09 14:26:49,249 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 7.53125) internal successors, (241), 32 states have internal predecessors, (241), 7 states have call successors, (160), 4 states have call predecessors, (160), 9 states have return successors, (162), 7 states have call predecessors, (162), 7 states have call successors, (162) Word has length 374 [2025-01-09 14:26:49,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:26:49,255 INFO L225 Difference]: With dead ends: 1066 [2025-01-09 14:26:49,255 INFO L226 Difference]: Without dead ends: 795 [2025-01-09 14:26:49,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 840 GetRequests, 739 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3062 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2197, Invalid=8309, Unknown=0, NotChecked=0, Total=10506 [2025-01-09 14:26:49,261 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 2359 mSDsluCounter, 2621 mSDsCounter, 0 mSdLazyCounter, 3336 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2359 SdHoareTripleChecker+Valid, 2896 SdHoareTripleChecker+Invalid, 3750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 3336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:26:49,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2359 Valid, 2896 Invalid, 3750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 3336 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-09 14:26:49,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2025-01-09 14:26:49,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 509. [2025-01-09 14:26:49,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 341 states have (on average 1.2316715542521994) internal successors, (420), 342 states have internal predecessors, (420), 133 states have call successors, (133), 34 states have call predecessors, (133), 34 states have return successors, (133), 132 states have call predecessors, (133), 133 states have call successors, (133) [2025-01-09 14:26:49,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 686 transitions. [2025-01-09 14:26:49,334 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 686 transitions. Word has length 374 [2025-01-09 14:26:49,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:26:49,335 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 686 transitions. [2025-01-09 14:26:49,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 7.53125) internal successors, (241), 32 states have internal predecessors, (241), 7 states have call successors, (160), 4 states have call predecessors, (160), 9 states have return successors, (162), 7 states have call predecessors, (162), 7 states have call successors, (162) [2025-01-09 14:26:49,336 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 686 transitions. [2025-01-09 14:26:49,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2025-01-09 14:26:49,338 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:49,338 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:26:49,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 14:26:49,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:26:49,542 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:49,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:49,543 INFO L85 PathProgramCache]: Analyzing trace with hash 18324604, now seen corresponding path program 1 times [2025-01-09 14:26:49,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:49,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549240600] [2025-01-09 14:26:49,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:49,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:49,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-01-09 14:26:49,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-01-09 14:26:49,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:49,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:49,855 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-01-09 14:26:49,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:49,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549240600] [2025-01-09 14:26:49,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549240600] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:26:49,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:26:49,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:26:49,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972175098] [2025-01-09 14:26:49,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:26:49,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:26:49,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:26:49,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:26:49,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:26:49,858 INFO L87 Difference]: Start difference. First operand 509 states and 686 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-01-09 14:26:50,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:26:50,204 INFO L93 Difference]: Finished difference Result 1012 states and 1391 transitions. [2025-01-09 14:26:50,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:26:50,205 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 374 [2025-01-09 14:26:50,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:26:50,210 INFO L225 Difference]: With dead ends: 1012 [2025-01-09 14:26:50,210 INFO L226 Difference]: Without dead ends: 663 [2025-01-09 14:26:50,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:26:50,212 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 234 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:26:50,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 972 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:26:50,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2025-01-09 14:26:50,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 541. [2025-01-09 14:26:50,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 373 states have (on average 1.257372654155496) internal successors, (469), 374 states have internal predecessors, (469), 133 states have call successors, (133), 34 states have call predecessors, (133), 34 states have return successors, (133), 132 states have call predecessors, (133), 133 states have call successors, (133) [2025-01-09 14:26:50,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 735 transitions. [2025-01-09 14:26:50,282 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 735 transitions. Word has length 374 [2025-01-09 14:26:50,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:26:50,284 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 735 transitions. [2025-01-09 14:26:50,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-01-09 14:26:50,285 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 735 transitions. [2025-01-09 14:26:50,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2025-01-09 14:26:50,287 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:50,287 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:26:50,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 14:26:50,288 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:50,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:50,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1298691827, now seen corresponding path program 1 times [2025-01-09 14:26:50,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:50,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451558741] [2025-01-09 14:26:50,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:50,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:50,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-01-09 14:26:50,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-01-09 14:26:50,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:50,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:51,227 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 15 proven. 150 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-01-09 14:26:51,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:51,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451558741] [2025-01-09 14:26:51,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451558741] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:26:51,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879191550] [2025-01-09 14:26:51,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:51,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:26:51,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:26:51,231 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:26:51,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 14:26:51,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-01-09 14:26:51,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-01-09 14:26:51,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:51,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:51,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 863 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-01-09 14:26:51,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:26:56,755 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 2460 proven. 624 refuted. 0 times theorem prover too weak. 3076 trivial. 0 not checked. [2025-01-09 14:26:56,755 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:27:01,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879191550] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:27:01,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 14:27:01,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 19] total 24 [2025-01-09 14:27:01,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27683982] [2025-01-09 14:27:01,789 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 14:27:01,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-09 14:27:01,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:27:01,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-09 14:27:01,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=857, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 14:27:01,791 INFO L87 Difference]: Start difference. First operand 541 states and 735 transitions. Second operand has 24 states, 24 states have (on average 8.166666666666666) internal successors, (196), 22 states have internal predecessors, (196), 8 states have call successors, (112), 7 states have call predecessors, (112), 11 states have return successors, (112), 8 states have call predecessors, (112), 8 states have call successors, (112) [2025-01-09 14:27:04,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:27:04,172 INFO L93 Difference]: Finished difference Result 1348 states and 1803 transitions. [2025-01-09 14:27:04,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-01-09 14:27:04,173 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 8.166666666666666) internal successors, (196), 22 states have internal predecessors, (196), 8 states have call successors, (112), 7 states have call predecessors, (112), 11 states have return successors, (112), 8 states have call predecessors, (112), 8 states have call successors, (112) Word has length 375 [2025-01-09 14:27:04,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:27:04,184 INFO L225 Difference]: With dead ends: 1348 [2025-01-09 14:27:04,184 INFO L226 Difference]: Without dead ends: 999 [2025-01-09 14:27:04,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 690 GetRequests, 635 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=647, Invalid=2545, Unknown=0, NotChecked=0, Total=3192 [2025-01-09 14:27:04,191 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 571 mSDsluCounter, 1348 mSDsCounter, 0 mSdLazyCounter, 1284 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 1542 SdHoareTripleChecker+Invalid, 1382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:27:04,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 1542 Invalid, 1382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1284 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 14:27:04,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2025-01-09 14:27:04,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 959. [2025-01-09 14:27:04,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 959 states, 684 states have (on average 1.2646198830409356) internal successors, (865), 686 states have internal predecessors, (865), 210 states have call successors, (210), 64 states have call predecessors, (210), 64 states have return successors, (210), 208 states have call predecessors, (210), 210 states have call successors, (210) [2025-01-09 14:27:04,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1285 transitions. [2025-01-09 14:27:04,332 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1285 transitions. Word has length 375 [2025-01-09 14:27:04,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:27:04,332 INFO L471 AbstractCegarLoop]: Abstraction has 959 states and 1285 transitions. [2025-01-09 14:27:04,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 8.166666666666666) internal successors, (196), 22 states have internal predecessors, (196), 8 states have call successors, (112), 7 states have call predecessors, (112), 11 states have return successors, (112), 8 states have call predecessors, (112), 8 states have call successors, (112) [2025-01-09 14:27:04,333 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1285 transitions. [2025-01-09 14:27:04,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2025-01-09 14:27:04,336 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:27:04,336 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:27:04,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 14:27:04,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-09 14:27:04,540 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:27:04,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:27:04,541 INFO L85 PathProgramCache]: Analyzing trace with hash 221407090, now seen corresponding path program 1 times [2025-01-09 14:27:04,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:27:04,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298427252] [2025-01-09 14:27:04,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:27:04,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:27:04,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-01-09 14:27:04,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-01-09 14:27:04,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:27:04,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:27:04,696 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-01-09 14:27:04,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:27:04,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298427252] [2025-01-09 14:27:04,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298427252] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:27:04,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:27:04,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:27:04,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050967093] [2025-01-09 14:27:04,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:27:04,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:27:04,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:27:04,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:27:04,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:27:04,700 INFO L87 Difference]: Start difference. First operand 959 states and 1285 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-01-09 14:27:04,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:27:04,987 INFO L93 Difference]: Finished difference Result 2486 states and 3333 transitions. [2025-01-09 14:27:04,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:27:04,988 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 375 [2025-01-09 14:27:04,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:27:05,001 INFO L225 Difference]: With dead ends: 2486 [2025-01-09 14:27:05,002 INFO L226 Difference]: Without dead ends: 1734 [2025-01-09 14:27:05,005 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-01-09 14:27:05,006 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 236 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:27:05,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 518 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:27:05,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2025-01-09 14:27:05,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1176. [2025-01-09 14:27:05,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1176 states, 901 states have (on average 1.3085460599334073) internal successors, (1179), 903 states have internal predecessors, (1179), 210 states have call successors, (210), 64 states have call predecessors, (210), 64 states have return successors, (210), 208 states have call predecessors, (210), 210 states have call successors, (210) [2025-01-09 14:27:05,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1599 transitions. [2025-01-09 14:27:05,179 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1599 transitions. Word has length 375 [2025-01-09 14:27:05,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:27:05,180 INFO L471 AbstractCegarLoop]: Abstraction has 1176 states and 1599 transitions. [2025-01-09 14:27:05,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-01-09 14:27:05,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1599 transitions. [2025-01-09 14:27:05,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2025-01-09 14:27:05,183 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:27:05,184 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:27:05,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 14:27:05,184 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:27:05,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:27:05,184 INFO L85 PathProgramCache]: Analyzing trace with hash -288066000, now seen corresponding path program 1 times [2025-01-09 14:27:05,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:27:05,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575577992] [2025-01-09 14:27:05,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:27:05,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:27:05,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-01-09 14:27:05,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-01-09 14:27:05,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:27:05,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 14:27:05,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [314921328] [2025-01-09 14:27:05,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:27:05,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:27:05,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:27:05,754 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:27:05,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 14:27:05,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-01-09 14:27:06,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-01-09 14:27:06,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:27:06,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:27:06,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 863 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-09 14:27:06,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:27:07,826 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 3963 proven. 270 refuted. 0 times theorem prover too weak. 1927 trivial. 0 not checked. [2025-01-09 14:27:07,826 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:27:08,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:27:08,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575577992] [2025-01-09 14:27:08,110 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 14:27:08,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314921328] [2025-01-09 14:27:08,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314921328] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:27:08,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:27:08,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2025-01-09 14:27:08,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628546986] [2025-01-09 14:27:08,111 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-09 14:27:08,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 14:27:08,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:27:08,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 14:27:08,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-01-09 14:27:08,112 INFO L87 Difference]: Start difference. First operand 1176 states and 1599 transitions. Second operand has 13 states, 13 states have (on average 8.692307692307692) internal successors, (113), 11 states have internal predecessors, (113), 4 states have call successors, (56), 4 states have call predecessors, (56), 6 states have return successors, (56), 4 states have call predecessors, (56), 4 states have call successors, (56) [2025-01-09 14:27:09,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:27:09,019 INFO L93 Difference]: Finished difference Result 2408 states and 3288 transitions. [2025-01-09 14:27:09,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 14:27:09,021 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.692307692307692) internal successors, (113), 11 states have internal predecessors, (113), 4 states have call successors, (56), 4 states have call predecessors, (56), 6 states have return successors, (56), 4 states have call predecessors, (56), 4 states have call successors, (56) Word has length 375 [2025-01-09 14:27:09,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:27:09,029 INFO L225 Difference]: With dead ends: 2408 [2025-01-09 14:27:09,030 INFO L226 Difference]: Without dead ends: 1408 [2025-01-09 14:27:09,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 497 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=249, Invalid=563, Unknown=0, NotChecked=0, Total=812 [2025-01-09 14:27:09,034 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 623 mSDsluCounter, 1527 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 1732 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:27:09,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 1732 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 14:27:09,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2025-01-09 14:27:09,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1186. [2025-01-09 14:27:09,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1186 states, 909 states have (on average 1.2992299229922992) internal successors, (1181), 911 states have internal predecessors, (1181), 210 states have call successors, (210), 66 states have call predecessors, (210), 66 states have return successors, (210), 208 states have call predecessors, (210), 210 states have call successors, (210) [2025-01-09 14:27:09,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1601 transitions. [2025-01-09 14:27:09,176 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1601 transitions. Word has length 375 [2025-01-09 14:27:09,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:27:09,177 INFO L471 AbstractCegarLoop]: Abstraction has 1186 states and 1601 transitions. [2025-01-09 14:27:09,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.692307692307692) internal successors, (113), 11 states have internal predecessors, (113), 4 states have call successors, (56), 4 states have call predecessors, (56), 6 states have return successors, (56), 4 states have call predecessors, (56), 4 states have call successors, (56) [2025-01-09 14:27:09,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1601 transitions. [2025-01-09 14:27:09,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2025-01-09 14:27:09,180 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:27:09,181 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:27:09,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 14:27:09,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-09 14:27:09,382 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:27:09,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:27:09,383 INFO L85 PathProgramCache]: Analyzing trace with hash -769146258, now seen corresponding path program 1 times [2025-01-09 14:27:09,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:27:09,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643288081] [2025-01-09 14:27:09,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:27:09,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:27:09,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-01-09 14:27:09,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-01-09 14:27:09,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:27:09,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 14:27:09,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [960440955] [2025-01-09 14:27:09,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:27:09,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:27:09,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:27:09,907 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:27:09,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 14:27:10,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-01-09 14:27:10,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-01-09 14:27:10,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:27:10,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:27:10,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 863 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 14:27:10,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:27:10,641 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 2427 proven. 165 refuted. 0 times theorem prover too weak. 3568 trivial. 0 not checked. [2025-01-09 14:27:10,642 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:27:15,156 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_~var_1_58~0 65536))) (let ((.cse2 (+ .cse1 1)) (.cse0 (mod c_~var_1_7~0 4294967296))) (and (or (and (<= (mod (div .cse0 .cse1) 4294967296) 0) (forall ((v_z_86 Int)) (or (< 255 v_z_86) (< v_z_86 .cse2) (< (div .cse0 v_z_86) 1)))) (< 4294967294 .cse0)) (forall ((v_z_80 Int)) (or (< (mod (div v_z_80 .cse1) 4294967296) 1) (< v_z_80 0) (< .cse0 v_z_80))) (forall ((v_z_81 Int) (v_z_80 Int)) (or (< v_z_81 .cse2) (< .cse0 v_z_80) (< 255 v_z_81) (< (div v_z_80 v_z_81) 1)))))) is different from false [2025-01-09 14:27:21,512 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~var_1_58~0 65536))) (let ((.cse1 (+ .cse0 1)) (.cse2 (mod c_~var_1_75~0 256))) (and (or (and (<= (mod (div 5 .cse0) 4294967296) 0) (forall ((v_z_80 Int)) (or (< 5 v_z_80) (< (mod (div v_z_80 .cse0) 4294967296) 1) (< v_z_80 0))) (forall ((v_z_86 Int)) (or (< v_z_86 .cse1) (< (div 5 v_z_86) 1))) (forall ((v_z_81 Int) (v_z_80 Int)) (or (< 5 v_z_80) (< v_z_81 .cse1) (< (div v_z_80 v_z_81) 1)))) (< .cse2 6)) (or (< 5 .cse2) (and (forall ((v_z_81 Int) (v_z_80 Int)) (or (< v_z_81 .cse1) (< (div v_z_80 v_z_81) 1) (< .cse2 v_z_80))) (forall ((v_z_80 Int)) (or (< (mod (div v_z_80 .cse0) 4294967296) 1) (< v_z_80 0) (< .cse2 v_z_80))) (forall ((v_z_86 Int)) (or (< v_z_86 .cse1) (< (div .cse2 v_z_86) 1))) (<= (mod (div .cse2 .cse0) 4294967296) 0)))))) is different from false [2025-01-09 14:27:33,157 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 123 proven. 42 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-01-09 14:27:33,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:27:33,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643288081] [2025-01-09 14:27:33,157 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 14:27:33,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960440955] [2025-01-09 14:27:33,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960440955] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:27:33,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 14:27:33,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2025-01-09 14:27:33,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558616682] [2025-01-09 14:27:33,157 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 14:27:33,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 14:27:33,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:27:33,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 14:27:33,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=95, Unknown=2, NotChecked=42, Total=182 [2025-01-09 14:27:33,160 INFO L87 Difference]: Start difference. First operand 1186 states and 1601 transitions. Second operand has 14 states, 14 states have (on average 11.357142857142858) internal successors, (159), 14 states have internal predecessors, (159), 3 states have call successors, (70), 2 states have call predecessors, (70), 4 states have return successors, (72), 3 states have call predecessors, (72), 3 states have call successors, (72)