./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-13.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-13.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 da8d6803321973ca630199b6637b3c7e1909a2521698c73f2599b09c55d0dc3c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:19:59,045 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:19:59,098 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 14:19:59,101 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:19:59,101 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:19:59,114 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:19:59,115 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:19:59,115 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:19:59,115 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:19:59,115 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:19:59,115 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:19:59,115 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:19:59,115 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:19:59,115 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:19:59,116 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:19:59,116 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:19:59,116 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:19:59,116 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:19:59,116 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:19:59,116 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:19:59,116 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:19:59,116 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:19:59,116 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:19:59,116 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:19:59,116 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:19:59,116 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:19:59,116 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:19:59,116 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:19:59,116 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:19:59,116 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:19:59,116 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:19:59,116 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:19:59,116 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:19:59,117 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:19:59,117 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:19:59,117 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:19:59,117 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:19:59,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:19:59,117 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:19:59,117 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:19:59,117 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:19:59,117 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:19:59,117 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:19:59,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:19:59,117 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:19:59,117 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:19:59,117 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:19:59,117 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:19:59,117 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 -> da8d6803321973ca630199b6637b3c7e1909a2521698c73f2599b09c55d0dc3c [2025-01-09 14:19:59,316 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:19:59,323 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:19:59,325 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:19:59,325 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:19:59,325 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:19:59,326 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-13.i [2025-01-09 14:20:00,461 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/12c31ee79/c5fec055a94648019aa68618139ace19/FLAG1904616c4 [2025-01-09 14:20:00,722 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:20:00,722 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-13.i [2025-01-09 14:20:00,732 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/12c31ee79/c5fec055a94648019aa68618139ace19/FLAG1904616c4 [2025-01-09 14:20:00,741 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/12c31ee79/c5fec055a94648019aa68618139ace19 [2025-01-09 14:20:00,742 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:20:00,743 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:20:00,744 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:20:00,744 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:20:00,746 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:20:00,747 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:20:00" (1/1) ... [2025-01-09 14:20:00,747 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f42b39e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:20:00, skipping insertion in model container [2025-01-09 14:20:00,747 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:20:00" (1/1) ... [2025-01-09 14:20:00,763 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:20:00,862 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-13.i[916,929] [2025-01-09 14:20:00,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:20:00,950 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:20:00,957 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-13.i[916,929] [2025-01-09 14:20:01,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:20:01,026 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:20:01,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:20:01 WrapperNode [2025-01-09 14:20:01,029 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:20:01,029 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:20:01,030 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:20:01,030 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:20:01,034 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:20:01" (1/1) ... [2025-01-09 14:20:01,044 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:20:01" (1/1) ... [2025-01-09 14:20:01,083 INFO L138 Inliner]: procedures = 26, calls = 65, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 407 [2025-01-09 14:20:01,083 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:20:01,084 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:20:01,084 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:20:01,084 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:20:01,090 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:20:01" (1/1) ... [2025-01-09 14:20:01,090 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:20:01" (1/1) ... [2025-01-09 14:20:01,095 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:20:01" (1/1) ... [2025-01-09 14:20:01,133 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 14:20:01,133 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:20:01" (1/1) ... [2025-01-09 14:20:01,133 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:20:01" (1/1) ... [2025-01-09 14:20:01,155 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:20:01" (1/1) ... [2025-01-09 14:20:01,162 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:20:01" (1/1) ... [2025-01-09 14:20:01,168 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:20:01" (1/1) ... [2025-01-09 14:20:01,177 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:20:01" (1/1) ... [2025-01-09 14:20:01,183 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:20:01" (1/1) ... [2025-01-09 14:20:01,194 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:20:01,195 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:20:01,195 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:20:01,195 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:20:01,195 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:20:01" (1/1) ... [2025-01-09 14:20:01,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:20:01,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:20:01,218 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 14:20:01,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 14:20:01,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:20:01,251 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:20:01,252 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:20:01,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:20:01,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:20:01,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:20:01,326 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:20:01,327 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:20:01,942 INFO L? ?]: Removed 60 outVars from TransFormulas that were not future-live. [2025-01-09 14:20:01,943 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:20:01,957 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:20:01,961 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:20:01,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:20:01 BoogieIcfgContainer [2025-01-09 14:20:01,962 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:20:01,964 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:20:01,964 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:20:01,970 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:20:01,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:20:00" (1/3) ... [2025-01-09 14:20:01,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@292457f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:20:01, skipping insertion in model container [2025-01-09 14:20:01,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:20:01" (2/3) ... [2025-01-09 14:20:01,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@292457f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:20:01, skipping insertion in model container [2025-01-09 14:20:01,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:20:01" (3/3) ... [2025-01-09 14:20:01,972 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-13.i [2025-01-09 14:20:01,989 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:20:01,999 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-13.i that has 2 procedures, 172 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:20:02,053 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:20:02,061 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;@2cab8c96, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:20:02,061 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:20:02,064 INFO L276 IsEmpty]: Start isEmpty. Operand has 172 states, 117 states have (on average 1.4700854700854702) internal successors, (172), 118 states have internal predecessors, (172), 52 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-01-09 14:20:02,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2025-01-09 14:20:02,074 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:20:02,075 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:20:02,075 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:20:02,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:20:02,079 INFO L85 PathProgramCache]: Analyzing trace with hash 2024847430, now seen corresponding path program 1 times [2025-01-09 14:20:02,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:20:02,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366182132] [2025-01-09 14:20:02,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:20:02,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:20:02,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-01-09 14:20:02,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-01-09 14:20:02,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:20:02,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:20:02,477 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 5202 trivial. 0 not checked. [2025-01-09 14:20:02,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:20:02,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366182132] [2025-01-09 14:20:02,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366182132] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:20:02,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282939109] [2025-01-09 14:20:02,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:20:02,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:20:02,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:20:02,481 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:20:02,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 14:20:02,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-01-09 14:20:02,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-01-09 14:20:02,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:20:02,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:20:02,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:20:02,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:20:02,771 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 5202 trivial. 0 not checked. [2025-01-09 14:20:02,771 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:20:02,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282939109] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:20:02,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:20:02,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:20:02,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577284746] [2025-01-09 14:20:02,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:20:02,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:20:02,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:20:02,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:20:02,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:20:02,810 INFO L87 Difference]: Start difference. First operand has 172 states, 117 states have (on average 1.4700854700854702) internal successors, (172), 118 states have internal predecessors, (172), 52 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) Second operand has 2 states, 2 states have (on average 43.5) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (52), 2 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 2 states have call successors, (52) [2025-01-09 14:20:02,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:20:02,850 INFO L93 Difference]: Finished difference Result 338 states and 599 transitions. [2025-01-09 14:20:02,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:20:02,851 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 43.5) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (52), 2 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 2 states have call successors, (52) Word has length 342 [2025-01-09 14:20:02,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:20:02,858 INFO L225 Difference]: With dead ends: 338 [2025-01-09 14:20:02,859 INFO L226 Difference]: Without dead ends: 169 [2025-01-09 14:20:02,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:20:02,867 INFO L435 NwaCegarLoop]: 270 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, 270 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:20:02,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:20:02,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-01-09 14:20:02,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2025-01-09 14:20:02,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 115 states have (on average 1.4434782608695653) internal successors, (166), 115 states have internal predecessors, (166), 52 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-01-09 14:20:02,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 270 transitions. [2025-01-09 14:20:02,923 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 270 transitions. Word has length 342 [2025-01-09 14:20:02,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:20:02,923 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 270 transitions. [2025-01-09 14:20:02,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 43.5) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (52), 2 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 2 states have call successors, (52) [2025-01-09 14:20:02,924 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 270 transitions. [2025-01-09 14:20:02,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2025-01-09 14:20:02,932 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:20:02,933 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:20:02,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 14:20:03,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 14:20:03,134 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:20:03,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:20:03,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1546224834, now seen corresponding path program 1 times [2025-01-09 14:20:03,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:20:03,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107963397] [2025-01-09 14:20:03,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:20:03,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:20:03,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-01-09 14:20:03,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-01-09 14:20:03,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:20:03,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:20:03,721 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2025-01-09 14:20:03,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:20:03,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107963397] [2025-01-09 14:20:03,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107963397] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:20:03,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:20:03,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:20:03,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881373926] [2025-01-09 14:20:03,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:20:03,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:20:03,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:20:03,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:20:03,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:20:03,725 INFO L87 Difference]: Start difference. First operand 169 states and 270 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-01-09 14:20:03,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:20:03,798 INFO L93 Difference]: Finished difference Result 501 states and 804 transitions. [2025-01-09 14:20:03,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:20:03,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 342 [2025-01-09 14:20:03,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:20:03,803 INFO L225 Difference]: With dead ends: 501 [2025-01-09 14:20:03,805 INFO L226 Difference]: Without dead ends: 335 [2025-01-09 14:20:03,805 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 14:20:03,806 INFO L435 NwaCegarLoop]: 416 mSDtfsCounter, 258 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:20:03,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 677 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:20:03,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2025-01-09 14:20:03,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 333. [2025-01-09 14:20:03,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 226 states have (on average 1.4424778761061947) internal successors, (326), 226 states have internal predecessors, (326), 104 states have call successors, (104), 2 states have call predecessors, (104), 2 states have return successors, (104), 104 states have call predecessors, (104), 104 states have call successors, (104) [2025-01-09 14:20:03,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 534 transitions. [2025-01-09 14:20:03,842 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 534 transitions. Word has length 342 [2025-01-09 14:20:03,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:20:03,842 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 534 transitions. [2025-01-09 14:20:03,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-01-09 14:20:03,843 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 534 transitions. [2025-01-09 14:20:03,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2025-01-09 14:20:03,846 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:20:03,846 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:20:03,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:20:03,846 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:20:03,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:20:03,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1719383164, now seen corresponding path program 1 times [2025-01-09 14:20:03,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:20:03,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001632578] [2025-01-09 14:20:03,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:20:03,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:20:03,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-01-09 14:20:03,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-01-09 14:20:03,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:20:03,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:20:05,102 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2025-01-09 14:20:05,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:20:05,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001632578] [2025-01-09 14:20:05,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001632578] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:20:05,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:20:05,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 14:20:05,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20619195] [2025-01-09 14:20:05,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:20:05,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 14:20:05,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:20:05,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 14:20:05,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:20:05,106 INFO L87 Difference]: Start difference. First operand 333 states and 534 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 2 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) [2025-01-09 14:20:06,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:20:06,128 INFO L93 Difference]: Finished difference Result 1531 states and 2427 transitions. [2025-01-09 14:20:06,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 14:20:06,128 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 2 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) Word has length 342 [2025-01-09 14:20:06,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:20:06,140 INFO L225 Difference]: With dead ends: 1531 [2025-01-09 14:20:06,140 INFO L226 Difference]: Without dead ends: 1201 [2025-01-09 14:20:06,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2025-01-09 14:20:06,142 INFO L435 NwaCegarLoop]: 329 mSDtfsCounter, 752 mSDsluCounter, 1454 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 1783 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 14:20:06,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [752 Valid, 1783 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 14:20:06,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2025-01-09 14:20:06,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 1045. [2025-01-09 14:20:06,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1045 states, 812 states have (on average 1.5270935960591132) internal successors, (1240), 816 states have internal predecessors, (1240), 224 states have call successors, (224), 8 states have call predecessors, (224), 8 states have return successors, (224), 220 states have call predecessors, (224), 224 states have call successors, (224) [2025-01-09 14:20:06,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 1688 transitions. [2025-01-09 14:20:06,268 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 1688 transitions. Word has length 342 [2025-01-09 14:20:06,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:20:06,269 INFO L471 AbstractCegarLoop]: Abstraction has 1045 states and 1688 transitions. [2025-01-09 14:20:06,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 2 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) [2025-01-09 14:20:06,269 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1688 transitions. [2025-01-09 14:20:06,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2025-01-09 14:20:06,273 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:20:06,273 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:20:06,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:20:06,273 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:20:06,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:20:06,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1895525762, now seen corresponding path program 1 times [2025-01-09 14:20:06,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:20:06,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132911454] [2025-01-09 14:20:06,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:20:06,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:20:06,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-01-09 14:20:06,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-01-09 14:20:06,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:20:06,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:20:07,107 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 30 proven. 123 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2025-01-09 14:20:07,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:20:07,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132911454] [2025-01-09 14:20:07,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132911454] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:20:07,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527707397] [2025-01-09 14:20:07,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:20:07,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:20:07,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:20:07,112 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:20:07,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 14:20:07,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-01-09 14:20:07,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-01-09 14:20:07,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:20:07,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:20:07,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 788 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 14:20:07,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:20:07,771 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 1513 proven. 24 refuted. 0 times theorem prover too weak. 3767 trivial. 0 not checked. [2025-01-09 14:20:07,771 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:20:08,126 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 129 proven. 24 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2025-01-09 14:20:08,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527707397] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:20:08,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:20:08,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 16 [2025-01-09 14:20:08,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873673874] [2025-01-09 14:20:08,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:20:08,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 14:20:08,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:20:08,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 14:20:08,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2025-01-09 14:20:08,131 INFO L87 Difference]: Start difference. First operand 1045 states and 1688 transitions. Second operand has 16 states, 16 states have (on average 13.9375) internal successors, (223), 16 states have internal predecessors, (223), 6 states have call successors, (156), 3 states have call predecessors, (156), 6 states have return successors, (156), 6 states have call predecessors, (156), 6 states have call successors, (156) [2025-01-09 14:20:09,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:20:09,844 INFO L93 Difference]: Finished difference Result 6001 states and 9640 transitions. [2025-01-09 14:20:09,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-01-09 14:20:09,844 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 13.9375) internal successors, (223), 16 states have internal predecessors, (223), 6 states have call successors, (156), 3 states have call predecessors, (156), 6 states have return successors, (156), 6 states have call predecessors, (156), 6 states have call successors, (156) Word has length 342 [2025-01-09 14:20:09,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:20:09,870 INFO L225 Difference]: With dead ends: 6001 [2025-01-09 14:20:09,870 INFO L226 Difference]: Without dead ends: 4959 [2025-01-09 14:20:09,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 725 GetRequests, 680 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=502, Invalid=1660, Unknown=0, NotChecked=0, Total=2162 [2025-01-09 14:20:09,877 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 2116 mSDsluCounter, 1221 mSDsCounter, 0 mSdLazyCounter, 1094 mSolverCounterSat, 1023 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2128 SdHoareTripleChecker+Valid, 1419 SdHoareTripleChecker+Invalid, 2117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1023 IncrementalHoareTripleChecker+Valid, 1094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:20:09,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2128 Valid, 1419 Invalid, 2117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1023 Valid, 1094 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 14:20:09,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4959 states. [2025-01-09 14:20:10,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4959 to 4063. [2025-01-09 14:20:10,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4063 states, 3150 states have (on average 1.486984126984127) internal successors, (4684), 3170 states have internal predecessors, (4684), 860 states have call successors, (860), 52 states have call predecessors, (860), 52 states have return successors, (860), 840 states have call predecessors, (860), 860 states have call successors, (860) [2025-01-09 14:20:10,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4063 states to 4063 states and 6404 transitions. [2025-01-09 14:20:10,206 INFO L78 Accepts]: Start accepts. Automaton has 4063 states and 6404 transitions. Word has length 342 [2025-01-09 14:20:10,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:20:10,208 INFO L471 AbstractCegarLoop]: Abstraction has 4063 states and 6404 transitions. [2025-01-09 14:20:10,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 13.9375) internal successors, (223), 16 states have internal predecessors, (223), 6 states have call successors, (156), 3 states have call predecessors, (156), 6 states have return successors, (156), 6 states have call predecessors, (156), 6 states have call successors, (156) [2025-01-09 14:20:10,209 INFO L276 IsEmpty]: Start isEmpty. Operand 4063 states and 6404 transitions. [2025-01-09 14:20:10,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2025-01-09 14:20:10,215 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:20:10,215 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:20:10,227 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 14:20:10,420 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 14:20:10,420 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:20:10,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:20:10,421 INFO L85 PathProgramCache]: Analyzing trace with hash -514885186, now seen corresponding path program 1 times [2025-01-09 14:20:10,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:20:10,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086600039] [2025-01-09 14:20:10,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:20:10,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:20:10,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-01-09 14:20:10,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-01-09 14:20:10,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:20:10,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:20:11,086 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 30 proven. 123 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2025-01-09 14:20:11,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:20:11,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086600039] [2025-01-09 14:20:11,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086600039] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:20:11,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345434722] [2025-01-09 14:20:11,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:20:11,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:20:11,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:20:11,091 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:20:11,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 14:20:11,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-01-09 14:20:11,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-01-09 14:20:11,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:20:11,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:20:11,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 784 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 14:20:11,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:20:11,543 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 2521 proven. 96 refuted. 0 times theorem prover too weak. 2687 trivial. 0 not checked. [2025-01-09 14:20:11,543 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:20:11,810 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 57 proven. 96 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2025-01-09 14:20:11,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345434722] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:20:11,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:20:11,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2025-01-09 14:20:11,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075187542] [2025-01-09 14:20:11,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:20:11,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 14:20:11,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:20:11,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 14:20:11,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:20:11,813 INFO L87 Difference]: Start difference. First operand 4063 states and 6404 transitions. Second operand has 10 states, 10 states have (on average 14.0) internal successors, (140), 10 states have internal predecessors, (140), 4 states have call successors, (125), 2 states have call predecessors, (125), 4 states have return successors, (127), 4 states have call predecessors, (127), 4 states have call successors, (127) [2025-01-09 14:20:12,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:20:12,317 INFO L93 Difference]: Finished difference Result 8251 states and 12917 transitions. [2025-01-09 14:20:12,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 14:20:12,318 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 14.0) internal successors, (140), 10 states have internal predecessors, (140), 4 states have call successors, (125), 2 states have call predecessors, (125), 4 states have return successors, (127), 4 states have call predecessors, (127), 4 states have call successors, (127) Word has length 342 [2025-01-09 14:20:12,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:20:12,335 INFO L225 Difference]: With dead ends: 8251 [2025-01-09 14:20:12,335 INFO L226 Difference]: Without dead ends: 4191 [2025-01-09 14:20:12,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 700 GetRequests, 681 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2025-01-09 14:20:12,343 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 525 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:20:12,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 677 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:20:12,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4191 states. [2025-01-09 14:20:12,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4191 to 4127. [2025-01-09 14:20:12,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4127 states, 3198 states have (on average 1.4646654158849282) internal successors, (4684), 3218 states have internal predecessors, (4684), 860 states have call successors, (860), 68 states have call predecessors, (860), 68 states have return successors, (860), 840 states have call predecessors, (860), 860 states have call successors, (860) [2025-01-09 14:20:12,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4127 states to 4127 states and 6404 transitions. [2025-01-09 14:20:12,580 INFO L78 Accepts]: Start accepts. Automaton has 4127 states and 6404 transitions. Word has length 342 [2025-01-09 14:20:12,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:20:12,581 INFO L471 AbstractCegarLoop]: Abstraction has 4127 states and 6404 transitions. [2025-01-09 14:20:12,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.0) internal successors, (140), 10 states have internal predecessors, (140), 4 states have call successors, (125), 2 states have call predecessors, (125), 4 states have return successors, (127), 4 states have call predecessors, (127), 4 states have call successors, (127) [2025-01-09 14:20:12,581 INFO L276 IsEmpty]: Start isEmpty. Operand 4127 states and 6404 transitions. [2025-01-09 14:20:12,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2025-01-09 14:20:12,586 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:20:12,586 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:20:12,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 14:20:12,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:20:12,786 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:20:12,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:20:12,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1486594029, now seen corresponding path program 1 times [2025-01-09 14:20:12,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:20:12,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018926212] [2025-01-09 14:20:12,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:20:12,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:20:12,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-01-09 14:20:13,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-01-09 14:20:13,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:20:13,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 14:20:13,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [478303857] [2025-01-09 14:20:13,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:20:13,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:20:13,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:20:13,206 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:20:13,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 14:20:13,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-01-09 14:20:13,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-01-09 14:20:13,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:20:13,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:20:13,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 788 conjuncts, 68 conjuncts are in the unsatisfiable core [2025-01-09 14:20:13,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:20:16,300 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 2145 proven. 222 refuted. 0 times theorem prover too weak. 2937 trivial. 0 not checked. [2025-01-09 14:20:16,301 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:20:20,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:20:20,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018926212] [2025-01-09 14:20:20,615 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 14:20:20,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478303857] [2025-01-09 14:20:20,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478303857] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:20:20,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:20:20,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2025-01-09 14:20:20,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947227524] [2025-01-09 14:20:20,615 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-09 14:20:20,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-01-09 14:20:20,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:20:20,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-01-09 14:20:20,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=2059, Unknown=0, NotChecked=0, Total=2352 [2025-01-09 14:20:20,617 INFO L87 Difference]: Start difference. First operand 4127 states and 6404 transitions. Second operand has 37 states, 37 states have (on average 3.081081081081081) internal successors, (114), 33 states have internal predecessors, (114), 8 states have call successors, (52), 8 states have call predecessors, (52), 10 states have return successors, (52), 8 states have call predecessors, (52), 8 states have call successors, (52) [2025-01-09 14:20:27,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:20:27,333 INFO L93 Difference]: Finished difference Result 16455 states and 25077 transitions. [2025-01-09 14:20:27,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-01-09 14:20:27,334 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 3.081081081081081) internal successors, (114), 33 states have internal predecessors, (114), 8 states have call successors, (52), 8 states have call predecessors, (52), 10 states have return successors, (52), 8 states have call predecessors, (52), 8 states have call successors, (52) Word has length 344 [2025-01-09 14:20:27,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:20:27,393 INFO L225 Difference]: With dead ends: 16455 [2025-01-09 14:20:27,393 INFO L226 Difference]: Without dead ends: 12331 [2025-01-09 14:20:27,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2772 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1670, Invalid=8632, Unknown=0, NotChecked=0, Total=10302 [2025-01-09 14:20:27,405 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 2736 mSDsluCounter, 4498 mSDsCounter, 0 mSdLazyCounter, 5034 mSolverCounterSat, 486 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2736 SdHoareTripleChecker+Valid, 4871 SdHoareTripleChecker+Invalid, 5520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 486 IncrementalHoareTripleChecker+Valid, 5034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:20:27,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2736 Valid, 4871 Invalid, 5520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [486 Valid, 5034 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-01-09 14:20:27,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12331 states. [2025-01-09 14:20:27,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12331 to 8753. [2025-01-09 14:20:27,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8753 states, 6662 states have (on average 1.4371059741819274) internal successors, (9574), 6702 states have internal predecessors, (9574), 1868 states have call successors, (1868), 222 states have call predecessors, (1868), 222 states have return successors, (1868), 1828 states have call predecessors, (1868), 1868 states have call successors, (1868) [2025-01-09 14:20:28,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8753 states to 8753 states and 13310 transitions. [2025-01-09 14:20:28,016 INFO L78 Accepts]: Start accepts. Automaton has 8753 states and 13310 transitions. Word has length 344 [2025-01-09 14:20:28,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:20:28,017 INFO L471 AbstractCegarLoop]: Abstraction has 8753 states and 13310 transitions. [2025-01-09 14:20:28,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 3.081081081081081) internal successors, (114), 33 states have internal predecessors, (114), 8 states have call successors, (52), 8 states have call predecessors, (52), 10 states have return successors, (52), 8 states have call predecessors, (52), 8 states have call successors, (52) [2025-01-09 14:20:28,017 INFO L276 IsEmpty]: Start isEmpty. Operand 8753 states and 13310 transitions. [2025-01-09 14:20:28,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2025-01-09 14:20:28,057 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:20:28,057 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:20:28,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 14:20:28,257 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,SelfDestructingSolverStorable5 [2025-01-09 14:20:28,258 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:20:28,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:20:28,259 INFO L85 PathProgramCache]: Analyzing trace with hash -327482219, now seen corresponding path program 1 times [2025-01-09 14:20:28,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:20:28,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030115703] [2025-01-09 14:20:28,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:20:28,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:20:28,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-01-09 14:20:28,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-01-09 14:20:28,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:20:28,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:20:28,372 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2025-01-09 14:20:28,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:20:28,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030115703] [2025-01-09 14:20:28,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030115703] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:20:28,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:20:28,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:20:28,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646348950] [2025-01-09 14:20:28,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:20:28,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:20:28,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:20:28,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:20:28,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:20:28,374 INFO L87 Difference]: Start difference. First operand 8753 states and 13310 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-01-09 14:20:29,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:20:29,152 INFO L93 Difference]: Finished difference Result 25913 states and 39244 transitions. [2025-01-09 14:20:29,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:20:29,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 344 [2025-01-09 14:20:29,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:20:29,231 INFO L225 Difference]: With dead ends: 25913 [2025-01-09 14:20:29,232 INFO L226 Difference]: Without dead ends: 17163 [2025-01-09 14:20:29,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:20:29,287 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 250 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:20:29,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 533 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:20:29,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17163 states. [2025-01-09 14:20:30,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17163 to 10275. [2025-01-09 14:20:30,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10275 states, 8184 states have (on average 1.4643206256109482) internal successors, (11984), 8224 states have internal predecessors, (11984), 1868 states have call successors, (1868), 222 states have call predecessors, (1868), 222 states have return successors, (1868), 1828 states have call predecessors, (1868), 1868 states have call successors, (1868) [2025-01-09 14:20:30,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10275 states to 10275 states and 15720 transitions. [2025-01-09 14:20:30,204 INFO L78 Accepts]: Start accepts. Automaton has 10275 states and 15720 transitions. Word has length 344 [2025-01-09 14:20:30,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:20:30,205 INFO L471 AbstractCegarLoop]: Abstraction has 10275 states and 15720 transitions. [2025-01-09 14:20:30,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-01-09 14:20:30,206 INFO L276 IsEmpty]: Start isEmpty. Operand 10275 states and 15720 transitions. [2025-01-09 14:20:30,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2025-01-09 14:20:30,212 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:20:30,212 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:20:30,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:20:30,212 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:20:30,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:20:30,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1028546797, now seen corresponding path program 1 times [2025-01-09 14:20:30,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:20:30,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064247460] [2025-01-09 14:20:30,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:20:30,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:20:30,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-01-09 14:20:30,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-01-09 14:20:30,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:20:30,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 14:20:30,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1025879707] [2025-01-09 14:20:30,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:20:30,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:20:30,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:20:30,665 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:20:30,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 14:20:30,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-01-09 14:20:30,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-01-09 14:20:30,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:20:30,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:20:30,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 788 conjuncts, 78 conjuncts are in the unsatisfiable core [2025-01-09 14:20:30,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:20:51,915 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 3215 proven. 207 refuted. 0 times theorem prover too weak. 1882 trivial. 0 not checked. [2025-01-09 14:20:51,915 INFO L312 TraceCheckSpWp]: Computing backward predicates...