./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-29.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-29.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 7e3b862ba9a2a4c1c92e3db12119deeccd82c1339b8fd16f8352680fc1302c9d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:09:38,249 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:09:38,359 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 02:09:38,367 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:09:38,367 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:09:38,404 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:09:38,406 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:09:38,406 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:09:38,410 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:09:38,410 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:09:38,410 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:09:38,410 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:09:38,410 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:09:38,410 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:09:38,410 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:09:38,412 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:09:38,412 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:09:38,412 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:09:38,412 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:09:38,412 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:09:38,412 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:09:38,412 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:09:38,412 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:09:38,412 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:09:38,412 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:09:38,412 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:09:38,412 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:09:38,412 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:09:38,412 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:09:38,412 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:09:38,412 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:09:38,413 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:09:38,413 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:09:38,413 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:09:38,413 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:09:38,413 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:09:38,413 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:09:38,413 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:09:38,413 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:09:38,413 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:09:38,413 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:09:38,413 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:09:38,413 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:09:38,413 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 -> 7e3b862ba9a2a4c1c92e3db12119deeccd82c1339b8fd16f8352680fc1302c9d [2025-02-06 02:09:38,751 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:09:38,757 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:09:38,762 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:09:38,763 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:09:38,763 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:09:38,764 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-29.i [2025-02-06 02:09:40,081 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/68d5ab513/0d537a3fc085461f80780cd12d9d6e6c/FLAGa28ea3218 [2025-02-06 02:09:40,486 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:09:40,486 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-29.i [2025-02-06 02:09:40,495 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/68d5ab513/0d537a3fc085461f80780cd12d9d6e6c/FLAGa28ea3218 [2025-02-06 02:09:40,517 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/68d5ab513/0d537a3fc085461f80780cd12d9d6e6c [2025-02-06 02:09:40,521 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:09:40,522 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:09:40,523 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:09:40,523 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:09:40,527 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:09:40,527 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:09:40" (1/1) ... [2025-02-06 02:09:40,529 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@582a492e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:09:40, skipping insertion in model container [2025-02-06 02:09:40,529 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:09:40" (1/1) ... [2025-02-06 02:09:40,541 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:09:40,642 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_amount10_file-29.i[915,928] [2025-02-06 02:09:40,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:09:40,684 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:09:40,693 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_amount10_file-29.i[915,928] [2025-02-06 02:09:40,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:09:40,721 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:09:40,722 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:09:40 WrapperNode [2025-02-06 02:09:40,722 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:09:40,724 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:09:40,724 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:09:40,724 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:09:40,728 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:09:40" (1/1) ... [2025-02-06 02:09:40,732 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:09:40" (1/1) ... [2025-02-06 02:09:40,756 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 97 [2025-02-06 02:09:40,756 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:09:40,756 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:09:40,756 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:09:40,756 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:09:40,765 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:09:40" (1/1) ... [2025-02-06 02:09:40,765 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:09:40" (1/1) ... [2025-02-06 02:09:40,767 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:09:40" (1/1) ... [2025-02-06 02:09:40,781 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 02:09:40,782 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:09:40" (1/1) ... [2025-02-06 02:09:40,782 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:09:40" (1/1) ... [2025-02-06 02:09:40,788 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:09:40" (1/1) ... [2025-02-06 02:09:40,788 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:09:40" (1/1) ... [2025-02-06 02:09:40,789 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:09:40" (1/1) ... [2025-02-06 02:09:40,790 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:09:40" (1/1) ... [2025-02-06 02:09:40,795 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:09:40,796 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:09:40,796 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:09:40,796 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:09:40,796 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:09:40" (1/1) ... [2025-02-06 02:09:40,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:09:40,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:09:40,824 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 02:09:40,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 02:09:40,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:09:40,846 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:09:40,846 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:09:40,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:09:40,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:09:40,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:09:40,914 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:09:40,915 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:09:41,071 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L71: havoc property_#t~bitwise12#1; [2025-02-06 02:09:41,086 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-02-06 02:09:41,086 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:09:41,102 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:09:41,102 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:09:41,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:09:41 BoogieIcfgContainer [2025-02-06 02:09:41,102 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:09:41,104 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:09:41,104 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:09:41,107 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:09:41,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:09:40" (1/3) ... [2025-02-06 02:09:41,108 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18b48034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:09:41, skipping insertion in model container [2025-02-06 02:09:41,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:09:40" (2/3) ... [2025-02-06 02:09:41,108 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18b48034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:09:41, skipping insertion in model container [2025-02-06 02:09:41,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:09:41" (3/3) ... [2025-02-06 02:09:41,109 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-29.i [2025-02-06 02:09:41,120 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:09:41,123 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-29.i that has 2 procedures, 48 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:09:41,173 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:09:41,183 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;@5f8ced28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:09:41,184 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:09:41,187 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 30 states have internal predecessors, (37), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 02:09:41,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-06 02:09:41,195 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:09:41,196 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:09:41,196 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:09:41,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:09:41,201 INFO L85 PathProgramCache]: Analyzing trace with hash -2004841417, now seen corresponding path program 1 times [2025-02-06 02:09:41,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:09:41,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052128177] [2025-02-06 02:09:41,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:09:41,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:09:41,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-06 02:09:41,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 02:09:41,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:09:41,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:09:41,394 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-02-06 02:09:41,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:09:41,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052128177] [2025-02-06 02:09:41,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052128177] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:09:41,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798698679] [2025-02-06 02:09:41,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:09:41,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:09:41,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:09:41,397 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:09:41,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 02:09:41,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-06 02:09:41,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 02:09:41,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:09:41,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:09:41,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:09:41,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:09:41,508 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-02-06 02:09:41,509 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:09:41,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798698679] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:09:41,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:09:41,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 02:09:41,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26616073] [2025-02-06 02:09:41,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:09:41,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:09:41,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:09:41,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:09:41,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:09:41,528 INFO L87 Difference]: Start difference. First operand has 48 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 30 states have internal predecessors, (37), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 02:09:41,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:09:41,555 INFO L93 Difference]: Finished difference Result 90 states and 149 transitions. [2025-02-06 02:09:41,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:09:41,556 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 100 [2025-02-06 02:09:41,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:09:41,561 INFO L225 Difference]: With dead ends: 90 [2025-02-06 02:09:41,561 INFO L226 Difference]: Without dead ends: 45 [2025-02-06 02:09:41,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:09:41,565 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:09:41,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:09:41,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-02-06 02:09:41,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-02-06 02:09:41,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 02:09:41,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 64 transitions. [2025-02-06 02:09:41,589 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 64 transitions. Word has length 100 [2025-02-06 02:09:41,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:09:41,589 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 64 transitions. [2025-02-06 02:09:41,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 02:09:41,590 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 64 transitions. [2025-02-06 02:09:41,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-06 02:09:41,596 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:09:41,596 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:09:41,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 02:09:41,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 02:09:41,797 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:09:41,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:09:41,798 INFO L85 PathProgramCache]: Analyzing trace with hash 2134968375, now seen corresponding path program 1 times [2025-02-06 02:09:41,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:09:41,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262306338] [2025-02-06 02:09:41,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:09:41,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:09:41,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-06 02:09:41,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 02:09:41,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:09:41,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:09:43,036 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 02:09:43,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:09:43,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262306338] [2025-02-06 02:09:43,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262306338] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:09:43,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:09:43,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 02:09:43,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560662487] [2025-02-06 02:09:43,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:09:43,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 02:09:43,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:09:43,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 02:09:43,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:09:43,040 INFO L87 Difference]: Start difference. First operand 45 states and 64 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:09:43,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:09:43,578 INFO L93 Difference]: Finished difference Result 64 states and 86 transitions. [2025-02-06 02:09:43,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 02:09:43,579 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 100 [2025-02-06 02:09:43,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:09:43,580 INFO L225 Difference]: With dead ends: 64 [2025-02-06 02:09:43,582 INFO L226 Difference]: Without dead ends: 62 [2025-02-06 02:09:43,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-06 02:09:43,583 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 16 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:09:43,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 326 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:09:43,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-02-06 02:09:43,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2025-02-06 02:09:43,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 40 states have (on average 1.175) internal successors, (47), 41 states have internal predecessors, (47), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 02:09:43,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 83 transitions. [2025-02-06 02:09:43,611 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 83 transitions. Word has length 100 [2025-02-06 02:09:43,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:09:43,611 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 83 transitions. [2025-02-06 02:09:43,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:09:43,612 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 83 transitions. [2025-02-06 02:09:43,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-06 02:09:43,613 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:09:43,613 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:09:43,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:09:43,613 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:09:43,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:09:43,613 INFO L85 PathProgramCache]: Analyzing trace with hash 288545417, now seen corresponding path program 1 times [2025-02-06 02:09:43,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:09:43,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906104324] [2025-02-06 02:09:43,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:09:43,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:09:43,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 02:09:43,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 02:09:43,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:09:43,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:09:44,446 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 02:09:44,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:09:44,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906104324] [2025-02-06 02:09:44,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906104324] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:09:44,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:09:44,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 02:09:44,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383989705] [2025-02-06 02:09:44,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:09:44,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 02:09:44,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:09:44,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 02:09:44,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:09:44,448 INFO L87 Difference]: Start difference. First operand 61 states and 83 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:09:44,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:09:44,895 INFO L93 Difference]: Finished difference Result 85 states and 110 transitions. [2025-02-06 02:09:44,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 02:09:44,896 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 101 [2025-02-06 02:09:44,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:09:44,898 INFO L225 Difference]: With dead ends: 85 [2025-02-06 02:09:44,898 INFO L226 Difference]: Without dead ends: 83 [2025-02-06 02:09:44,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-02-06 02:09:44,899 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 21 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:09:44,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 407 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:09:44,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-02-06 02:09:44,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 68. [2025-02-06 02:09:44,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 48 states have internal predecessors, (57), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 02:09:44,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 93 transitions. [2025-02-06 02:09:44,915 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 93 transitions. Word has length 101 [2025-02-06 02:09:44,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:09:44,917 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 93 transitions. [2025-02-06 02:09:44,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:09:44,917 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 93 transitions. [2025-02-06 02:09:44,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-06 02:09:44,918 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:09:44,918 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:09:44,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 02:09:44,918 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:09:44,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:09:44,919 INFO L85 PathProgramCache]: Analyzing trace with hash 11284805, now seen corresponding path program 1 times [2025-02-06 02:09:44,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:09:44,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612817562] [2025-02-06 02:09:44,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:09:44,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:09:44,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 02:09:44,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 02:09:44,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:09:44,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:09:45,400 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 02:09:45,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:09:45,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612817562] [2025-02-06 02:09:45,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612817562] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:09:45,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:09:45,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:09:45,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600512976] [2025-02-06 02:09:45,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:09:45,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:09:45,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:09:45,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:09:45,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:09:45,401 INFO L87 Difference]: Start difference. First operand 68 states and 93 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:09:45,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:09:45,459 INFO L93 Difference]: Finished difference Result 161 states and 218 transitions. [2025-02-06 02:09:45,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:09:45,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 101 [2025-02-06 02:09:45,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:09:45,462 INFO L225 Difference]: With dead ends: 161 [2025-02-06 02:09:45,462 INFO L226 Difference]: Without dead ends: 96 [2025-02-06 02:09:45,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:09:45,463 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 31 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:09:45,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 135 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:09:45,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-06 02:09:45,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2025-02-06 02:09:45,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 63 states have (on average 1.1428571428571428) internal successors, (72), 66 states have internal predecessors, (72), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2025-02-06 02:09:45,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 126 transitions. [2025-02-06 02:09:45,489 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 126 transitions. Word has length 101 [2025-02-06 02:09:45,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:09:45,489 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 126 transitions. [2025-02-06 02:09:45,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:09:45,489 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 126 transitions. [2025-02-06 02:09:45,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-06 02:09:45,491 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:09:45,491 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:09:45,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 02:09:45,491 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:09:45,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:09:45,492 INFO L85 PathProgramCache]: Analyzing trace with hash 514833800, now seen corresponding path program 1 times [2025-02-06 02:09:45,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:09:45,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022254423] [2025-02-06 02:09:45,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:09:45,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:09:45,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-06 02:09:45,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 02:09:45,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:09:45,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:09:45,976 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 02:09:45,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:09:45,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022254423] [2025-02-06 02:09:45,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022254423] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:09:45,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:09:45,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:09:45,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852601953] [2025-02-06 02:09:45,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:09:45,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:09:45,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:09:45,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:09:45,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:09:45,978 INFO L87 Difference]: Start difference. First operand 95 states and 126 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:09:46,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:09:46,032 INFO L93 Difference]: Finished difference Result 171 states and 228 transitions. [2025-02-06 02:09:46,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:09:46,036 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 102 [2025-02-06 02:09:46,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:09:46,037 INFO L225 Difference]: With dead ends: 171 [2025-02-06 02:09:46,037 INFO L226 Difference]: Without dead ends: 83 [2025-02-06 02:09:46,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:09:46,038 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 30 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:09:46,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 103 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:09:46,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-02-06 02:09:46,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 65. [2025-02-06 02:09:46,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 44 states have internal predecessors, (49), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 02:09:46,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 85 transitions. [2025-02-06 02:09:46,058 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 85 transitions. Word has length 102 [2025-02-06 02:09:46,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:09:46,059 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 85 transitions. [2025-02-06 02:09:46,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:09:46,059 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 85 transitions. [2025-02-06 02:09:46,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-06 02:09:46,061 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:09:46,061 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:09:46,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 02:09:46,062 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:09:46,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:09:46,062 INFO L85 PathProgramCache]: Analyzing trace with hash 509689420, now seen corresponding path program 1 times [2025-02-06 02:09:46,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:09:46,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906164881] [2025-02-06 02:09:46,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:09:46,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:09:46,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-06 02:09:46,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 02:09:46,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:09:46,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 02:09:46,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1794915199] [2025-02-06 02:09:46,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:09:46,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:09:46,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:09:46,104 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:09:46,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 02:09:46,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-06 02:09:46,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 02:09:46,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:09:46,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 02:09:46,171 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 02:09:46,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-06 02:09:46,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 02:09:46,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:09:46,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 02:09:46,246 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 02:09:46,246 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 02:09:46,247 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 02:09:46,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 02:09:46,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:09:46,452 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-06 02:09:46,505 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 02:09:46,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 02:09:46 BoogieIcfgContainer [2025-02-06 02:09:46,515 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 02:09:46,516 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 02:09:46,516 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 02:09:46,516 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 02:09:46,517 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:09:41" (3/4) ... [2025-02-06 02:09:46,519 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 02:09:46,519 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 02:09:46,520 INFO L158 Benchmark]: Toolchain (without parser) took 5997.86ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 107.2MB in the beginning and 148.0MB in the end (delta: -40.8MB). Peak memory consumption was 82.5MB. Max. memory is 16.1GB. [2025-02-06 02:09:46,520 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 128.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:09:46,524 INFO L158 Benchmark]: CACSL2BoogieTranslator took 200.16ms. Allocated memory is still 142.6MB. Free memory was 107.2MB in the beginning and 94.3MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 02:09:46,524 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.36ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 92.2MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 02:09:46,524 INFO L158 Benchmark]: Boogie Preprocessor took 38.89ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 89.8MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:09:46,524 INFO L158 Benchmark]: IcfgBuilder took 306.61ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 72.8MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 02:09:46,524 INFO L158 Benchmark]: TraceAbstraction took 5411.58ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 72.3MB in the beginning and 151.1MB in the end (delta: -78.8MB). Peak memory consumption was 49.0MB. Max. memory is 16.1GB. [2025-02-06 02:09:46,524 INFO L158 Benchmark]: Witness Printer took 3.31ms. Allocated memory is still 268.4MB. Free memory was 151.1MB in the beginning and 148.0MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:09:46,525 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 128.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 200.16ms. Allocated memory is still 142.6MB. Free memory was 107.2MB in the beginning and 94.3MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.36ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 92.2MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.89ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 89.8MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 306.61ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 72.8MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5411.58ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 72.3MB in the beginning and 151.1MB in the end (delta: -78.8MB). Peak memory consumption was 49.0MB. Max. memory is 16.1GB. * Witness Printer took 3.31ms. Allocated memory is still 268.4MB. Free memory was 151.1MB in the beginning and 148.0MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftRight at line 71, overapproximation of shiftRight at line 33. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_3 = 128; [L25] unsigned char var_1_4 = 32; [L26] signed long int var_1_5 = 0; [L27] signed long int var_1_6 = 4; [L28] unsigned char var_1_7 = 16; [L29] unsigned char var_1_8 = 10; VAL [isInitial=0, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=32, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L75] isInitial = 1 [L76] FCALL initially() [L77] COND TRUE 1 [L78] FCALL updateLastVariables() [L79] CALL updateVariables() [L44] var_1_2 = __VERIFIER_nondet_uchar() [L45] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=128, var_1_4=32, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=128, var_1_4=32, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L45] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_1=0, var_1_3=128, var_1_4=32, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L46] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_3=128, var_1_4=32, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_3=128, var_1_4=32, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L46] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_1=0, var_1_2=0, var_1_3=128, var_1_4=32, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L47] var_1_3 = __VERIFIER_nondet_uchar() [L48] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=32, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=32, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L48] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_1=0, var_1_2=0, var_1_4=32, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L49] CALL assume_abort_if_not(var_1_3 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=32, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=32, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L49] RET assume_abort_if_not(var_1_3 <= 255) VAL [isInitial=1, var_1_1=0, var_1_2=0, var_1_4=32, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L50] var_1_4 = __VERIFIER_nondet_uchar() [L51] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L51] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_1=0, var_1_2=0, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L52] CALL assume_abort_if_not(var_1_4 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L52] RET assume_abort_if_not(var_1_4 <= 255) VAL [isInitial=1, var_1_1=0, var_1_2=0, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L53] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=3, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=3, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L53] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, var_1_1=0, var_1_2=0, var_1_4=3, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L54] var_1_5 = __VERIFIER_nondet_long() [L55] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=3, var_1_5=-5, var_1_6=4, var_1_7=16, var_1_8=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=3, var_1_5=-5, var_1_6=4, var_1_7=16, var_1_8=10] [L55] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, var_1_1=0, var_1_2=0, var_1_4=3, var_1_5=-5, var_1_6=4, var_1_7=16, var_1_8=10] [L56] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=3, var_1_5=-5, var_1_6=4, var_1_7=16, var_1_8=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=3, var_1_5=-5, var_1_6=4, var_1_7=16, var_1_8=10] [L56] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_1=0, var_1_2=0, var_1_4=3, var_1_5=-5, var_1_6=4, var_1_7=16, var_1_8=10] [L57] var_1_6 = __VERIFIER_nondet_long() [L58] CALL assume_abort_if_not(var_1_6 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=3, var_1_5=-5, var_1_6=-2, var_1_7=16, var_1_8=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=3, var_1_5=-5, var_1_6=-2, var_1_7=16, var_1_8=10] [L58] RET assume_abort_if_not(var_1_6 >= -2147483648) VAL [isInitial=1, var_1_1=0, var_1_2=0, var_1_4=3, var_1_5=-5, var_1_6=-2, var_1_7=16, var_1_8=10] [L59] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=3, var_1_5=-5, var_1_6=-2, var_1_7=16, var_1_8=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=3, var_1_5=-5, var_1_6=-2, var_1_7=16, var_1_8=10] [L59] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, var_1_1=0, var_1_2=0, var_1_4=3, var_1_5=-5, var_1_6=-2, var_1_7=16, var_1_8=10] [L60] CALL assume_abort_if_not(var_1_6 != 0) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=3, var_1_5=-5, var_1_6=-2, var_1_7=16, var_1_8=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=3, var_1_5=-5, var_1_6=-2, var_1_7=16, var_1_8=10] [L60] RET assume_abort_if_not(var_1_6 != 0) VAL [isInitial=1, var_1_1=0, var_1_2=0, var_1_4=3, var_1_5=-5, var_1_6=-2, var_1_7=16, var_1_8=10] [L61] var_1_7 = __VERIFIER_nondet_uchar() [L62] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=3, var_1_5=-5, var_1_6=-2, var_1_8=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=3, var_1_5=-5, var_1_6=-2, var_1_8=10] [L62] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_1=0, var_1_2=0, var_1_4=3, var_1_5=-5, var_1_6=-2, var_1_8=10] [L63] CALL assume_abort_if_not(var_1_7 <= 32) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=3, var_1_5=-5, var_1_6=-2, var_1_7=1, var_1_8=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=3, var_1_5=-5, var_1_6=-2, var_1_7=1, var_1_8=10] [L63] RET assume_abort_if_not(var_1_7 <= 32) VAL [isInitial=1, var_1_1=0, var_1_2=0, var_1_4=3, var_1_5=-5, var_1_6=-2, var_1_7=1, var_1_8=10] [L64] var_1_8 = __VERIFIER_nondet_uchar() [L65] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=3, var_1_5=-5, var_1_6=-2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=3, var_1_5=-5, var_1_6=-2, var_1_7=1] [L65] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_1=0, var_1_2=0, var_1_4=3, var_1_5=-5, var_1_6=-2, var_1_7=1] [L66] CALL assume_abort_if_not(var_1_8 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=3, var_1_5=-5, var_1_6=-2, var_1_7=1, var_1_8=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=3, var_1_5=-5, var_1_6=-2, var_1_7=1, var_1_8=-2] [L66] RET assume_abort_if_not(var_1_8 <= 254) VAL [isInitial=1, var_1_1=0, var_1_2=0, var_1_4=3, var_1_5=-5, var_1_6=-2, var_1_7=1, var_1_8=-2] [L79] RET updateVariables() [L80] CALL step() [L33] EXPR (var_1_5 / var_1_6) >> var_1_7 VAL [isInitial=1, var_1_1=0, var_1_2=0, var_1_4=3, var_1_5=-5, var_1_6=-2, var_1_7=1, var_1_8=-2] [L33] COND TRUE (var_1_3 / var_1_4) >= ((var_1_5 / var_1_6) >> var_1_7) [L34] var_1_1 = ((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))) VAL [isInitial=1, var_1_1=1, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=-5, var_1_6=-2, var_1_7=1, var_1_8=-2] [L80] RET step() [L81] CALL, EXPR property() [L71] EXPR (var_1_5 / var_1_6) >> var_1_7 VAL [isInitial=1, var_1_1=1, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=-5, var_1_6=-2, var_1_7=1, var_1_8=-2] [L71-L72] return ((var_1_3 / var_1_4) >= ((var_1_5 / var_1_6) >> var_1_7)) ? (var_1_1 == ((unsigned char) ((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))))) : (var_1_2 ? (var_1_1 == ((unsigned char) var_1_8)) : (var_1_1 == ((unsigned char) var_1_8))) ; [L81] RET, EXPR property() [L81] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=1, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=-5, var_1_6=-2, var_1_7=1, var_1_8=-2] [L19] reach_error() VAL [isInitial=1, var_1_1=1, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=-5, var_1_6=-2, var_1_7=1, var_1_8=-2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 48 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 6, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 98 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 98 mSDsluCounter, 1033 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 682 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 291 IncrementalHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 351 mSDtfsCounter, 291 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 130 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=4, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 35 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 808 NumberOfCodeBlocks, 808 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 598 ConstructedInterpolants, 0 QuantifiedInterpolants, 1778 SizeOfPredicates, 0 NumberOfNonLiveVariables, 220 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 6 InterpolantComputations, 5 PerfectInterpolantSequences, 2850/2880 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-06 02:09:46,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_amount10_file-29.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 7e3b862ba9a2a4c1c92e3db12119deeccd82c1339b8fd16f8352680fc1302c9d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:09:48,657 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:09:48,738 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 02:09:48,745 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:09:48,745 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:09:48,775 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:09:48,775 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:09:48,775 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:09:48,776 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:09:48,776 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:09:48,776 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:09:48,776 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:09:48,776 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:09:48,776 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:09:48,776 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:09:48,776 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:09:48,776 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:09:48,778 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:09:48,778 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:09:48,778 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:09:48,778 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:09:48,778 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:09:48,779 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:09:48,779 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 02:09:48,779 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 02:09:48,779 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 02:09:48,779 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:09:48,779 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:09:48,779 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:09:48,779 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:09:48,780 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:09:48,780 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:09:48,780 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:09:48,780 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:09:48,780 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:09:48,780 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:09:48,780 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:09:48,780 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:09:48,780 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:09:48,780 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 02:09:48,780 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 02:09:48,780 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:09:48,780 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:09:48,780 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:09:48,780 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:09:48,780 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 -> 7e3b862ba9a2a4c1c92e3db12119deeccd82c1339b8fd16f8352680fc1302c9d [2025-02-06 02:09:49,065 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:09:49,072 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:09:49,074 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:09:49,076 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:09:49,076 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:09:49,078 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-29.i [2025-02-06 02:09:50,340 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7b9d31330/6796a58be59f40638da3d80582665041/FLAGf032af102 [2025-02-06 02:09:50,538 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:09:50,539 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-29.i [2025-02-06 02:09:50,545 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7b9d31330/6796a58be59f40638da3d80582665041/FLAGf032af102 [2025-02-06 02:09:50,561 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7b9d31330/6796a58be59f40638da3d80582665041 [2025-02-06 02:09:50,563 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:09:50,565 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:09:50,566 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:09:50,566 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:09:50,569 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:09:50,570 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:09:50" (1/1) ... [2025-02-06 02:09:50,571 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a73796e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:09:50, skipping insertion in model container [2025-02-06 02:09:50,572 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:09:50" (1/1) ... [2025-02-06 02:09:50,584 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:09:50,694 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_amount10_file-29.i[915,928] [2025-02-06 02:09:50,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:09:50,736 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:09:50,745 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_amount10_file-29.i[915,928] [2025-02-06 02:09:50,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:09:50,770 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:09:50,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:09:50 WrapperNode [2025-02-06 02:09:50,771 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:09:50,772 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:09:50,772 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:09:50,772 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:09:50,777 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:09:50" (1/1) ... [2025-02-06 02:09:50,787 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:09:50" (1/1) ... [2025-02-06 02:09:50,805 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 81 [2025-02-06 02:09:50,807 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:09:50,807 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:09:50,807 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:09:50,807 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:09:50,813 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:09:50" (1/1) ... [2025-02-06 02:09:50,813 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:09:50" (1/1) ... [2025-02-06 02:09:50,816 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:09:50" (1/1) ... [2025-02-06 02:09:50,835 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 02:09:50,835 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:09:50" (1/1) ... [2025-02-06 02:09:50,835 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:09:50" (1/1) ... [2025-02-06 02:09:50,841 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:09:50" (1/1) ... [2025-02-06 02:09:50,846 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:09:50" (1/1) ... [2025-02-06 02:09:50,847 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:09:50" (1/1) ... [2025-02-06 02:09:50,848 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:09:50" (1/1) ... [2025-02-06 02:09:50,849 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:09:50,854 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:09:50,854 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:09:50,854 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:09:50,855 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:09:50" (1/1) ... [2025-02-06 02:09:50,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:09:50,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:09:50,885 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 02:09:50,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 02:09:50,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:09:50,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 02:09:50,909 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:09:50,909 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:09:50,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:09:50,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:09:50,954 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:09:50,956 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:09:51,203 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-02-06 02:09:51,204 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:09:51,211 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:09:51,212 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:09:51,213 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:09:51 BoogieIcfgContainer [2025-02-06 02:09:51,213 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:09:51,215 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:09:51,215 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:09:51,219 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:09:51,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:09:50" (1/3) ... [2025-02-06 02:09:51,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b3d2cc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:09:51, skipping insertion in model container [2025-02-06 02:09:51,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:09:50" (2/3) ... [2025-02-06 02:09:51,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b3d2cc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:09:51, skipping insertion in model container [2025-02-06 02:09:51,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:09:51" (3/3) ... [2025-02-06 02:09:51,223 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-29.i [2025-02-06 02:09:51,234 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:09:51,236 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-29.i that has 2 procedures, 43 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:09:51,278 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:09:51,289 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;@7bcac137, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:09:51,290 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:09:51,293 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 02:09:51,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-06 02:09:51,299 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:09:51,300 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:09:51,301 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:09:51,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:09:51,307 INFO L85 PathProgramCache]: Analyzing trace with hash -729204250, now seen corresponding path program 1 times [2025-02-06 02:09:51,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 02:09:51,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1055830659] [2025-02-06 02:09:51,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:09:51,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:09:51,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:09:51,319 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:09:51,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 02:09:51,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-06 02:09:51,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-06 02:09:51,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:09:51,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:09:51,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:09:51,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:09:51,511 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-02-06 02:09:51,512 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:09:51,512 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 02:09:51,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055830659] [2025-02-06 02:09:51,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055830659] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:09:51,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:09:51,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 02:09:51,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039925682] [2025-02-06 02:09:51,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:09:51,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:09:51,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 02:09:51,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:09:51,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:09:51,537 INFO L87 Difference]: Start difference. First operand has 43 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 02:09:51,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:09:51,556 INFO L93 Difference]: Finished difference Result 80 states and 135 transitions. [2025-02-06 02:09:51,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:09:51,559 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 97 [2025-02-06 02:09:51,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:09:51,564 INFO L225 Difference]: With dead ends: 80 [2025-02-06 02:09:51,564 INFO L226 Difference]: Without dead ends: 40 [2025-02-06 02:09:51,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:09:51,569 INFO L435 NwaCegarLoop]: 57 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, 57 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-02-06 02:09:51,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:09:51,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-02-06 02:09:51,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-02-06 02:09:51,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 02:09:51,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 57 transitions. [2025-02-06 02:09:51,601 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 57 transitions. Word has length 97 [2025-02-06 02:09:51,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:09:51,602 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 57 transitions. [2025-02-06 02:09:51,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 02:09:51,602 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 57 transitions. [2025-02-06 02:09:51,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-06 02:09:51,609 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:09:51,609 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:09:51,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 02:09:51,809 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 [2025-02-06 02:09:51,810 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:09:51,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:09:51,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1644544538, now seen corresponding path program 1 times [2025-02-06 02:09:51,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 02:09:51,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1424473418] [2025-02-06 02:09:51,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:09:51,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:09:51,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:09:51,814 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:09:51,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 02:09:51,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-06 02:09:51,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-06 02:09:51,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:09:51,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:09:51,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 02:09:51,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:09:53,424 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 02:09:53,424 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:09:53,424 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 02:09:53,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424473418] [2025-02-06 02:09:53,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424473418] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:09:53,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:09:53,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:09:53,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021481435] [2025-02-06 02:09:53,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:09:53,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:09:53,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 02:09:53,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:09:53,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:09:53,427 INFO L87 Difference]: Start difference. First operand 40 states and 57 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:09:54,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:09:54,660 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2025-02-06 02:09:54,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:09:54,667 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 97 [2025-02-06 02:09:54,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:09:54,669 INFO L225 Difference]: With dead ends: 55 [2025-02-06 02:09:54,669 INFO L226 Difference]: Without dead ends: 53 [2025-02-06 02:09:54,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:09:54,670 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 13 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 02:09:54,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 221 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 02:09:54,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-02-06 02:09:54,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2025-02-06 02:09:54,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 31 states have (on average 1.096774193548387) internal successors, (34), 32 states have internal predecessors, (34), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 02:09:54,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 70 transitions. [2025-02-06 02:09:54,679 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 70 transitions. Word has length 97 [2025-02-06 02:09:54,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:09:54,679 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 70 transitions. [2025-02-06 02:09:54,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:09:54,679 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 70 transitions. [2025-02-06 02:09:54,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-06 02:09:54,680 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:09:54,680 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:09:54,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 02:09:54,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:09:54,882 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:09:54,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:09:54,882 INFO L85 PathProgramCache]: Analyzing trace with hash 646522910, now seen corresponding path program 1 times [2025-02-06 02:09:54,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 02:09:54,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [182480896] [2025-02-06 02:09:54,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:09:54,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:09:54,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:09:54,885 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:09:54,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 02:09:54,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-06 02:09:54,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-06 02:09:54,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:09:54,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:09:54,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 02:09:54,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:09:56,456 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 02:09:56,456 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:09:56,456 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 02:09:56,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182480896] [2025-02-06 02:09:56,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182480896] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:09:56,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:09:56,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:09:56,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312954321] [2025-02-06 02:09:56,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:09:56,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 02:09:56,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 02:09:56,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 02:09:56,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:09:56,457 INFO L87 Difference]: Start difference. First operand 52 states and 70 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:09:57,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:09:57,915 INFO L93 Difference]: Finished difference Result 61 states and 80 transitions. [2025-02-06 02:09:57,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 02:09:57,925 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 98 [2025-02-06 02:09:57,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:09:57,928 INFO L225 Difference]: With dead ends: 61 [2025-02-06 02:09:57,929 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 02:09:57,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:09:57,930 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 23 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 02:09:57,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 224 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 02:09:57,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 02:09:57,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 02:09:57,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 02:09:57,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 02:09:57,930 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 98 [2025-02-06 02:09:57,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:09:57,931 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 02:09:57,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:09:57,931 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 02:09:57,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 02:09:57,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 02:09:57,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 02:09:58,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:09:58,138 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-06 02:09:58,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 02:09:58,656 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 02:09:58,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 02:09:58 BoogieIcfgContainer [2025-02-06 02:09:58,663 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 02:09:58,664 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 02:09:58,664 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 02:09:58,664 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 02:09:58,664 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:09:51" (3/4) ... [2025-02-06 02:09:58,666 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 02:09:58,670 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-02-06 02:09:58,673 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-02-06 02:09:58,674 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-06 02:09:58,674 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 02:09:58,674 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 02:09:58,736 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 02:09:58,737 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 02:09:58,737 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 02:09:58,738 INFO L158 Benchmark]: Toolchain (without parser) took 8172.96ms. Allocated memory is still 117.4MB. Free memory was 92.4MB in the beginning and 77.9MB in the end (delta: 14.4MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2025-02-06 02:09:58,738 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 83.9MB. Free memory is still 62.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:09:58,738 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.78ms. Allocated memory is still 117.4MB. Free memory was 92.2MB in the beginning and 79.8MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 02:09:58,739 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.41ms. Allocated memory is still 117.4MB. Free memory was 79.8MB in the beginning and 78.5MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 02:09:58,739 INFO L158 Benchmark]: Boogie Preprocessor took 42.12ms. Allocated memory is still 117.4MB. Free memory was 78.5MB in the beginning and 76.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:09:58,739 INFO L158 Benchmark]: IcfgBuilder took 358.98ms. Allocated memory is still 117.4MB. Free memory was 76.9MB in the beginning and 63.9MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 02:09:58,740 INFO L158 Benchmark]: TraceAbstraction took 7448.14ms. Allocated memory is still 117.4MB. Free memory was 63.2MB in the beginning and 84.6MB in the end (delta: -21.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:09:58,740 INFO L158 Benchmark]: Witness Printer took 73.35ms. Allocated memory is still 117.4MB. Free memory was 84.6MB in the beginning and 77.9MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 02:09:58,741 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 83.9MB. Free memory is still 62.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 205.78ms. Allocated memory is still 117.4MB. Free memory was 92.2MB in the beginning and 79.8MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.41ms. Allocated memory is still 117.4MB. Free memory was 79.8MB in the beginning and 78.5MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.12ms. Allocated memory is still 117.4MB. Free memory was 78.5MB in the beginning and 76.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 358.98ms. Allocated memory is still 117.4MB. Free memory was 76.9MB in the beginning and 63.9MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 7448.14ms. Allocated memory is still 117.4MB. Free memory was 63.2MB in the beginning and 84.6MB in the end (delta: -21.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 73.35ms. Allocated memory is still 117.4MB. Free memory was 84.6MB in the beginning and 77.9MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.9s, OverallIterations: 3, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 36 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 36 mSDsluCounter, 502 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 315 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 72 IncrementalHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 187 mSDtfsCounter, 72 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 293 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=2, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 292 NumberOfCodeBlocks, 292 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 289 ConstructedInterpolants, 0 QuantifiedInterpolants, 361 SizeOfPredicates, 14 NumberOfNonLiveVariables, 460 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 1440/1440 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 02:09:58,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE