./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-71.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_fillercode_fillercodesize_ps-cn-250_file-71.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 182636466dd7ed34c7e4a19dcd08446c47e3ac770c4a66384f8d4d043f90aba6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:46:21,660 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:46:21,740 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 09:46:21,749 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:46:21,749 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:46:21,772 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:46:21,772 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:46:21,773 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:46:21,773 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:46:21,773 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:46:21,773 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:46:21,773 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:46:21,773 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:46:21,773 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:46:21,774 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:46:21,774 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:46:21,774 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:46:21,774 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:46:21,774 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 09:46:21,774 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:46:21,774 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:46:21,774 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:46:21,774 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:46:21,774 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:46:21,774 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:46:21,775 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:46:21,775 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:46:21,775 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:46:21,775 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:46:21,775 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:46:21,775 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:46:21,775 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:46:21,775 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:46:21,775 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:46:21,775 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:46:21,775 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:46:21,776 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:46:21,776 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:46:21,776 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:46:21,776 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:46:21,776 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:46:21,776 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:46:21,776 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 09:46:21,776 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 09:46:21,776 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:46:21,776 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:46:21,776 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:46:21,777 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:46:21,777 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 -> 182636466dd7ed34c7e4a19dcd08446c47e3ac770c4a66384f8d4d043f90aba6 [2025-01-09 09:46:22,019 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:46:22,024 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:46:22,025 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:46:22,025 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:46:22,026 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:46:22,026 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-71.i [2025-01-09 09:46:23,267 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f14bf24d9/522b79bc62dc4727b07a50b8a80ad5f9/FLAGefdb0a433 [2025-01-09 09:46:23,561 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:46:23,561 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-71.i [2025-01-09 09:46:23,576 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f14bf24d9/522b79bc62dc4727b07a50b8a80ad5f9/FLAGefdb0a433 [2025-01-09 09:46:23,591 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f14bf24d9/522b79bc62dc4727b07a50b8a80ad5f9 [2025-01-09 09:46:23,593 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:46:23,595 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:46:23,597 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:46:23,597 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:46:23,600 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:46:23,600 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:46:23" (1/1) ... [2025-01-09 09:46:23,601 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@408ecb55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:46:23, skipping insertion in model container [2025-01-09 09:46:23,601 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:46:23" (1/1) ... [2025-01-09 09:46:23,625 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:46:23,724 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_fillercode_fillercodesize_ps-cn-250_file-71.i[916,929] [2025-01-09 09:46:23,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:46:23,866 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:46:23,875 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_fillercode_fillercodesize_ps-cn-250_file-71.i[916,929] [2025-01-09 09:46:23,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:46:23,958 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:46:23,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:46:23 WrapperNode [2025-01-09 09:46:23,960 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:46:23,961 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:46:23,961 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:46:23,961 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:46:23,966 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:46:23" (1/1) ... [2025-01-09 09:46:23,981 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:46:23" (1/1) ... [2025-01-09 09:46:24,020 INFO L138 Inliner]: procedures = 26, calls = 102, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 561 [2025-01-09 09:46:24,021 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:46:24,021 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:46:24,021 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:46:24,021 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:46:24,032 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:46:23" (1/1) ... [2025-01-09 09:46:24,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:46:23" (1/1) ... [2025-01-09 09:46:24,036 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:46:23" (1/1) ... [2025-01-09 09:46:24,048 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 09:46:24,048 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:46:23" (1/1) ... [2025-01-09 09:46:24,048 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:46:23" (1/1) ... [2025-01-09 09:46:24,060 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:46:23" (1/1) ... [2025-01-09 09:46:24,062 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:46:23" (1/1) ... [2025-01-09 09:46:24,064 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:46:23" (1/1) ... [2025-01-09 09:46:24,067 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:46:23" (1/1) ... [2025-01-09 09:46:24,069 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:46:23" (1/1) ... [2025-01-09 09:46:24,073 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:46:24,073 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:46:24,073 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:46:24,073 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:46:24,074 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:46:23" (1/1) ... [2025-01-09 09:46:24,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:46:24,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:46:24,101 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 09:46:24,114 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 09:46:24,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:46:24,140 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:46:24,140 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:46:24,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 09:46:24,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:46:24,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:46:24,244 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:46:24,246 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:46:24,908 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-01-09 09:46:24,909 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:46:24,922 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:46:24,922 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:46:24,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:46:24 BoogieIcfgContainer [2025-01-09 09:46:24,923 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:46:24,924 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:46:24,924 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:46:24,927 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:46:24,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:46:23" (1/3) ... [2025-01-09 09:46:24,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d01fef7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:46:24, skipping insertion in model container [2025-01-09 09:46:24,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:46:23" (2/3) ... [2025-01-09 09:46:24,929 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d01fef7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:46:24, skipping insertion in model container [2025-01-09 09:46:24,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:46:24" (3/3) ... [2025-01-09 09:46:24,930 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-71.i [2025-01-09 09:46:24,939 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:46:24,942 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-71.i that has 2 procedures, 235 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:46:24,987 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:46:24,995 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;@45ff7284, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:46:24,995 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:46:24,998 INFO L276 IsEmpty]: Start isEmpty. Operand has 235 states, 143 states have (on average 1.4825174825174825) internal successors, (212), 144 states have internal predecessors, (212), 89 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 89 states have call predecessors, (89), 89 states have call successors, (89) [2025-01-09 09:46:25,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2025-01-09 09:46:25,018 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:46:25,023 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:46:25,024 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:46:25,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:46:25,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1234746752, now seen corresponding path program 1 times [2025-01-09 09:46:25,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:46:25,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510687546] [2025-01-09 09:46:25,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:46:25,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:46:25,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 545 statements into 1 equivalence classes. [2025-01-09 09:46:25,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 545 of 545 statements. [2025-01-09 09:46:25,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:46:25,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:46:25,527 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 15488 trivial. 0 not checked. [2025-01-09 09:46:25,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:46:25,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510687546] [2025-01-09 09:46:25,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510687546] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:46:25,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63282935] [2025-01-09 09:46:25,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:46:25,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:46:25,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:46:25,531 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 09:46:25,533 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 09:46:25,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 545 statements into 1 equivalence classes. [2025-01-09 09:46:25,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 545 of 545 statements. [2025-01-09 09:46:25,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:46:25,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:46:25,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 1193 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 09:46:25,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:46:25,883 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 15488 trivial. 0 not checked. [2025-01-09 09:46:25,883 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:46:25,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63282935] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:46:25,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 09:46:25,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 09:46:25,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772709324] [2025-01-09 09:46:25,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:46:25,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:46:25,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:46:25,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:46:25,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:46:25,909 INFO L87 Difference]: Start difference. First operand has 235 states, 143 states have (on average 1.4825174825174825) internal successors, (212), 144 states have internal predecessors, (212), 89 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 89 states have call predecessors, (89), 89 states have call successors, (89) Second operand has 2 states, 2 states have (on average 52.5) internal successors, (105), 2 states have internal predecessors, (105), 2 states have call successors, (89), 2 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 2 states have call successors, (89) [2025-01-09 09:46:25,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:46:25,967 INFO L93 Difference]: Finished difference Result 464 states and 864 transitions. [2025-01-09 09:46:25,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:46:25,969 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 52.5) internal successors, (105), 2 states have internal predecessors, (105), 2 states have call successors, (89), 2 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 2 states have call successors, (89) Word has length 545 [2025-01-09 09:46:25,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:46:25,981 INFO L225 Difference]: With dead ends: 464 [2025-01-09 09:46:25,981 INFO L226 Difference]: Without dead ends: 232 [2025-01-09 09:46:25,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 546 GetRequests, 546 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 09:46:25,987 INFO L435 NwaCegarLoop]: 385 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, 385 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 09:46:25,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:46:25,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-01-09 09:46:26,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2025-01-09 09:46:26,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 141 states have (on average 1.4680851063829787) internal successors, (207), 141 states have internal predecessors, (207), 89 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 89 states have call predecessors, (89), 89 states have call successors, (89) [2025-01-09 09:46:26,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 385 transitions. [2025-01-09 09:46:26,036 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 385 transitions. Word has length 545 [2025-01-09 09:46:26,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:46:26,036 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 385 transitions. [2025-01-09 09:46:26,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 52.5) internal successors, (105), 2 states have internal predecessors, (105), 2 states have call successors, (89), 2 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 2 states have call successors, (89) [2025-01-09 09:46:26,037 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 385 transitions. [2025-01-09 09:46:26,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2025-01-09 09:46:26,044 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:46:26,045 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:46:26,054 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 09:46:26,249 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 09:46:26,249 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:46:26,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:46:26,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1516585414, now seen corresponding path program 1 times [2025-01-09 09:46:26,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:46:26,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584810917] [2025-01-09 09:46:26,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:46:26,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:46:26,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 545 statements into 1 equivalence classes. [2025-01-09 09:46:26,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 545 of 545 statements. [2025-01-09 09:46:26,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:46:26,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:46:29,365 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-01-09 09:46:29,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:46:29,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584810917] [2025-01-09 09:46:29,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584810917] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:46:29,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:46:29,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 09:46:29,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864127049] [2025-01-09 09:46:29,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:46:29,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 09:46:29,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:46:29,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 09:46:29,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 09:46:29,370 INFO L87 Difference]: Start difference. First operand 232 states and 385 transitions. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 3 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 3 states have call predecessors, (89), 3 states have call successors, (89) [2025-01-09 09:46:31,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:46:31,452 INFO L93 Difference]: Finished difference Result 1094 states and 1808 transitions. [2025-01-09 09:46:31,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 09:46:31,452 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 3 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 3 states have call predecessors, (89), 3 states have call successors, (89) Word has length 545 [2025-01-09 09:46:31,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:46:31,460 INFO L225 Difference]: With dead ends: 1094 [2025-01-09 09:46:31,460 INFO L226 Difference]: Without dead ends: 865 [2025-01-09 09:46:31,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-01-09 09:46:31,462 INFO L435 NwaCegarLoop]: 296 mSDtfsCounter, 1323 mSDsluCounter, 2693 mSDsCounter, 0 mSdLazyCounter, 1309 mSolverCounterSat, 707 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1323 SdHoareTripleChecker+Valid, 2989 SdHoareTripleChecker+Invalid, 2016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 707 IncrementalHoareTripleChecker+Valid, 1309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 09:46:31,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1323 Valid, 2989 Invalid, 2016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [707 Valid, 1309 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 09:46:31,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2025-01-09 09:46:31,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 607. [2025-01-09 09:46:31,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 390 states have (on average 1.5205128205128204) internal successors, (593), 391 states have internal predecessors, (593), 213 states have call successors, (213), 3 states have call predecessors, (213), 3 states have return successors, (213), 212 states have call predecessors, (213), 213 states have call successors, (213) [2025-01-09 09:46:31,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 1019 transitions. [2025-01-09 09:46:31,641 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 1019 transitions. Word has length 545 [2025-01-09 09:46:31,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:46:31,642 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 1019 transitions. [2025-01-09 09:46:31,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 3 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 3 states have call predecessors, (89), 3 states have call successors, (89) [2025-01-09 09:46:31,643 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 1019 transitions. [2025-01-09 09:46:31,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2025-01-09 09:46:31,646 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:46:31,650 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:46:31,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 09:46:31,651 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:46:31,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:46:31,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1089438140, now seen corresponding path program 1 times [2025-01-09 09:46:31,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:46:31,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808183319] [2025-01-09 09:46:31,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:46:31,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:46:31,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 545 statements into 1 equivalence classes. [2025-01-09 09:46:31,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 545 of 545 statements. [2025-01-09 09:46:31,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:46:31,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:46:37,038 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 189 proven. 75 refuted. 0 times theorem prover too weak. 15400 trivial. 0 not checked. [2025-01-09 09:46:37,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:46:37,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808183319] [2025-01-09 09:46:37,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808183319] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:46:37,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855472600] [2025-01-09 09:46:37,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:46:37,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:46:37,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:46:37,044 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 09:46:37,046 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 09:46:37,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 545 statements into 1 equivalence classes. [2025-01-09 09:46:37,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 545 of 545 statements. [2025-01-09 09:46:37,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:46:37,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:46:37,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 1195 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 09:46:37,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:46:38,072 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 8010 proven. 291 refuted. 0 times theorem prover too weak. 7363 trivial. 0 not checked. [2025-01-09 09:46:38,072 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:46:38,487 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 231 proven. 294 refuted. 0 times theorem prover too weak. 15139 trivial. 0 not checked. [2025-01-09 09:46:38,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855472600] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:46:38,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 09:46:38,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2025-01-09 09:46:38,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053001202] [2025-01-09 09:46:38,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 09:46:38,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 09:46:38,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:46:38,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 09:46:38,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2025-01-09 09:46:38,491 INFO L87 Difference]: Start difference. First operand 607 states and 1019 transitions. Second operand has 18 states, 18 states have (on average 13.38888888888889) internal successors, (241), 18 states have internal predecessors, (241), 7 states have call successors, (228), 3 states have call predecessors, (228), 7 states have return successors, (229), 7 states have call predecessors, (229), 7 states have call successors, (229) [2025-01-09 09:46:52,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:46:52,277 INFO L93 Difference]: Finished difference Result 2199 states and 3625 transitions. [2025-01-09 09:46:52,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-01-09 09:46:52,278 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 13.38888888888889) internal successors, (241), 18 states have internal predecessors, (241), 7 states have call successors, (228), 3 states have call predecessors, (228), 7 states have return successors, (229), 7 states have call predecessors, (229), 7 states have call successors, (229) Word has length 545 [2025-01-09 09:46:52,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:46:52,288 INFO L225 Difference]: With dead ends: 2199 [2025-01-09 09:46:52,288 INFO L226 Difference]: Without dead ends: 1595 [2025-01-09 09:46:52,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1134 GetRequests, 1087 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=681, Invalid=1671, Unknown=0, NotChecked=0, Total=2352 [2025-01-09 09:46:52,291 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 2689 mSDsluCounter, 1226 mSDsCounter, 0 mSdLazyCounter, 1705 mSolverCounterSat, 1012 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2728 SdHoareTripleChecker+Valid, 1537 SdHoareTripleChecker+Invalid, 2717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1012 IncrementalHoareTripleChecker+Valid, 1705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2025-01-09 09:46:52,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2728 Valid, 1537 Invalid, 2717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1012 Valid, 1705 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2025-01-09 09:46:52,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1595 states. [2025-01-09 09:46:52,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1595 to 1026. [2025-01-09 09:46:52,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1026 states, 675 states have (on average 1.511111111111111) internal successors, (1020), 677 states have internal predecessors, (1020), 337 states have call successors, (337), 13 states have call predecessors, (337), 13 states have return successors, (337), 335 states have call predecessors, (337), 337 states have call successors, (337) [2025-01-09 09:46:52,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1694 transitions. [2025-01-09 09:46:52,500 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1694 transitions. Word has length 545 [2025-01-09 09:46:52,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:46:52,502 INFO L471 AbstractCegarLoop]: Abstraction has 1026 states and 1694 transitions. [2025-01-09 09:46:52,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 13.38888888888889) internal successors, (241), 18 states have internal predecessors, (241), 7 states have call successors, (228), 3 states have call predecessors, (228), 7 states have return successors, (229), 7 states have call predecessors, (229), 7 states have call successors, (229) [2025-01-09 09:46:52,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1694 transitions. [2025-01-09 09:46:52,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 547 [2025-01-09 09:46:52,506 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:46:52,506 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:46:52,515 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 09:46:52,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:46:52,707 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:46:52,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:46:52,707 INFO L85 PathProgramCache]: Analyzing trace with hash 993490488, now seen corresponding path program 1 times [2025-01-09 09:46:52,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:46:52,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192426627] [2025-01-09 09:46:52,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:46:52,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:46:52,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 546 statements into 1 equivalence classes. [2025-01-09 09:46:52,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 546 of 546 statements. [2025-01-09 09:46:52,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:46:52,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:46:54,185 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-01-09 09:46:54,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:46:54,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192426627] [2025-01-09 09:46:54,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192426627] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:46:54,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:46:54,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 09:46:54,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918905176] [2025-01-09 09:46:54,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:46:54,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 09:46:54,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:46:54,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 09:46:54,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-09 09:46:54,188 INFO L87 Difference]: Start difference. First operand 1026 states and 1694 transitions. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 2 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 2 states have call predecessors, (89), 2 states have call successors, (89) [2025-01-09 09:46:56,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:46:56,460 INFO L93 Difference]: Finished difference Result 2547 states and 4205 transitions. [2025-01-09 09:46:56,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 09:46:56,460 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 2 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 2 states have call predecessors, (89), 2 states have call successors, (89) Word has length 546 [2025-01-09 09:46:56,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:46:56,468 INFO L225 Difference]: With dead ends: 2547 [2025-01-09 09:46:56,468 INFO L226 Difference]: Without dead ends: 1524 [2025-01-09 09:46:56,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2025-01-09 09:46:56,471 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 1268 mSDsluCounter, 2162 mSDsCounter, 0 mSdLazyCounter, 1245 mSolverCounterSat, 513 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1268 SdHoareTripleChecker+Valid, 2613 SdHoareTripleChecker+Invalid, 1758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 513 IncrementalHoareTripleChecker+Valid, 1245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 09:46:56,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1268 Valid, 2613 Invalid, 1758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [513 Valid, 1245 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 09:46:56,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1524 states. [2025-01-09 09:46:56,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1524 to 1082. [2025-01-09 09:46:56,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1082 states, 731 states have (on average 1.5362517099863202) internal successors, (1123), 733 states have internal predecessors, (1123), 337 states have call successors, (337), 13 states have call predecessors, (337), 13 states have return successors, (337), 335 states have call predecessors, (337), 337 states have call successors, (337) [2025-01-09 09:46:56,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1797 transitions. [2025-01-09 09:46:56,616 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1797 transitions. Word has length 546 [2025-01-09 09:46:56,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:46:56,617 INFO L471 AbstractCegarLoop]: Abstraction has 1082 states and 1797 transitions. [2025-01-09 09:46:56,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 2 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 2 states have call predecessors, (89), 2 states have call successors, (89) [2025-01-09 09:46:56,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1797 transitions. [2025-01-09 09:46:56,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 547 [2025-01-09 09:46:56,620 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:46:56,620 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:46:56,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 09:46:56,620 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:46:56,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:46:56,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1612533066, now seen corresponding path program 1 times [2025-01-09 09:46:56,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:46:56,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121951120] [2025-01-09 09:46:56,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:46:56,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:46:56,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 546 statements into 1 equivalence classes. [2025-01-09 09:46:56,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 546 of 546 statements. [2025-01-09 09:46:56,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:46:56,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:47:01,518 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 117 proven. 147 refuted. 0 times theorem prover too weak. 15400 trivial. 0 not checked. [2025-01-09 09:47:01,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:47:01,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121951120] [2025-01-09 09:47:01,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121951120] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:47:01,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125957555] [2025-01-09 09:47:01,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:47:01,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:47:01,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:47:01,525 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 09:47:01,529 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 09:47:01,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 546 statements into 1 equivalence classes. [2025-01-09 09:47:01,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 546 of 546 statements. [2025-01-09 09:47:01,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:47:01,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:47:01,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 1196 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-01-09 09:47:01,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:47:05,394 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 10344 proven. 543 refuted. 0 times theorem prover too weak. 4777 trivial. 0 not checked. [2025-01-09 09:47:05,394 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:47:19,059 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 600 proven. 438 refuted. 0 times theorem prover too weak. 14626 trivial. 0 not checked. [2025-01-09 09:47:19,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125957555] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:47:19,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 09:47:19,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21, 26] total 56 [2025-01-09 09:47:19,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490242467] [2025-01-09 09:47:19,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 09:47:19,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-01-09 09:47:19,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:47:19,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-01-09 09:47:19,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=529, Invalid=2551, Unknown=0, NotChecked=0, Total=3080 [2025-01-09 09:47:19,063 INFO L87 Difference]: Start difference. First operand 1082 states and 1797 transitions. Second operand has 56 states, 53 states have (on average 5.415094339622642) internal successors, (287), 52 states have internal predecessors, (287), 14 states have call successors, (267), 8 states have call predecessors, (267), 15 states have return successors, (267), 12 states have call predecessors, (267), 14 states have call successors, (267)