./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-68.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_loopvsstraightlinecode_100-1loop_file-68.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 7af22c4985483bd6c8caf866cf1f41c10246f5959d956f77eec260fff7ae1f47 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:56:58,913 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:56:58,949 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 12:56:58,952 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:56:58,953 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:56:58,967 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:56:58,967 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:56:58,967 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:56:58,968 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:56:58,968 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:56:58,968 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:56:58,968 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:56:58,968 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:56:58,968 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:56:58,968 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:56:58,969 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:56:58,969 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:56:58,969 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:56:58,969 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 12:56:58,969 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:56:58,969 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:56:58,969 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:56:58,969 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:56:58,969 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:56:58,969 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:56:58,969 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:56:58,970 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:56:58,970 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:56:58,970 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:56:58,970 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:56:58,970 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:56:58,970 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:56:58,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:56:58,970 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:56:58,970 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:56:58,970 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:56:58,970 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:56:58,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:56:58,971 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:56:58,971 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:56:58,971 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:56:58,971 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:56:58,971 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 12:56:58,971 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 12:56:58,971 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:56:58,971 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:56:58,971 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:56:58,971 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:56:58,971 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 -> 7af22c4985483bd6c8caf866cf1f41c10246f5959d956f77eec260fff7ae1f47 [2025-01-09 12:56:59,165 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:56:59,174 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:56:59,175 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:56:59,177 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:56:59,178 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:56:59,179 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-68.i [2025-01-09 12:57:00,475 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/682d5e994/929b5033307f4fc58029c07957d14701/FLAG87e5c33ea [2025-01-09 12:57:00,813 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:57:00,814 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-68.i [2025-01-09 12:57:00,824 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/682d5e994/929b5033307f4fc58029c07957d14701/FLAG87e5c33ea [2025-01-09 12:57:00,839 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/682d5e994/929b5033307f4fc58029c07957d14701 [2025-01-09 12:57:00,841 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:57:00,842 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:57:00,844 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:57:00,846 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:57:00,849 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:57:00,850 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:57:00" (1/1) ... [2025-01-09 12:57:00,851 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14f831f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:57:00, skipping insertion in model container [2025-01-09 12:57:00,851 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:57:00" (1/1) ... [2025-01-09 12:57:00,870 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:57:00,977 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_loopvsstraightlinecode_100-1loop_file-68.i[916,929] [2025-01-09 12:57:01,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:57:01,073 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:57:01,085 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_loopvsstraightlinecode_100-1loop_file-68.i[916,929] [2025-01-09 12:57:01,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:57:01,135 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:57:01,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:57:01 WrapperNode [2025-01-09 12:57:01,137 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:57:01,139 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:57:01,139 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:57:01,140 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:57:01,147 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:57:01" (1/1) ... [2025-01-09 12:57:01,166 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:57:01" (1/1) ... [2025-01-09 12:57:01,218 INFO L138 Inliner]: procedures = 26, calls = 53, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 392 [2025-01-09 12:57:01,219 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:57:01,219 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:57:01,219 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:57:01,219 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:57:01,226 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:57:01" (1/1) ... [2025-01-09 12:57:01,226 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:57:01" (1/1) ... [2025-01-09 12:57:01,230 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:57:01" (1/1) ... [2025-01-09 12:57:01,245 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 12:57:01,245 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:57:01" (1/1) ... [2025-01-09 12:57:01,246 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:57:01" (1/1) ... [2025-01-09 12:57:01,270 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:57:01" (1/1) ... [2025-01-09 12:57:01,273 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:57:01" (1/1) ... [2025-01-09 12:57:01,279 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:57:01" (1/1) ... [2025-01-09 12:57:01,283 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:57:01" (1/1) ... [2025-01-09 12:57:01,286 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:57:01" (1/1) ... [2025-01-09 12:57:01,291 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:57:01,292 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:57:01,293 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:57:01,294 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:57:01,295 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:57:01" (1/1) ... [2025-01-09 12:57:01,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:57:01,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:57:01,331 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 12:57:01,333 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 12:57:01,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:57:01,348 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:57:01,348 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:57:01,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 12:57:01,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:57:01,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:57:01,406 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:57:01,407 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:57:01,904 INFO L? ?]: Removed 49 outVars from TransFormulas that were not future-live. [2025-01-09 12:57:01,906 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:57:01,917 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:57:01,918 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 12:57:01,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:57:01 BoogieIcfgContainer [2025-01-09 12:57:01,919 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:57:01,921 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:57:01,921 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:57:01,924 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:57:01,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:57:00" (1/3) ... [2025-01-09 12:57:01,926 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b890292 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:57:01, skipping insertion in model container [2025-01-09 12:57:01,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:57:01" (2/3) ... [2025-01-09 12:57:01,926 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b890292 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:57:01, skipping insertion in model container [2025-01-09 12:57:01,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:57:01" (3/3) ... [2025-01-09 12:57:01,928 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-68.i [2025-01-09 12:57:01,938 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:57:01,939 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-68.i that has 2 procedures, 162 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:57:02,010 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:57:02,021 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;@65ddf07b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:57:02,021 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:57:02,024 INFO L276 IsEmpty]: Start isEmpty. Operand has 162 states, 119 states have (on average 1.453781512605042) internal successors, (173), 120 states have internal predecessors, (173), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 12:57:02,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2025-01-09 12:57:02,061 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:57:02,062 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:57:02,062 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:57:02,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:57:02,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1090912047, now seen corresponding path program 1 times [2025-01-09 12:57:02,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:57:02,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040301889] [2025-01-09 12:57:02,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:57:02,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:57:02,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-01-09 12:57:02,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-01-09 12:57:02,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:57:02,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:57:02,426 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 3042 trivial. 0 not checked. [2025-01-09 12:57:02,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:57:02,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040301889] [2025-01-09 12:57:02,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040301889] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:57:02,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778087291] [2025-01-09 12:57:02,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:57:02,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:57:02,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:57:02,441 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 12:57:02,444 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 12:57:02,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-01-09 12:57:02,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-01-09 12:57:02,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:57:02,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:57:02,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:57:02,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:57:02,636 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 3042 trivial. 0 not checked. [2025-01-09 12:57:02,642 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:57:02,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778087291] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:57:02,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:57:02,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 12:57:02,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608344105] [2025-01-09 12:57:02,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:57:02,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:57:02,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:57:02,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:57:02,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:57:02,674 INFO L87 Difference]: Start difference. First operand has 162 states, 119 states have (on average 1.453781512605042) internal successors, (173), 120 states have internal predecessors, (173), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 2 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) [2025-01-09 12:57:02,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:57:02,698 INFO L93 Difference]: Finished difference Result 321 states and 543 transitions. [2025-01-09 12:57:02,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:57:02,700 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 2 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) Word has length 269 [2025-01-09 12:57:02,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:57:02,705 INFO L225 Difference]: With dead ends: 321 [2025-01-09 12:57:02,705 INFO L226 Difference]: Without dead ends: 159 [2025-01-09 12:57:02,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 270 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 12:57:02,710 INFO L435 NwaCegarLoop]: 251 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, 251 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 12:57:02,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:57:02,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-01-09 12:57:02,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2025-01-09 12:57:02,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 117 states have (on average 1.435897435897436) internal successors, (168), 117 states have internal predecessors, (168), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 12:57:02,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 248 transitions. [2025-01-09 12:57:02,745 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 248 transitions. Word has length 269 [2025-01-09 12:57:02,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:57:02,745 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 248 transitions. [2025-01-09 12:57:02,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 2 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) [2025-01-09 12:57:02,746 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 248 transitions. [2025-01-09 12:57:02,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2025-01-09 12:57:02,749 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:57:02,749 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:57:02,757 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 12:57:02,953 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 12:57:02,953 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:57:02,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:57:02,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1156814835, now seen corresponding path program 1 times [2025-01-09 12:57:02,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:57:02,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221850551] [2025-01-09 12:57:02,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:57:02,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:57:03,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-01-09 12:57:03,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-01-09 12:57:03,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:57:03,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:57:03,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-01-09 12:57:03,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:57:03,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221850551] [2025-01-09 12:57:03,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221850551] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:57:03,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:57:03,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:57:03,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881248725] [2025-01-09 12:57:03,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:57:03,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:57:03,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:57:03,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:57:03,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:57:03,361 INFO L87 Difference]: Start difference. First operand 159 states and 248 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-01-09 12:57:03,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:57:03,384 INFO L93 Difference]: Finished difference Result 315 states and 493 transitions. [2025-01-09 12:57:03,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:57:03,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 269 [2025-01-09 12:57:03,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:57:03,387 INFO L225 Difference]: With dead ends: 315 [2025-01-09 12:57:03,387 INFO L226 Difference]: Without dead ends: 159 [2025-01-09 12:57:03,388 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 12:57:03,388 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 0 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:57:03,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 489 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:57:03,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-01-09 12:57:03,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2025-01-09 12:57:03,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 117 states have (on average 1.4273504273504274) internal successors, (167), 117 states have internal predecessors, (167), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 12:57:03,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 247 transitions. [2025-01-09 12:57:03,400 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 247 transitions. Word has length 269 [2025-01-09 12:57:03,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:57:03,401 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 247 transitions. [2025-01-09 12:57:03,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-01-09 12:57:03,401 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 247 transitions. [2025-01-09 12:57:03,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2025-01-09 12:57:03,404 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:57:03,404 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:57:03,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 12:57:03,404 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:57:03,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:57:03,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1551181621, now seen corresponding path program 1 times [2025-01-09 12:57:03,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:57:03,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073166030] [2025-01-09 12:57:03,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:57:03,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:57:03,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-01-09 12:57:03,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-01-09 12:57:03,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:57:03,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:57:04,115 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-01-09 12:57:04,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:57:04,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073166030] [2025-01-09 12:57:04,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073166030] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:57:04,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:57:04,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 12:57:04,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256584458] [2025-01-09 12:57:04,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:57:04,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 12:57:04,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:57:04,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 12:57:04,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:57:04,119 INFO L87 Difference]: Start difference. First operand 159 states and 247 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-01-09 12:57:04,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:57:04,318 INFO L93 Difference]: Finished difference Result 316 states and 493 transitions. [2025-01-09 12:57:04,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 12:57:04,321 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 269 [2025-01-09 12:57:04,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:57:04,324 INFO L225 Difference]: With dead ends: 316 [2025-01-09 12:57:04,327 INFO L226 Difference]: Without dead ends: 160 [2025-01-09 12:57:04,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 12:57:04,329 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 174 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:57:04,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 383 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:57:04,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-01-09 12:57:04,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2025-01-09 12:57:04,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 118 states have (on average 1.423728813559322) internal successors, (168), 118 states have internal predecessors, (168), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 12:57:04,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 248 transitions. [2025-01-09 12:57:04,350 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 248 transitions. Word has length 269 [2025-01-09 12:57:04,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:57:04,351 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 248 transitions. [2025-01-09 12:57:04,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-01-09 12:57:04,352 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 248 transitions. [2025-01-09 12:57:04,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2025-01-09 12:57:04,357 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:57:04,357 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:57:04,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 12:57:04,358 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:57:04,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:57:04,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1041708531, now seen corresponding path program 1 times [2025-01-09 12:57:04,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:57:04,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940145144] [2025-01-09 12:57:04,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:57:04,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:57:04,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-01-09 12:57:04,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-01-09 12:57:04,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:57:04,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:57:04,852 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 9 proven. 108 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-01-09 12:57:04,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:57:04,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940145144] [2025-01-09 12:57:04,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940145144] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:57:04,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280033512] [2025-01-09 12:57:04,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:57:04,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:57:04,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:57:04,862 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 12:57:04,863 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 12:57:04,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-01-09 12:57:05,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-01-09 12:57:05,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:57:05,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:57:05,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 12:57:05,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:57:05,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1509 proven. 72 refuted. 0 times theorem prover too weak. 1539 trivial. 0 not checked. [2025-01-09 12:57:05,421 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:57:05,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 45 proven. 72 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-01-09 12:57:05,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280033512] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 12:57:05,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 12:57:05,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 13 [2025-01-09 12:57:05,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002161604] [2025-01-09 12:57:05,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 12:57:05,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 12:57:05,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:57:05,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 12:57:05,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-01-09 12:57:05,783 INFO L87 Difference]: Start difference. First operand 160 states and 248 transitions. Second operand has 13 states, 13 states have (on average 10.0) internal successors, (130), 13 states have internal predecessors, (130), 4 states have call successors, (100), 2 states have call predecessors, (100), 4 states have return successors, (102), 4 states have call predecessors, (102), 4 states have call successors, (102) [2025-01-09 12:57:06,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:57:06,640 INFO L93 Difference]: Finished difference Result 443 states and 674 transitions. [2025-01-09 12:57:06,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 12:57:06,641 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 10.0) internal successors, (130), 13 states have internal predecessors, (130), 4 states have call successors, (100), 2 states have call predecessors, (100), 4 states have return successors, (102), 4 states have call predecessors, (102), 4 states have call successors, (102) Word has length 269 [2025-01-09 12:57:06,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:57:06,643 INFO L225 Difference]: With dead ends: 443 [2025-01-09 12:57:06,643 INFO L226 Difference]: Without dead ends: 286 [2025-01-09 12:57:06,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 532 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=219, Invalid=537, Unknown=0, NotChecked=0, Total=756 [2025-01-09 12:57:06,645 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 426 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 1042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 12:57:06,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 1008 Invalid, 1042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 12:57:06,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-01-09 12:57:06,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 279. [2025-01-09 12:57:06,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 220 states have (on average 1.3590909090909091) internal successors, (299), 221 states have internal predecessors, (299), 53 states have call successors, (53), 5 states have call predecessors, (53), 5 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2025-01-09 12:57:06,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 405 transitions. [2025-01-09 12:57:06,667 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 405 transitions. Word has length 269 [2025-01-09 12:57:06,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:57:06,667 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 405 transitions. [2025-01-09 12:57:06,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.0) internal successors, (130), 13 states have internal predecessors, (130), 4 states have call successors, (100), 2 states have call predecessors, (100), 4 states have return successors, (102), 4 states have call predecessors, (102), 4 states have call successors, (102) [2025-01-09 12:57:06,668 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 405 transitions. [2025-01-09 12:57:06,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-01-09 12:57:06,670 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:57:06,671 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:57:06,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 12:57:06,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:57:06,872 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:57:06,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:57:06,872 INFO L85 PathProgramCache]: Analyzing trace with hash -502303808, now seen corresponding path program 1 times [2025-01-09 12:57:06,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:57:06,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276827377] [2025-01-09 12:57:06,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:57:06,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:57:06,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-01-09 12:57:06,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-01-09 12:57:06,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:57:06,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:57:07,122 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-01-09 12:57:07,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:57:07,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276827377] [2025-01-09 12:57:07,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276827377] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:57:07,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:57:07,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:57:07,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184833772] [2025-01-09 12:57:07,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:57:07,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:57:07,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:57:07,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:57:07,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:57:07,126 INFO L87 Difference]: Start difference. First operand 279 states and 405 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-01-09 12:57:07,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:57:07,208 INFO L93 Difference]: Finished difference Result 830 states and 1208 transitions. [2025-01-09 12:57:07,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:57:07,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 270 [2025-01-09 12:57:07,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:57:07,214 INFO L225 Difference]: With dead ends: 830 [2025-01-09 12:57:07,214 INFO L226 Difference]: Without dead ends: 554 [2025-01-09 12:57:07,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:57:07,216 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 156 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:57:07,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 548 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:57:07,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-01-09 12:57:07,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 552. [2025-01-09 12:57:07,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 435 states have (on average 1.354022988505747) internal successors, (589), 437 states have internal predecessors, (589), 106 states have call successors, (106), 10 states have call predecessors, (106), 10 states have return successors, (106), 104 states have call predecessors, (106), 106 states have call successors, (106) [2025-01-09 12:57:07,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 801 transitions. [2025-01-09 12:57:07,271 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 801 transitions. Word has length 270 [2025-01-09 12:57:07,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:57:07,272 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 801 transitions. [2025-01-09 12:57:07,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-01-09 12:57:07,272 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 801 transitions. [2025-01-09 12:57:07,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-01-09 12:57:07,274 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:57:07,274 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:57:07,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 12:57:07,275 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:57:07,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:57:07,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1539807863, now seen corresponding path program 1 times [2025-01-09 12:57:07,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:57:07,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387635908] [2025-01-09 12:57:07,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:57:07,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:57:07,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-01-09 12:57:07,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-01-09 12:57:07,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:57:07,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:57:11,137 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-01-09 12:57:11,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:57:11,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387635908] [2025-01-09 12:57:11,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387635908] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:57:11,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:57:11,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 12:57:11,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596874055] [2025-01-09 12:57:11,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:57:11,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 12:57:11,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:57:11,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 12:57:11,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-01-09 12:57:11,140 INFO L87 Difference]: Start difference. First operand 552 states and 801 transitions. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-01-09 12:57:12,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:57:12,329 INFO L93 Difference]: Finished difference Result 1961 states and 2790 transitions. [2025-01-09 12:57:12,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 12:57:12,330 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 271 [2025-01-09 12:57:12,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:57:12,336 INFO L225 Difference]: With dead ends: 1961 [2025-01-09 12:57:12,336 INFO L226 Difference]: Without dead ends: 1412 [2025-01-09 12:57:12,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2025-01-09 12:57:12,339 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 864 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 864 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 12:57:12,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [864 Valid, 612 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 12:57:12,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2025-01-09 12:57:12,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 1050. [2025-01-09 12:57:12,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1050 states, 917 states have (on average 1.3925845147219194) internal successors, (1277), 923 states have internal predecessors, (1277), 118 states have call successors, (118), 14 states have call predecessors, (118), 14 states have return successors, (118), 112 states have call predecessors, (118), 118 states have call successors, (118) [2025-01-09 12:57:12,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 1513 transitions. [2025-01-09 12:57:12,435 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 1513 transitions. Word has length 271 [2025-01-09 12:57:12,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:57:12,436 INFO L471 AbstractCegarLoop]: Abstraction has 1050 states and 1513 transitions. [2025-01-09 12:57:12,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-01-09 12:57:12,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1513 transitions. [2025-01-09 12:57:12,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-01-09 12:57:12,441 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:57:12,441 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:57:12,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 12:57:12,442 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:57:12,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:57:12,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1475295755, now seen corresponding path program 1 times [2025-01-09 12:57:12,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:57:12,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524020093] [2025-01-09 12:57:12,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:57:12,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:57:12,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-01-09 12:57:12,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-01-09 12:57:12,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:57:12,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:57:12,986 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 90 proven. 27 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-01-09 12:57:12,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:57:12,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524020093] [2025-01-09 12:57:12,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524020093] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:57:12,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119185779] [2025-01-09 12:57:12,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:57:12,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:57:12,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:57:12,992 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 12:57:12,993 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 12:57:13,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-01-09 12:57:13,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-01-09 12:57:13,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:57:13,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:57:13,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 12:57:13,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:57:13,277 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1327 proven. 33 refuted. 0 times theorem prover too weak. 1760 trivial. 0 not checked. [2025-01-09 12:57:13,278 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:57:13,539 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 84 proven. 33 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-01-09 12:57:13,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1119185779] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 12:57:13,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 12:57:13,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-01-09 12:57:13,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234426993] [2025-01-09 12:57:13,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 12:57:13,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 12:57:13,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:57:13,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 12:57:13,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-01-09 12:57:13,542 INFO L87 Difference]: Start difference. First operand 1050 states and 1513 transitions. Second operand has 15 states, 15 states have (on average 8.6) internal successors, (129), 15 states have internal predecessors, (129), 4 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (64), 4 states have call predecessors, (64), 4 states have call successors, (64) [2025-01-09 12:57:14,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:57:14,937 INFO L93 Difference]: Finished difference Result 3184 states and 4555 transitions. [2025-01-09 12:57:14,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-01-09 12:57:14,938 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 8.6) internal successors, (129), 15 states have internal predecessors, (129), 4 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (64), 4 states have call predecessors, (64), 4 states have call successors, (64) Word has length 271 [2025-01-09 12:57:14,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:57:14,949 INFO L225 Difference]: With dead ends: 3184 [2025-01-09 12:57:14,950 INFO L226 Difference]: Without dead ends: 2137 [2025-01-09 12:57:14,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 580 GetRequests, 542 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=392, Invalid=1168, Unknown=0, NotChecked=0, Total=1560 [2025-01-09 12:57:14,954 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 751 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 1029 mSolverCounterSat, 313 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 1342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 313 IncrementalHoareTripleChecker+Valid, 1029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 12:57:14,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [753 Valid, 772 Invalid, 1342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [313 Valid, 1029 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 12:57:14,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2137 states. [2025-01-09 12:57:15,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2137 to 2113. [2025-01-09 12:57:15,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2113 states, 1858 states have (on average 1.3853606027987082) internal successors, (2574), 1872 states have internal predecessors, (2574), 216 states have call successors, (216), 38 states have call predecessors, (216), 38 states have return successors, (216), 202 states have call predecessors, (216), 216 states have call successors, (216) [2025-01-09 12:57:15,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2113 states to 2113 states and 3006 transitions. [2025-01-09 12:57:15,066 INFO L78 Accepts]: Start accepts. Automaton has 2113 states and 3006 transitions. Word has length 271 [2025-01-09 12:57:15,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:57:15,066 INFO L471 AbstractCegarLoop]: Abstraction has 2113 states and 3006 transitions. [2025-01-09 12:57:15,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 8.6) internal successors, (129), 15 states have internal predecessors, (129), 4 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (64), 4 states have call predecessors, (64), 4 states have call successors, (64) [2025-01-09 12:57:15,067 INFO L276 IsEmpty]: Start isEmpty. Operand 2113 states and 3006 transitions. [2025-01-09 12:57:15,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-01-09 12:57:15,070 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:57:15,070 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:57:15,079 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 12:57:15,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:57:15,271 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:57:15,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:57:15,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1173818046, now seen corresponding path program 1 times [2025-01-09 12:57:15,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:57:15,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162936952] [2025-01-09 12:57:15,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:57:15,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:57:15,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-01-09 12:57:15,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-01-09 12:57:15,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:57:15,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:57:16,852 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-01-09 12:57:16,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:57:16,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162936952] [2025-01-09 12:57:16,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162936952] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:57:16,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:57:16,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 12:57:16,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125253529] [2025-01-09 12:57:16,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:57:16,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 12:57:16,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:57:16,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 12:57:16,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-09 12:57:16,854 INFO L87 Difference]: Start difference. First operand 2113 states and 3006 transitions. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-01-09 12:57:19,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:57:19,622 INFO L93 Difference]: Finished difference Result 6475 states and 9229 transitions. [2025-01-09 12:57:19,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 12:57:19,623 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 272 [2025-01-09 12:57:19,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:57:19,636 INFO L225 Difference]: With dead ends: 6475 [2025-01-09 12:57:19,637 INFO L226 Difference]: Without dead ends: 4269 [2025-01-09 12:57:19,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2025-01-09 12:57:19,641 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 971 mSDsluCounter, 2171 mSDsCounter, 0 mSdLazyCounter, 2022 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 971 SdHoareTripleChecker+Valid, 2613 SdHoareTripleChecker+Invalid, 2208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 2022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-09 12:57:19,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [971 Valid, 2613 Invalid, 2208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 2022 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-09 12:57:19,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4269 states. [2025-01-09 12:57:19,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4269 to 3625. [2025-01-09 12:57:19,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3625 states, 3140 states have (on average 1.373248407643312) internal successors, (4312), 3160 states have internal predecessors, (4312), 408 states have call successors, (408), 76 states have call predecessors, (408), 76 states have return successors, (408), 388 states have call predecessors, (408), 408 states have call successors, (408) [2025-01-09 12:57:19,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3625 states to 3625 states and 5128 transitions. [2025-01-09 12:57:19,806 INFO L78 Accepts]: Start accepts. Automaton has 3625 states and 5128 transitions. Word has length 272 [2025-01-09 12:57:19,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:57:19,806 INFO L471 AbstractCegarLoop]: Abstraction has 3625 states and 5128 transitions. [2025-01-09 12:57:19,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-01-09 12:57:19,807 INFO L276 IsEmpty]: Start isEmpty. Operand 3625 states and 5128 transitions. [2025-01-09 12:57:19,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-01-09 12:57:19,810 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:57:19,810 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:57:19,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 12:57:19,810 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:57:19,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:57:19,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1424322426, now seen corresponding path program 1 times [2025-01-09 12:57:19,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:57:19,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045166660] [2025-01-09 12:57:19,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:57:19,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:57:19,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-01-09 12:57:19,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-01-09 12:57:19,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:57:19,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:57:20,097 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 39 proven. 78 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-01-09 12:57:20,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:57:20,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045166660] [2025-01-09 12:57:20,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045166660] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:57:20,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73847752] [2025-01-09 12:57:20,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:57:20,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:57:20,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:57:20,100 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 12:57:20,105 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 12:57:20,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-01-09 12:57:20,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-01-09 12:57:20,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:57:20,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:57:20,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 12:57:20,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:57:20,747 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1543 proven. 147 refuted. 0 times theorem prover too weak. 1430 trivial. 0 not checked. [2025-01-09 12:57:20,747 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:57:21,095 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 81 proven. 150 refuted. 0 times theorem prover too weak. 2889 trivial. 0 not checked. [2025-01-09 12:57:21,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73847752] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 12:57:21,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 12:57:21,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 16 [2025-01-09 12:57:21,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260794221] [2025-01-09 12:57:21,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 12:57:21,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 12:57:21,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:57:21,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 12:57:21,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2025-01-09 12:57:21,097 INFO L87 Difference]: Start difference. First operand 3625 states and 5128 transitions. Second operand has 16 states, 16 states have (on average 9.3125) internal successors, (149), 16 states have internal predecessors, (149), 7 states have call successors, (106), 3 states have call predecessors, (106), 7 states have return successors, (107), 7 states have call predecessors, (107), 7 states have call successors, (107) [2025-01-09 12:57:21,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:57:21,669 INFO L93 Difference]: Finished difference Result 5791 states and 8101 transitions. [2025-01-09 12:57:21,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 12:57:21,670 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 9.3125) internal successors, (149), 16 states have internal predecessors, (149), 7 states have call successors, (106), 3 states have call predecessors, (106), 7 states have return successors, (107), 7 states have call predecessors, (107), 7 states have call successors, (107) Word has length 272 [2025-01-09 12:57:21,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:57:21,680 INFO L225 Difference]: With dead ends: 5791 [2025-01-09 12:57:21,680 INFO L226 Difference]: Without dead ends: 2169 [2025-01-09 12:57:21,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 562 GetRequests, 537 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=220, Invalid=482, Unknown=0, NotChecked=0, Total=702 [2025-01-09 12:57:21,688 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 1080 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 294 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1080 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 294 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 12:57:21,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1080 Valid, 565 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [294 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 12:57:21,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2169 states. [2025-01-09 12:57:21,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2169 to 2125. [2025-01-09 12:57:21,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2125 states, 1756 states have (on average 1.325740318906606) internal successors, (2328), 1764 states have internal predecessors, (2328), 292 states have call successors, (292), 76 states have call predecessors, (292), 76 states have return successors, (292), 284 states have call predecessors, (292), 292 states have call successors, (292) [2025-01-09 12:57:21,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2125 states to 2125 states and 2912 transitions. [2025-01-09 12:57:21,875 INFO L78 Accepts]: Start accepts. Automaton has 2125 states and 2912 transitions. Word has length 272 [2025-01-09 12:57:21,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:57:21,876 INFO L471 AbstractCegarLoop]: Abstraction has 2125 states and 2912 transitions. [2025-01-09 12:57:21,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.3125) internal successors, (149), 16 states have internal predecessors, (149), 7 states have call successors, (106), 3 states have call predecessors, (106), 7 states have return successors, (107), 7 states have call predecessors, (107), 7 states have call successors, (107) [2025-01-09 12:57:21,876 INFO L276 IsEmpty]: Start isEmpty. Operand 2125 states and 2912 transitions. [2025-01-09 12:57:21,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-01-09 12:57:21,880 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:57:21,880 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:57:21,887 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 12:57:22,080 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,SelfDestructingSolverStorable8 [2025-01-09 12:57:22,081 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:57:22,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:57:22,082 INFO L85 PathProgramCache]: Analyzing trace with hash 2077109025, now seen corresponding path program 1 times [2025-01-09 12:57:22,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:57:22,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603011429] [2025-01-09 12:57:22,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:57:22,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:57:22,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-01-09 12:57:22,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-01-09 12:57:22,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:57:22,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:57:22,386 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 9 proven. 108 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-01-09 12:57:22,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:57:22,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603011429] [2025-01-09 12:57:22,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603011429] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:57:22,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898296880] [2025-01-09 12:57:22,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:57:22,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:57:22,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:57:22,390 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 12:57:22,392 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 12:57:22,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-01-09 12:57:22,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-01-09 12:57:22,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:57:22,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:57:22,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 12:57:22,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:57:23,056 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 2021 proven. 126 refuted. 0 times theorem prover too weak. 973 trivial. 0 not checked. [2025-01-09 12:57:23,056 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:57:23,444 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 207 proven. 135 refuted. 0 times theorem prover too weak. 2778 trivial. 0 not checked. [2025-01-09 12:57:23,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898296880] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 12:57:23,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 12:57:23,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 12] total 25 [2025-01-09 12:57:23,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516008851] [2025-01-09 12:57:23,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 12:57:23,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 12:57:23,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:57:23,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 12:57:23,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600 [2025-01-09 12:57:23,446 INFO L87 Difference]: Start difference. First operand 2125 states and 2912 transitions. Second operand has 25 states, 24 states have (on average 6.75) internal successors, (162), 23 states have internal predecessors, (162), 9 states have call successors, (104), 4 states have call predecessors, (104), 9 states have return successors, (106), 9 states have call predecessors, (106), 9 states have call successors, (106) [2025-01-09 12:57:24,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:57:24,800 INFO L93 Difference]: Finished difference Result 5167 states and 7026 transitions. [2025-01-09 12:57:24,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-01-09 12:57:24,801 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 6.75) internal successors, (162), 23 states have internal predecessors, (162), 9 states have call successors, (104), 4 states have call predecessors, (104), 9 states have return successors, (106), 9 states have call predecessors, (106), 9 states have call successors, (106) Word has length 273 [2025-01-09 12:57:24,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:57:24,818 INFO L225 Difference]: With dead ends: 5167 [2025-01-09 12:57:24,818 INFO L226 Difference]: Without dead ends: 3045 [2025-01-09 12:57:24,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 533 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 779 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=967, Invalid=2455, Unknown=0, NotChecked=0, Total=3422 [2025-01-09 12:57:24,822 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 1482 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 835 mSolverCounterSat, 335 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1483 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 1170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 335 IncrementalHoareTripleChecker+Valid, 835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 12:57:24,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1483 Valid, 621 Invalid, 1170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [335 Valid, 835 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 12:57:24,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3045 states. [2025-01-09 12:57:24,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3045 to 1713. [2025-01-09 12:57:24,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1713 states, 1490 states have (on average 1.3496644295302014) internal successors, (2011), 1492 states have internal predecessors, (2011), 166 states have call successors, (166), 56 states have call predecessors, (166), 56 states have return successors, (166), 164 states have call predecessors, (166), 166 states have call successors, (166) [2025-01-09 12:57:24,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1713 states to 1713 states and 2343 transitions. [2025-01-09 12:57:24,920 INFO L78 Accepts]: Start accepts. Automaton has 1713 states and 2343 transitions. Word has length 273 [2025-01-09 12:57:24,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:57:24,920 INFO L471 AbstractCegarLoop]: Abstraction has 1713 states and 2343 transitions. [2025-01-09 12:57:24,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 6.75) internal successors, (162), 23 states have internal predecessors, (162), 9 states have call successors, (104), 4 states have call predecessors, (104), 9 states have return successors, (106), 9 states have call predecessors, (106), 9 states have call successors, (106) [2025-01-09 12:57:24,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1713 states and 2343 transitions. [2025-01-09 12:57:24,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-01-09 12:57:24,924 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:57:24,924 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:57:24,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 12:57:25,125 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,SelfDestructingSolverStorable9 [2025-01-09 12:57:25,125 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:57:25,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:57:25,126 INFO L85 PathProgramCache]: Analyzing trace with hash 2050568850, now seen corresponding path program 1 times [2025-01-09 12:57:25,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:57:25,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111907442] [2025-01-09 12:57:25,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:57:25,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:57:25,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-01-09 12:57:25,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-01-09 12:57:25,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:57:25,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:57:30,128 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 9 proven. 108 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-01-09 12:57:30,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:57:30,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111907442] [2025-01-09 12:57:30,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111907442] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:57:30,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463941931] [2025-01-09 12:57:30,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:57:30,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:57:30,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:57:30,132 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 12:57:30,133 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 12:57:30,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-01-09 12:57:30,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-01-09 12:57:30,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:57:30,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:57:30,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 12:57:30,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:57:30,796 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 477 proven. 108 refuted. 0 times theorem prover too weak. 2535 trivial. 0 not checked. [2025-01-09 12:57:30,796 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:57:31,754 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 9 proven. 108 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-01-09 12:57:31,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463941931] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 12:57:31,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 12:57:31,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 17 [2025-01-09 12:57:31,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033847867] [2025-01-09 12:57:31,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 12:57:31,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 12:57:31,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:57:31,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 12:57:31,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2025-01-09 12:57:31,757 INFO L87 Difference]: Start difference. First operand 1713 states and 2343 transitions. Second operand has 17 states, 17 states have (on average 11.470588235294118) internal successors, (195), 17 states have internal predecessors, (195), 5 states have call successors, (116), 2 states have call predecessors, (116), 4 states have return successors, (117), 5 states have call predecessors, (117), 5 states have call successors, (117) [2025-01-09 12:57:33,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:57:33,811 INFO L93 Difference]: Finished difference Result 4597 states and 6270 transitions. [2025-01-09 12:57:33,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-01-09 12:57:33,816 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 11.470588235294118) internal successors, (195), 17 states have internal predecessors, (195), 5 states have call successors, (116), 2 states have call predecessors, (116), 4 states have return successors, (117), 5 states have call predecessors, (117), 5 states have call successors, (117) Word has length 273 [2025-01-09 12:57:33,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:57:33,826 INFO L225 Difference]: With dead ends: 4597 [2025-01-09 12:57:33,826 INFO L226 Difference]: Without dead ends: 2845 [2025-01-09 12:57:33,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 548 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=522, Invalid=1370, Unknown=0, NotChecked=0, Total=1892 [2025-01-09 12:57:33,831 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 2360 mSDsluCounter, 888 mSDsCounter, 0 mSdLazyCounter, 1161 mSolverCounterSat, 846 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2361 SdHoareTripleChecker+Valid, 1207 SdHoareTripleChecker+Invalid, 2007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 846 IncrementalHoareTripleChecker+Valid, 1161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 12:57:33,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2361 Valid, 1207 Invalid, 2007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [846 Valid, 1161 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 12:57:33,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2845 states. [2025-01-09 12:57:33,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2845 to 1655. [2025-01-09 12:57:33,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1655 states, 1412 states have (on average 1.3293201133144477) internal successors, (1877), 1414 states have internal predecessors, (1877), 182 states have call successors, (182), 60 states have call predecessors, (182), 60 states have return successors, (182), 180 states have call predecessors, (182), 182 states have call successors, (182) [2025-01-09 12:57:33,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 2241 transitions. [2025-01-09 12:57:33,960 INFO L78 Accepts]: Start accepts. Automaton has 1655 states and 2241 transitions. Word has length 273 [2025-01-09 12:57:33,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:57:33,961 INFO L471 AbstractCegarLoop]: Abstraction has 1655 states and 2241 transitions. [2025-01-09 12:57:33,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 11.470588235294118) internal successors, (195), 17 states have internal predecessors, (195), 5 states have call successors, (116), 2 states have call predecessors, (116), 4 states have return successors, (117), 5 states have call predecessors, (117), 5 states have call successors, (117) [2025-01-09 12:57:33,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 2241 transitions. [2025-01-09 12:57:33,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-01-09 12:57:33,963 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:57:33,964 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:57:33,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 12:57:34,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-09 12:57:34,165 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:57:34,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:57:34,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1993894066, now seen corresponding path program 1 times [2025-01-09 12:57:34,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:57:34,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711431236] [2025-01-09 12:57:34,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:57:34,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:57:34,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-01-09 12:57:34,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-01-09 12:57:34,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:57:34,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:57:34,727 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 81 proven. 147 refuted. 0 times theorem prover too weak. 2892 trivial. 0 not checked. [2025-01-09 12:57:34,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:57:34,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711431236] [2025-01-09 12:57:34,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711431236] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:57:34,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993964821] [2025-01-09 12:57:34,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:57:34,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:57:34,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:57:34,730 INFO L229 MonitoredProcess]: Starting monitored process 8 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 12:57:34,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 12:57:34,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-01-09 12:57:34,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-01-09 12:57:34,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:57:34,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:57:34,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 12:57:34,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:57:35,602 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1985 proven. 87 refuted. 0 times theorem prover too weak. 1048 trivial. 0 not checked. [2025-01-09 12:57:35,602 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:57:36,224 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 246 proven. 96 refuted. 0 times theorem prover too weak. 2778 trivial. 0 not checked. [2025-01-09 12:57:36,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993964821] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 12:57:36,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 12:57:36,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 28 [2025-01-09 12:57:36,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186981250] [2025-01-09 12:57:36,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 12:57:36,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 12:57:36,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:57:36,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 12:57:36,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2025-01-09 12:57:36,228 INFO L87 Difference]: Start difference. First operand 1655 states and 2241 transitions. Second operand has 28 states, 27 states have (on average 6.296296296296297) internal successors, (170), 26 states have internal predecessors, (170), 9 states have call successors, (88), 4 states have call predecessors, (88), 9 states have return successors, (90), 9 states have call predecessors, (90), 9 states have call successors, (90) [2025-01-09 12:57:41,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:57:41,050 INFO L93 Difference]: Finished difference Result 6675 states and 8905 transitions. [2025-01-09 12:57:41,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2025-01-09 12:57:41,050 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 6.296296296296297) internal successors, (170), 26 states have internal predecessors, (170), 9 states have call successors, (88), 4 states have call predecessors, (88), 9 states have return successors, (90), 9 states have call predecessors, (90), 9 states have call successors, (90) Word has length 273 [2025-01-09 12:57:41,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:57:41,063 INFO L225 Difference]: With dead ends: 6675 [2025-01-09 12:57:41,063 INFO L226 Difference]: Without dead ends: 5023 [2025-01-09 12:57:41,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 652 GetRequests, 548 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3489 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2551, Invalid=8579, Unknown=0, NotChecked=0, Total=11130 [2025-01-09 12:57:41,068 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 3617 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 1848 mSolverCounterSat, 561 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3617 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 2409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 561 IncrementalHoareTripleChecker+Valid, 1848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 12:57:41,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3617 Valid, 1035 Invalid, 2409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [561 Valid, 1848 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 12:57:41,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5023 states. [2025-01-09 12:57:41,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5023 to 1475. [2025-01-09 12:57:41,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1475 states, 1216 states have (on average 1.2804276315789473) internal successors, (1557), 1218 states have internal predecessors, (1557), 182 states have call successors, (182), 76 states have call predecessors, (182), 76 states have return successors, (182), 180 states have call predecessors, (182), 182 states have call successors, (182) [2025-01-09 12:57:41,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1475 states and 1921 transitions. [2025-01-09 12:57:41,318 INFO L78 Accepts]: Start accepts. Automaton has 1475 states and 1921 transitions. Word has length 273 [2025-01-09 12:57:41,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:57:41,319 INFO L471 AbstractCegarLoop]: Abstraction has 1475 states and 1921 transitions. [2025-01-09 12:57:41,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 6.296296296296297) internal successors, (170), 26 states have internal predecessors, (170), 9 states have call successors, (88), 4 states have call predecessors, (88), 9 states have return successors, (90), 9 states have call predecessors, (90), 9 states have call successors, (90) [2025-01-09 12:57:41,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1475 states and 1921 transitions. [2025-01-09 12:57:41,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-01-09 12:57:41,326 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:57:41,326 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:57:41,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-09 12:57:41,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:57:41,528 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:57:41,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:57:41,528 INFO L85 PathProgramCache]: Analyzing trace with hash 155127826, now seen corresponding path program 1 times [2025-01-09 12:57:41,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:57:41,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251185194] [2025-01-09 12:57:41,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:57:41,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:57:41,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-01-09 12:57:41,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-01-09 12:57:41,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:57:41,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:57:41,728 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-01-09 12:57:41,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:57:41,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251185194] [2025-01-09 12:57:41,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251185194] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:57:41,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:57:41,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 12:57:41,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475131514] [2025-01-09 12:57:41,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:57:41,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 12:57:41,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:57:41,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 12:57:41,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:57:41,731 INFO L87 Difference]: Start difference. First operand 1475 states and 1921 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-01-09 12:57:42,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:57:42,176 INFO L93 Difference]: Finished difference Result 3201 states and 4189 transitions. [2025-01-09 12:57:42,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 12:57:42,176 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 276 [2025-01-09 12:57:42,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:57:42,182 INFO L225 Difference]: With dead ends: 3201 [2025-01-09 12:57:42,182 INFO L226 Difference]: Without dead ends: 1729 [2025-01-09 12:57:42,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:57:42,185 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 227 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 12:57:42,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 550 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 12:57:42,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1729 states. [2025-01-09 12:57:42,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1729 to 1499. [2025-01-09 12:57:42,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1499 states, 1240 states have (on average 1.275) internal successors, (1581), 1242 states have internal predecessors, (1581), 182 states have call successors, (182), 76 states have call predecessors, (182), 76 states have return successors, (182), 180 states have call predecessors, (182), 182 states have call successors, (182) [2025-01-09 12:57:42,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1499 states and 1945 transitions. [2025-01-09 12:57:42,455 INFO L78 Accepts]: Start accepts. Automaton has 1499 states and 1945 transitions. Word has length 276 [2025-01-09 12:57:42,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:57:42,455 INFO L471 AbstractCegarLoop]: Abstraction has 1499 states and 1945 transitions. [2025-01-09 12:57:42,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-01-09 12:57:42,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 1945 transitions. [2025-01-09 12:57:42,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-01-09 12:57:42,461 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:57:42,462 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:57:42,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 12:57:42,462 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:57:42,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:57:42,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1650310508, now seen corresponding path program 1 times [2025-01-09 12:57:42,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:57:42,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859786609] [2025-01-09 12:57:42,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:57:42,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:57:42,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-01-09 12:57:42,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-01-09 12:57:42,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:57:42,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:57:52,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 9 proven. 108 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-01-09 12:57:52,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:57:52,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859786609] [2025-01-09 12:57:52,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859786609] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:57:52,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361142475] [2025-01-09 12:57:52,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:57:52,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:57:52,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:57:52,465 INFO L229 MonitoredProcess]: Starting monitored process 9 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 12:57:52,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 12:57:52,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-01-09 12:57:52,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-01-09 12:57:52,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:57:52,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:57:52,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-01-09 12:57:52,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:57:59,390 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 2029 proven. 366 refuted. 0 times theorem prover too weak. 725 trivial. 0 not checked. [2025-01-09 12:57:59,391 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:58:16,837 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification. DAG size of input: 19 DAG size of output: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)