./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 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-29.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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-?-8fc3dc6-m [2025-03-17 04:22:21,359 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 04:22:21,409 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 04:22:21,417 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 04:22:21,417 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 04:22:21,439 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 04:22:21,440 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 04:22:21,440 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 04:22:21,440 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 04:22:21,440 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 04:22:21,441 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 04:22:21,441 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 04:22:21,441 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 04:22:21,441 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 04:22:21,441 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 04:22:21,441 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 04:22:21,441 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 04:22:21,441 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 04:22:21,441 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 04:22:21,441 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 04:22:21,441 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 04:22:21,441 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 04:22:21,443 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 04:22:21,443 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 04:22:21,443 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 04:22:21,443 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 04:22:21,443 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 04:22:21,443 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 04:22:21,443 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 04:22:21,443 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 04:22:21,444 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 04:22:21,444 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 04:22:21,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:22:21,444 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 04:22:21,444 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 04:22:21,444 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 04:22:21,444 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 04:22:21,444 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 04:22:21,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 04:22:21,444 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 04:22:21,444 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 04:22:21,444 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 04:22:21,444 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 04:22:21,444 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/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-03-17 04:22:21,707 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 04:22:21,715 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 04:22:21,717 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 04:22:21,718 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 04:22:21,719 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 04:22:21,720 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-29.i [2025-03-17 04:22:22,973 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17ad6f6a2/1a94abf3596e45cfa9b401ae83ef0271/FLAG2bcf1d167 [2025-03-17 04:22:23,184 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 04:22:23,184 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-29.i [2025-03-17 04:22:23,197 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17ad6f6a2/1a94abf3596e45cfa9b401ae83ef0271/FLAG2bcf1d167 [2025-03-17 04:22:23,216 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17ad6f6a2/1a94abf3596e45cfa9b401ae83ef0271 [2025-03-17 04:22:23,220 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 04:22:23,221 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 04:22:23,222 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 04:22:23,222 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 04:22:23,228 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 04:22:23,229 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:22:23" (1/1) ... [2025-03-17 04:22:23,229 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40b21774 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:23, skipping insertion in model container [2025-03-17 04:22:23,231 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:22:23" (1/1) ... [2025-03-17 04:22:23,248 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 04:22:23,375 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-29.i[915,928] [2025-03-17 04:22:23,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:22:23,420 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 04:22:23,429 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-29.i[915,928] [2025-03-17 04:22:23,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:22:23,450 INFO L204 MainTranslator]: Completed translation [2025-03-17 04:22:23,452 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:23 WrapperNode [2025-03-17 04:22:23,452 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 04:22:23,453 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 04:22:23,453 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 04:22:23,453 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 04:22:23,458 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:23" (1/1) ... [2025-03-17 04:22:23,469 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:23" (1/1) ... [2025-03-17 04:22:23,488 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 97 [2025-03-17 04:22:23,489 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 04:22:23,489 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 04:22:23,489 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 04:22:23,490 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 04:22:23,496 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:23" (1/1) ... [2025-03-17 04:22:23,497 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:23" (1/1) ... [2025-03-17 04:22:23,498 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:23" (1/1) ... [2025-03-17 04:22:23,509 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-03-17 04:22:23,510 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:23" (1/1) ... [2025-03-17 04:22:23,510 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:23" (1/1) ... [2025-03-17 04:22:23,513 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:23" (1/1) ... [2025-03-17 04:22:23,514 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:23" (1/1) ... [2025-03-17 04:22:23,515 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:23" (1/1) ... [2025-03-17 04:22:23,516 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:23" (1/1) ... [2025-03-17 04:22:23,518 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 04:22:23,518 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 04:22:23,518 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 04:22:23,519 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 04:22:23,520 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:23" (1/1) ... [2025-03-17 04:22:23,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:22:23,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:22:23,548 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 04:22:23,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 04:22:23,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 04:22:23,572 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 04:22:23,572 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 04:22:23,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 04:22:23,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 04:22:23,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 04:22:23,626 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 04:22:23,628 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 04:22:23,786 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L71: havoc property_#t~bitwise12#1; [2025-03-17 04:22:23,803 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-17 04:22:23,804 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 04:22:23,818 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 04:22:23,818 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 04:22:23,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:22:23 BoogieIcfgContainer [2025-03-17 04:22:23,819 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 04:22:23,821 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 04:22:23,821 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 04:22:23,825 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 04:22:23,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:22:23" (1/3) ... [2025-03-17 04:22:23,826 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62564cc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:22:23, skipping insertion in model container [2025-03-17 04:22:23,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:23" (2/3) ... [2025-03-17 04:22:23,827 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62564cc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:22:23, skipping insertion in model container [2025-03-17 04:22:23,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:22:23" (3/3) ... [2025-03-17 04:22:23,828 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-29.i [2025-03-17 04:22:23,842 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 04:22:23,844 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-29.i that has 2 procedures, 44 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 04:22:23,880 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 04:22:23,888 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;@2e4ab46a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 04:22:23,888 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 04:22:23,892 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 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-03-17 04:22:23,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-17 04:22:23,902 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:22:23,902 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-03-17 04:22:23,903 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:22:23,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:22:23,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1356323270, now seen corresponding path program 1 times [2025-03-17 04:22:23,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:22:23,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990624900] [2025-03-17 04:22:23,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:22:23,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:22:23,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-17 04:22:24,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-17 04:22:24,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:22:24,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:22:24,142 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-17 04:22:24,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:22:24,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990624900] [2025-03-17 04:22:24,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990624900] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:22:24,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840484913] [2025-03-17 04:22:24,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:22:24,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:22:24,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:22:24,147 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 04:22:24,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 04:22:24,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-17 04:22:24,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-17 04:22:24,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:22:24,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:22:24,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 04:22:24,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:22:24,289 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-17 04:22:24,291 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:22:24,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840484913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:22:24,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 04:22:24,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 04:22:24,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973727736] [2025-03-17 04:22:24,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:22:24,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 04:22:24,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:22:24,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 04:22:24,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:22:24,315 INFO L87 Difference]: Start difference. First operand has 44 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 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-03-17 04:22:24,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:22:24,340 INFO L93 Difference]: Finished difference Result 85 states and 144 transitions. [2025-03-17 04:22:24,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 04:22:24,342 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-03-17 04:22:24,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:22:24,348 INFO L225 Difference]: With dead ends: 85 [2025-03-17 04:22:24,348 INFO L226 Difference]: Without dead ends: 42 [2025-03-17 04:22:24,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 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-03-17 04:22:24,355 INFO L435 NwaCegarLoop]: 59 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, 59 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-03-17 04:22:24,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:22:24,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-17 04:22:24,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-03-17 04:22:24,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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-03-17 04:22:24,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 61 transitions. [2025-03-17 04:22:24,392 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 61 transitions. Word has length 97 [2025-03-17 04:22:24,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:22:24,392 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 61 transitions. [2025-03-17 04:22:24,392 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-03-17 04:22:24,392 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 61 transitions. [2025-03-17 04:22:24,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-17 04:22:24,395 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:22:24,395 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-03-17 04:22:24,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 04:22:24,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 04:22:24,596 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:22:24,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:22:24,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1201165766, now seen corresponding path program 1 times [2025-03-17 04:22:24,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:22:24,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879058387] [2025-03-17 04:22:24,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:22:24,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:22:24,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-17 04:22:24,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-17 04:22:24,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:22:24,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:22:26,217 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 04:22:26,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:22:26,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879058387] [2025-03-17 04:22:26,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879058387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:22:26,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:22:26,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 04:22:26,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361088907] [2025-03-17 04:22:26,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:22:26,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 04:22:26,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:22:26,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 04:22:26,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 04:22:26,220 INFO L87 Difference]: Start difference. First operand 42 states and 61 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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-03-17 04:22:26,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:22:26,945 INFO L93 Difference]: Finished difference Result 60 states and 82 transitions. [2025-03-17 04:22:26,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 04:22:26,946 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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-03-17 04:22:26,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:22:26,948 INFO L225 Difference]: With dead ends: 60 [2025-03-17 04:22:26,949 INFO L226 Difference]: Without dead ends: 58 [2025-03-17 04:22:26,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 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-03-17 04:22:26,950 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 15 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 303 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.4s IncrementalHoareTripleChecker+Time [2025-03-17 04:22:26,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 303 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 04:22:26,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-17 04:22:26,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2025-03-17 04:22:26,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 37 states have internal predecessors, (43), 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-03-17 04:22:26,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 79 transitions. [2025-03-17 04:22:26,972 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 79 transitions. Word has length 97 [2025-03-17 04:22:26,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:22:26,972 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 79 transitions. [2025-03-17 04:22:26,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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-03-17 04:22:26,972 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 79 transitions. [2025-03-17 04:22:26,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-17 04:22:26,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:22:26,974 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-03-17 04:22:26,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 04:22:26,974 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:22:26,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:22:26,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1405435607, now seen corresponding path program 1 times [2025-03-17 04:22:26,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:22:26,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370170903] [2025-03-17 04:22:26,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:22:26,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:22:26,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 04:22:27,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 04:22:27,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:22:27,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:22:27,756 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 04:22:27,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:22:27,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370170903] [2025-03-17 04:22:27,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370170903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:22:27,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:22:27,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 04:22:27,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917822864] [2025-03-17 04:22:27,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:22:27,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 04:22:27,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:22:27,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 04:22:27,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 04:22:27,758 INFO L87 Difference]: Start difference. First operand 57 states and 79 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 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-03-17 04:22:28,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:22:28,426 INFO L93 Difference]: Finished difference Result 80 states and 105 transitions. [2025-03-17 04:22:28,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 04:22:28,429 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 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-03-17 04:22:28,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:22:28,434 INFO L225 Difference]: With dead ends: 80 [2025-03-17 04:22:28,434 INFO L226 Difference]: Without dead ends: 78 [2025-03-17 04:22:28,434 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-03-17 04:22:28,435 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 20 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 381 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.5s IncrementalHoareTripleChecker+Time [2025-03-17 04:22:28,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 381 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 04:22:28,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-17 04:22:28,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 64. [2025-03-17 04:22:28,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 44 states have internal predecessors, (53), 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-03-17 04:22:28,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 89 transitions. [2025-03-17 04:22:28,452 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 89 transitions. Word has length 98 [2025-03-17 04:22:28,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:22:28,452 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 89 transitions. [2025-03-17 04:22:28,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 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-03-17 04:22:28,455 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 89 transitions. [2025-03-17 04:22:28,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-17 04:22:28,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:22:28,457 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-03-17 04:22:28,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 04:22:28,457 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:22:28,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:22:28,457 INFO L85 PathProgramCache]: Analyzing trace with hash 194711286, now seen corresponding path program 1 times [2025-03-17 04:22:28,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:22:28,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686494394] [2025-03-17 04:22:28,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:22:28,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:22:28,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 04:22:28,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 04:22:28,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:22:28,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:22:28,880 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 04:22:28,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:22:28,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686494394] [2025-03-17 04:22:28,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686494394] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:22:28,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:22:28,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:22:28,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567718041] [2025-03-17 04:22:28,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:22:28,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:22:28,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:22:28,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:22:28,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:22:28,881 INFO L87 Difference]: Start difference. First operand 64 states and 89 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-03-17 04:22:28,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:22:28,938 INFO L93 Difference]: Finished difference Result 153 states and 210 transitions. [2025-03-17 04:22:28,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:22:28,940 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-03-17 04:22:28,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:22:28,941 INFO L225 Difference]: With dead ends: 153 [2025-03-17 04:22:28,941 INFO L226 Difference]: Without dead ends: 90 [2025-03-17 04:22:28,942 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-03-17 04:22:28,942 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 30 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 128 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-03-17 04:22:28,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 128 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:22:28,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-17 04:22:28,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2025-03-17 04:22:28,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 57 states have (on average 1.1578947368421053) internal successors, (66), 60 states have internal predecessors, (66), 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-03-17 04:22:28,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 120 transitions. [2025-03-17 04:22:28,966 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 120 transitions. Word has length 98 [2025-03-17 04:22:28,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:22:28,966 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 120 transitions. [2025-03-17 04:22:28,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-03-17 04:22:28,966 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 120 transitions. [2025-03-17 04:22:28,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 04:22:28,967 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:22:28,967 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] [2025-03-17 04:22:28,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 04:22:28,967 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:22:28,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:22:28,970 INFO L85 PathProgramCache]: Analyzing trace with hash 775920756, now seen corresponding path program 1 times [2025-03-17 04:22:28,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:22:28,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144162236] [2025-03-17 04:22:28,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:22:28,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:22:28,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 04:22:29,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 04:22:29,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:22:29,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:22:29,291 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 04:22:29,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:22:29,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144162236] [2025-03-17 04:22:29,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144162236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:22:29,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:22:29,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:22:29,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666110177] [2025-03-17 04:22:29,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:22:29,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:22:29,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:22:29,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:22:29,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:22:29,292 INFO L87 Difference]: Start difference. First operand 89 states and 120 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-03-17 04:22:29,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:22:29,342 INFO L93 Difference]: Finished difference Result 163 states and 220 transitions. [2025-03-17 04:22:29,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:22:29,343 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 99 [2025-03-17 04:22:29,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:22:29,344 INFO L225 Difference]: With dead ends: 163 [2025-03-17 04:22:29,344 INFO L226 Difference]: Without dead ends: 78 [2025-03-17 04:22:29,344 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-03-17 04:22:29,344 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 27 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 99 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-03-17 04:22:29,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 99 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:22:29,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-17 04:22:29,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 61. [2025-03-17 04:22:29,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 40 states have internal predecessors, (45), 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-03-17 04:22:29,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 81 transitions. [2025-03-17 04:22:29,361 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 81 transitions. Word has length 99 [2025-03-17 04:22:29,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:22:29,362 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 81 transitions. [2025-03-17 04:22:29,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-03-17 04:22:29,363 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2025-03-17 04:22:29,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 04:22:29,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:22:29,363 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] [2025-03-17 04:22:29,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 04:22:29,364 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:22:29,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:22:29,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1898172469, now seen corresponding path program 1 times [2025-03-17 04:22:29,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:22:29,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400029858] [2025-03-17 04:22:29,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:22:29,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:22:29,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 04:22:29,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 04:22:29,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:22:29,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 04:22:29,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1190805429] [2025-03-17 04:22:29,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:22:29,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:22:29,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:22:29,408 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 04:22:29,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 04:22:29,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 04:22:29,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 04:22:29,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:22:29,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 04:22:29,467 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 04:22:29,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 04:22:29,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 04:22:29,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:22:29,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 04:22:29,521 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 04:22:29,521 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 04:22:29,522 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 04:22:29,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 04:22:29,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-17 04:22:29,727 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-17 04:22:29,761 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 04:22:29,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 04:22:29 BoogieIcfgContainer [2025-03-17 04:22:29,766 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 04:22:29,766 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 04:22:29,766 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 04:22:29,766 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 04:22:29,767 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:22:23" (3/4) ... [2025-03-17 04:22:29,768 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 04:22:29,769 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 04:22:29,771 INFO L158 Benchmark]: Toolchain (without parser) took 6548.51ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 111.9MB in the beginning and 231.1MB in the end (delta: -119.2MB). Peak memory consumption was 161.2MB. Max. memory is 16.1GB. [2025-03-17 04:22:29,771 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:22:29,771 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.36ms. Allocated memory is still 142.6MB. Free memory was 111.4MB in the beginning and 99.7MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:22:29,772 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.83ms. Allocated memory is still 142.6MB. Free memory was 99.7MB in the beginning and 97.7MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:22:29,772 INFO L158 Benchmark]: Boogie Preprocessor took 28.34ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 95.2MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:22:29,773 INFO L158 Benchmark]: IcfgBuilder took 300.61ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 78.5MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 04:22:29,773 INFO L158 Benchmark]: TraceAbstraction took 5945.10ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 78.0MB in the beginning and 231.1MB in the end (delta: -153.1MB). Peak memory consumption was 127.6MB. Max. memory is 16.1GB. [2025-03-17 04:22:29,773 INFO L158 Benchmark]: Witness Printer took 2.58ms. Allocated memory is still 427.8MB. Free memory is still 231.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:22:29,774 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.23ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 230.36ms. Allocated memory is still 142.6MB. Free memory was 111.4MB in the beginning and 99.7MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.83ms. Allocated memory is still 142.6MB. Free memory was 99.7MB in the beginning and 97.7MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.34ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 95.2MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 300.61ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 78.5MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5945.10ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 78.0MB in the beginning and 231.1MB in the end (delta: -153.1MB). Peak memory consumption was 127.6MB. Max. memory is 16.1GB. * Witness Printer took 2.58ms. Allocated memory is still 427.8MB. Free memory is still 231.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 33, overapproximation of shiftRight at line 71. 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; [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=2, 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=2, 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=2, 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=2, var_1_5=-10, 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=2, var_1_5=-10, 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=2, var_1_5=-10, 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=2, var_1_5=-10, 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=2, var_1_5=-10, 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=2, var_1_5=-10, 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=2, var_1_5=-10, var_1_6=-3, 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=2, var_1_5=-10, var_1_6=-3, 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=2, var_1_5=-10, var_1_6=-3, 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=2, var_1_5=-10, var_1_6=-3, 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=2, var_1_5=-10, var_1_6=-3, 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=2, var_1_5=-10, var_1_6=-3, 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=2, var_1_5=-10, var_1_6=-3, 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=2, var_1_5=-10, var_1_6=-3, 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=2, var_1_5=-10, var_1_6=-3, 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=2, var_1_5=-10, var_1_6=-3, 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=2, var_1_5=-10, var_1_6=-3, 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=2, var_1_5=-10, var_1_6=-3, 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=2, var_1_5=-10, var_1_6=-3, 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=2, var_1_5=-10, var_1_6=-3, 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=2, var_1_5=-10, var_1_6=-3, 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=2, var_1_5=-10, var_1_6=-3, 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=2, var_1_5=-10, var_1_6=-3, 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=2, var_1_5=-10, var_1_6=-3, 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=2, var_1_5=-10, var_1_6=-3, 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=2, var_1_5=-10, var_1_6=-3, 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=2, var_1_5=-10, var_1_6=-3, 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=2, var_1_5=-10, var_1_6=-3, 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=-254, var_1_4=2, var_1_5=-10, var_1_6=-3, 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=-254, var_1_4=2, var_1_5=-10, var_1_6=-3, 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=-254, var_1_4=2, var_1_5=-10, var_1_6=-3, 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=-254, var_1_4=2, var_1_5=-10, var_1_6=-3, var_1_7=1, var_1_8=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 44 locations, 81 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.9s, OverallIterations: 6, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 92 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 92 mSDsluCounter, 970 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 637 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 291 IncrementalHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 333 mSDtfsCounter, 291 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred 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, 33 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 784 NumberOfCodeBlocks, 784 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 580 ConstructedInterpolants, 0 QuantifiedInterpolants, 1785 SizeOfPredicates, 0 NumberOfNonLiveVariables, 216 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-03-17 04:22:29,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-29.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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-?-8fc3dc6-m [2025-03-17 04:22:31,899 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 04:22:31,998 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 04:22:32,006 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 04:22:32,007 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 04:22:32,032 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 04:22:32,034 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 04:22:32,034 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 04:22:32,035 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 04:22:32,035 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 04:22:32,036 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 04:22:32,036 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 04:22:32,037 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 04:22:32,037 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 04:22:32,037 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 04:22:32,037 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 04:22:32,037 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 04:22:32,037 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 04:22:32,037 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 04:22:32,038 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 04:22:32,038 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 04:22:32,038 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 04:22:32,038 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 04:22:32,038 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 04:22:32,039 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 04:22:32,039 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 04:22:32,039 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 04:22:32,039 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 04:22:32,039 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 04:22:32,039 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 04:22:32,039 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 04:22:32,039 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 04:22:32,039 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 04:22:32,040 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 04:22:32,040 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:22:32,040 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 04:22:32,040 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 04:22:32,040 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 04:22:32,041 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 04:22:32,041 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 04:22:32,041 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 04:22:32,041 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 04:22:32,041 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 04:22:32,041 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 04:22:32,041 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 04:22:32,041 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/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-03-17 04:22:32,316 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 04:22:32,321 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 04:22:32,323 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 04:22:32,324 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 04:22:32,324 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 04:22:32,325 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-29.i [2025-03-17 04:22:33,609 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89c21c0e0/f443c5077bcf4ba6b854a7481043d559/FLAGe8a040bc1 [2025-03-17 04:22:33,840 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 04:22:33,840 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-29.i [2025-03-17 04:22:33,846 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89c21c0e0/f443c5077bcf4ba6b854a7481043d559/FLAGe8a040bc1 [2025-03-17 04:22:33,863 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89c21c0e0/f443c5077bcf4ba6b854a7481043d559 [2025-03-17 04:22:33,865 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 04:22:33,866 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 04:22:33,868 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 04:22:33,868 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 04:22:33,872 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 04:22:33,872 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:22:33" (1/1) ... [2025-03-17 04:22:33,874 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dfc3084 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:33, skipping insertion in model container [2025-03-17 04:22:33,875 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:22:33" (1/1) ... [2025-03-17 04:22:33,888 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 04:22:34,016 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-29.i[915,928] [2025-03-17 04:22:34,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:22:34,057 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 04:22:34,065 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-29.i[915,928] [2025-03-17 04:22:34,079 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:22:34,095 INFO L204 MainTranslator]: Completed translation [2025-03-17 04:22:34,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:34 WrapperNode [2025-03-17 04:22:34,096 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 04:22:34,097 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 04:22:34,097 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 04:22:34,098 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 04:22:34,102 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:34" (1/1) ... [2025-03-17 04:22:34,113 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:34" (1/1) ... [2025-03-17 04:22:34,128 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 81 [2025-03-17 04:22:34,129 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 04:22:34,129 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 04:22:34,129 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 04:22:34,129 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 04:22:34,136 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:34" (1/1) ... [2025-03-17 04:22:34,137 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:34" (1/1) ... [2025-03-17 04:22:34,139 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:34" (1/1) ... [2025-03-17 04:22:34,150 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-03-17 04:22:34,151 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:34" (1/1) ... [2025-03-17 04:22:34,151 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:34" (1/1) ... [2025-03-17 04:22:34,161 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:34" (1/1) ... [2025-03-17 04:22:34,165 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:34" (1/1) ... [2025-03-17 04:22:34,166 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:34" (1/1) ... [2025-03-17 04:22:34,166 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:34" (1/1) ... [2025-03-17 04:22:34,168 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 04:22:34,168 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 04:22:34,168 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 04:22:34,168 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 04:22:34,173 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:34" (1/1) ... [2025-03-17 04:22:34,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:22:34,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:22:34,198 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 04:22:34,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 04:22:34,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 04:22:34,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 04:22:34,220 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 04:22:34,220 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 04:22:34,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 04:22:34,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 04:22:34,281 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 04:22:34,283 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 04:22:34,484 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-17 04:22:34,485 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 04:22:34,492 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 04:22:34,492 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 04:22:34,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:22:34 BoogieIcfgContainer [2025-03-17 04:22:34,493 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 04:22:34,495 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 04:22:34,495 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 04:22:34,498 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 04:22:34,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:22:33" (1/3) ... [2025-03-17 04:22:34,499 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14f51bda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:22:34, skipping insertion in model container [2025-03-17 04:22:34,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:34" (2/3) ... [2025-03-17 04:22:34,499 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14f51bda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:22:34, skipping insertion in model container [2025-03-17 04:22:34,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:22:34" (3/3) ... [2025-03-17 04:22:34,500 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-29.i [2025-03-17 04:22:34,510 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 04:22:34,511 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-29.i that has 2 procedures, 38 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 04:22:34,544 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 04:22:34,551 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;@503dbdb4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 04:22:34,552 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 04:22:34,554 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 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-03-17 04:22:34,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-17 04:22:34,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:22:34,562 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] [2025-03-17 04:22:34,562 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:22:34,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:22:34,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1215332124, now seen corresponding path program 1 times [2025-03-17 04:22:34,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 04:22:34,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [503932445] [2025-03-17 04:22:34,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:22:34,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:22:34,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:22:34,577 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 04:22:34,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 04:22:34,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 04:22:34,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 04:22:34,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:22:34,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:22:34,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 04:22:34,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:22:34,733 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-17 04:22:34,733 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:22:34,733 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 04:22:34,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503932445] [2025-03-17 04:22:34,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503932445] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:22:34,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:22:34,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 04:22:34,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654271815] [2025-03-17 04:22:34,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:22:34,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 04:22:34,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 04:22:34,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 04:22:34,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:22:34,753 INFO L87 Difference]: Start difference. First operand has 38 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 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) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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-03-17 04:22:34,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:22:34,767 INFO L93 Difference]: Finished difference Result 73 states and 128 transitions. [2025-03-17 04:22:34,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 04:22:34,769 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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 93 [2025-03-17 04:22:34,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:22:34,773 INFO L225 Difference]: With dead ends: 73 [2025-03-17 04:22:34,774 INFO L226 Difference]: Without dead ends: 36 [2025-03-17 04:22:34,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 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-03-17 04:22:34,778 INFO L435 NwaCegarLoop]: 53 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, 53 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-03-17 04:22:34,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:22:34,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-17 04:22:34,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-17 04:22:34,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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-03-17 04:22:34,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. [2025-03-17 04:22:34,809 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 53 transitions. Word has length 93 [2025-03-17 04:22:34,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:22:34,810 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 53 transitions. [2025-03-17 04:22:34,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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-03-17 04:22:34,811 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 53 transitions. [2025-03-17 04:22:34,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-17 04:22:34,813 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:22:34,814 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] [2025-03-17 04:22:34,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 04:22:35,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:22:35,015 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:22:35,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:22:35,015 INFO L85 PathProgramCache]: Analyzing trace with hash 971898084, now seen corresponding path program 1 times [2025-03-17 04:22:35,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 04:22:35,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [652491719] [2025-03-17 04:22:35,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:22:35,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:22:35,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:22:35,018 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 04:22:35,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 04:22:35,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 04:22:35,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 04:22:35,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:22:35,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:22:35,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 04:22:35,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:22:36,805 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 04:22:36,806 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:22:36,806 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 04:22:36,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652491719] [2025-03-17 04:22:36,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652491719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:22:36,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:22:36,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:22:36,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589903626] [2025-03-17 04:22:36,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:22:36,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:22:36,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 04:22:36,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:22:36,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:22:36,810 INFO L87 Difference]: Start difference. First operand 36 states and 53 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-03-17 04:22:38,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:22:38,063 INFO L93 Difference]: Finished difference Result 49 states and 67 transitions. [2025-03-17 04:22:38,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:22:38,070 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 93 [2025-03-17 04:22:38,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:22:38,072 INFO L225 Difference]: With dead ends: 49 [2025-03-17 04:22:38,072 INFO L226 Difference]: Without dead ends: 47 [2025-03-17 04:22:38,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:22:38,072 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 11 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 04:22:38,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 145 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 04:22:38,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-17 04:22:38,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2025-03-17 04:22:38,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 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-03-17 04:22:38,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 64 transitions. [2025-03-17 04:22:38,083 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 64 transitions. Word has length 93 [2025-03-17 04:22:38,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:22:38,084 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 64 transitions. [2025-03-17 04:22:38,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-03-17 04:22:38,084 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 64 transitions. [2025-03-17 04:22:38,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-17 04:22:38,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:22:38,086 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] [2025-03-17 04:22:38,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 04:22:38,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:22:38,287 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:22:38,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:22:38,288 INFO L85 PathProgramCache]: Analyzing trace with hash 66901633, now seen corresponding path program 1 times [2025-03-17 04:22:38,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 04:22:38,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [942316835] [2025-03-17 04:22:38,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:22:38,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:22:38,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:22:38,291 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 04:22:38,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 04:22:38,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 04:22:38,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 04:22:38,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:22:38,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:22:38,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 04:22:38,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:22:39,866 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 04:22:39,866 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:22:39,867 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 04:22:39,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942316835] [2025-03-17 04:22:39,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942316835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:22:39,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:22:39,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:22:39,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410441192] [2025-03-17 04:22:39,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:22:39,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:22:39,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 04:22:39,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:22:39,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:22:39,868 INFO L87 Difference]: Start difference. First operand 46 states and 64 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-03-17 04:22:40,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:22:40,949 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2025-03-17 04:22:40,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 04:22:40,955 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 94 [2025-03-17 04:22:40,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:22:40,956 INFO L225 Difference]: With dead ends: 54 [2025-03-17 04:22:40,956 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 04:22:40,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 04:22:40,957 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 19 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 04:22:40,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 146 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 04:22:40,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 04:22:40,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 04:22:40,959 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-03-17 04:22:40,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 04:22:40,959 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 94 [2025-03-17 04:22:40,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:22:40,959 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 04:22:40,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-03-17 04:22:40,960 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 04:22:40,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 04:22:40,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 04:22:40,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 04:22:41,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:22:41,167 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-17 04:22:41,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 04:22:41,719 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 04:22:41,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 04:22:41 BoogieIcfgContainer [2025-03-17 04:22:41,726 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 04:22:41,728 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 04:22:41,729 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 04:22:41,729 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 04:22:41,730 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:22:34" (3/4) ... [2025-03-17 04:22:41,731 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 04:22:41,735 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-17 04:22:41,739 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-03-17 04:22:41,740 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-17 04:22:41,740 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 04:22:41,740 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 04:22:41,801 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 04:22:41,801 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 04:22:41,801 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 04:22:41,802 INFO L158 Benchmark]: Toolchain (without parser) took 7935.82ms. Allocated memory was 83.9MB in the beginning and 125.8MB in the end (delta: 41.9MB). Free memory was 59.9MB in the beginning and 91.5MB in the end (delta: -31.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2025-03-17 04:22:41,802 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 83.9MB. Free memory is still 62.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:22:41,802 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.73ms. Allocated memory is still 83.9MB. Free memory was 59.9MB in the beginning and 47.7MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:22:41,803 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.57ms. Allocated memory is still 83.9MB. Free memory was 47.7MB in the beginning and 46.3MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:22:41,803 INFO L158 Benchmark]: Boogie Preprocessor took 38.57ms. Allocated memory is still 83.9MB. Free memory was 46.0MB in the beginning and 44.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:22:41,803 INFO L158 Benchmark]: IcfgBuilder took 324.72ms. Allocated memory is still 83.9MB. Free memory was 44.4MB in the beginning and 31.8MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:22:41,803 INFO L158 Benchmark]: TraceAbstraction took 7231.73ms. Allocated memory was 83.9MB in the beginning and 125.8MB in the end (delta: 41.9MB). Free memory was 31.2MB in the beginning and 97.1MB in the end (delta: -65.9MB). Peak memory consumption was 46.6MB. Max. memory is 16.1GB. [2025-03-17 04:22:41,803 INFO L158 Benchmark]: Witness Printer took 72.77ms. Allocated memory is still 125.8MB. Free memory was 97.1MB in the beginning and 91.5MB in the end (delta: 5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:22:41,805 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.14ms. Allocated memory is still 83.9MB. Free memory is still 62.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 228.73ms. Allocated memory is still 83.9MB. Free memory was 59.9MB in the beginning and 47.7MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.57ms. Allocated memory is still 83.9MB. Free memory was 47.7MB in the beginning and 46.3MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.57ms. Allocated memory is still 83.9MB. Free memory was 46.0MB in the beginning and 44.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 324.72ms. Allocated memory is still 83.9MB. Free memory was 44.4MB in the beginning and 31.8MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 7231.73ms. Allocated memory was 83.9MB in the beginning and 125.8MB in the end (delta: 41.9MB). Free memory was 31.2MB in the beginning and 97.1MB in the end (delta: -65.9MB). Peak memory consumption was 46.6MB. Max. memory is 16.1GB. * Witness Printer took 72.77ms. Allocated memory is still 125.8MB. Free memory was 97.1MB in the beginning and 91.5MB in the end (delta: 5.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, 38 locations, 73 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.6s, OverallIterations: 3, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 30 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 30 mSDsluCounter, 344 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 170 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 61 IncrementalHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 174 mSDtfsCounter, 61 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 279 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=2, InterpolantAutomatonStates: 11, 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.1s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 280 NumberOfCodeBlocks, 280 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 277 ConstructedInterpolants, 0 QuantifiedInterpolants, 345 SizeOfPredicates, 14 NumberOfNonLiveVariables, 451 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-03-17 04:22:41,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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