./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_loopvsstraightlinecode_25-1loop_file-86.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 0b1bd1257190961b4c1941dc1e9dfbe09ed3b9534a64219badf358449b7e869c --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:26:30,297 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:26:30,335 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 14:26:30,338 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:26:30,339 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:26:30,351 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:26:30,351 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:26:30,351 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:26:30,352 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:26:30,352 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:26:30,352 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:26:30,352 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:26:30,352 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:26:30,352 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:26:30,352 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:26:30,353 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:26:30,353 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:26:30,353 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:26:30,353 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 14:26:30,353 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:26:30,353 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:26:30,353 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:26:30,353 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:26:30,353 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:26:30,353 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:26:30,353 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:26:30,353 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:26:30,354 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:26:30,354 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:26:30,354 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:26:30,354 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:26:30,354 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:26:30,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:26:30,354 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:26:30,354 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:26:30,354 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:26:30,354 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:26:30,355 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 14:26:30,355 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 14:26:30,355 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:26:30,355 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:26:30,355 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:26:30,355 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:26:30,355 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 -> 0b1bd1257190961b4c1941dc1e9dfbe09ed3b9534a64219badf358449b7e869c [2025-03-08 14:26:30,565 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:26:30,572 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:26:30,574 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:26:30,575 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:26:30,575 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:26:30,576 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-86.i [2025-03-08 14:26:31,678 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c85424f52/ab0aa1ae2d7b4e59b3a4068d1fb62c6f/FLAG0ba9bab59 [2025-03-08 14:26:31,932 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:26:31,932 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-86.i [2025-03-08 14:26:31,939 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c85424f52/ab0aa1ae2d7b4e59b3a4068d1fb62c6f/FLAG0ba9bab59 [2025-03-08 14:26:31,953 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c85424f52/ab0aa1ae2d7b4e59b3a4068d1fb62c6f [2025-03-08 14:26:31,956 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:26:31,957 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:26:31,958 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:26:31,959 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:26:31,962 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:26:31,962 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:26:31" (1/1) ... [2025-03-08 14:26:31,963 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64099355 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:31, skipping insertion in model container [2025-03-08 14:26:31,963 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:26:31" (1/1) ... [2025-03-08 14:26:31,977 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:26:32,082 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_loopvsstraightlinecode_25-1loop_file-86.i[915,928] [2025-03-08 14:26:32,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:26:32,120 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:26:32,129 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_loopvsstraightlinecode_25-1loop_file-86.i[915,928] [2025-03-08 14:26:32,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:26:32,168 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:26:32,169 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:32 WrapperNode [2025-03-08 14:26:32,169 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:26:32,170 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:26:32,170 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:26:32,170 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:26:32,175 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:32" (1/1) ... [2025-03-08 14:26:32,186 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:32" (1/1) ... [2025-03-08 14:26:32,219 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 108 [2025-03-08 14:26:32,223 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:26:32,223 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:26:32,223 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:26:32,223 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:26:32,231 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:32" (1/1) ... [2025-03-08 14:26:32,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:32" (1/1) ... [2025-03-08 14:26:32,235 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:32" (1/1) ... [2025-03-08 14:26:32,255 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-08 14:26:32,255 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:32" (1/1) ... [2025-03-08 14:26:32,255 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:32" (1/1) ... [2025-03-08 14:26:32,263 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:32" (1/1) ... [2025-03-08 14:26:32,264 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:32" (1/1) ... [2025-03-08 14:26:32,268 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:32" (1/1) ... [2025-03-08 14:26:32,269 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:32" (1/1) ... [2025-03-08 14:26:32,271 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:26:32,271 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:26:32,271 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:26:32,271 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:26:32,272 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:32" (1/1) ... [2025-03-08 14:26:32,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:26:32,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:26:32,303 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-08 14:26:32,308 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-08 14:26:32,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:26:32,323 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:26:32,324 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:26:32,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 14:26:32,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:26:32,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:26:32,375 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:26:32,376 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:26:32,571 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-03-08 14:26:32,572 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:26:32,581 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:26:32,582 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:26:32,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:26:32 BoogieIcfgContainer [2025-03-08 14:26:32,583 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:26:32,585 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:26:32,585 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:26:32,588 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:26:32,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:26:31" (1/3) ... [2025-03-08 14:26:32,589 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7afc0b4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:26:32, skipping insertion in model container [2025-03-08 14:26:32,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:32" (2/3) ... [2025-03-08 14:26:32,589 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7afc0b4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:26:32, skipping insertion in model container [2025-03-08 14:26:32,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:26:32" (3/3) ... [2025-03-08 14:26:32,590 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-86.i [2025-03-08 14:26:32,600 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:26:32,602 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-86.i that has 2 procedures, 50 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:26:32,635 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:26:32,643 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;@a62b70c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:26:32,644 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:26:32,646 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 14:26:32,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 14:26:32,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:26:32,654 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 14:26:32,655 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:26:32,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:26:32,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1455454040, now seen corresponding path program 1 times [2025-03-08 14:26:32,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:26:32,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736869472] [2025-03-08 14:26:32,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:26:32,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:26:32,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 14:26:32,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 14:26:32,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:26:32,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:26:32,831 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-08 14:26:32,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:26:32,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736869472] [2025-03-08 14:26:32,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736869472] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:26:32,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616940104] [2025-03-08 14:26:32,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:26:32,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:26:32,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:26:32,836 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-08 14:26:32,837 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-08 14:26:32,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 14:26:32,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 14:26:32,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:26:32,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:26:32,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:26:32,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:26:32,970 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-08 14:26:32,974 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:26:32,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616940104] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:26:32,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 14:26:32,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 14:26:32,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712745641] [2025-03-08 14:26:32,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:26:32,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:26:32,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:26:32,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:26:32,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:26:32,996 INFO L87 Difference]: Start difference. First operand has 50 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 14:26:33,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:26:33,010 INFO L93 Difference]: Finished difference Result 97 states and 160 transitions. [2025-03-08 14:26:33,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:26:33,012 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 108 [2025-03-08 14:26:33,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:26:33,015 INFO L225 Difference]: With dead ends: 97 [2025-03-08 14:26:33,016 INFO L226 Difference]: Without dead ends: 47 [2025-03-08 14:26:33,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 109 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-08 14:26:33,019 INFO L435 NwaCegarLoop]: 71 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, 71 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-08 14:26:33,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:26:33,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-08 14:26:33,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-03-08 14:26:33,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 14:26:33,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 68 transitions. [2025-03-08 14:26:33,045 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 68 transitions. Word has length 108 [2025-03-08 14:26:33,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:26:33,045 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 68 transitions. [2025-03-08 14:26:33,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 14:26:33,045 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. [2025-03-08 14:26:33,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 14:26:33,047 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:26:33,047 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 14:26:33,054 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-08 14:26:33,251 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-08 14:26:33,251 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:26:33,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:26:33,252 INFO L85 PathProgramCache]: Analyzing trace with hash 359904903, now seen corresponding path program 1 times [2025-03-08 14:26:33,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:26:33,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344843944] [2025-03-08 14:26:33,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:26:33,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:26:33,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 14:26:33,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 14:26:33,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:26:33,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:26:35,986 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 14:26:35,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:26:35,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344843944] [2025-03-08 14:26:35,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344843944] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:26:35,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:26:35,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 14:26:35,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612935525] [2025-03-08 14:26:35,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:26:35,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 14:26:35,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:26:35,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 14:26:35,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-08 14:26:35,991 INFO L87 Difference]: Start difference. First operand 47 states and 68 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 14:26:36,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:26:36,453 INFO L93 Difference]: Finished difference Result 89 states and 128 transitions. [2025-03-08 14:26:36,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 14:26:36,455 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 108 [2025-03-08 14:26:36,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:26:36,457 INFO L225 Difference]: With dead ends: 89 [2025-03-08 14:26:36,458 INFO L226 Difference]: Without dead ends: 87 [2025-03-08 14:26:36,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-03-08 14:26:36,459 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 55 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 14:26:36,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 262 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 14:26:36,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-08 14:26:36,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2025-03-08 14:26:36,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 50 states have internal predecessors, (59), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 14:26:36,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 123 transitions. [2025-03-08 14:26:36,481 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 123 transitions. Word has length 108 [2025-03-08 14:26:36,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:26:36,482 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 123 transitions. [2025-03-08 14:26:36,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 14:26:36,483 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 123 transitions. [2025-03-08 14:26:36,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 14:26:36,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:26:36,485 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 14:26:36,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 14:26:36,485 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:26:36,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:26:36,486 INFO L85 PathProgramCache]: Analyzing trace with hash 163391398, now seen corresponding path program 1 times [2025-03-08 14:26:36,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:26:36,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822924465] [2025-03-08 14:26:36,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:26:36,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:26:36,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 14:26:36,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 14:26:36,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:26:36,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:26:36,611 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 14:26:36,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:26:36,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822924465] [2025-03-08 14:26:36,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822924465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:26:36,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:26:36,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 14:26:36,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198850265] [2025-03-08 14:26:36,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:26:36,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 14:26:36,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:26:36,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 14:26:36,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 14:26:36,613 INFO L87 Difference]: Start difference. First operand 84 states and 123 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 14:26:36,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:26:36,649 INFO L93 Difference]: Finished difference Result 236 states and 349 transitions. [2025-03-08 14:26:36,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 14:26:36,650 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 108 [2025-03-08 14:26:36,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:26:36,654 INFO L225 Difference]: With dead ends: 236 [2025-03-08 14:26:36,654 INFO L226 Difference]: Without dead ends: 155 [2025-03-08 14:26:36,654 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-08 14:26:36,657 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 32 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:26:36,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 136 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:26:36,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-03-08 14:26:36,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2025-03-08 14:26:36,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 84 states have (on average 1.1666666666666667) internal successors, (98), 86 states have internal predecessors, (98), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-08 14:26:36,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 226 transitions. [2025-03-08 14:26:36,700 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 226 transitions. Word has length 108 [2025-03-08 14:26:36,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:26:36,701 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 226 transitions. [2025-03-08 14:26:36,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 14:26:36,702 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 226 transitions. [2025-03-08 14:26:36,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 14:26:36,704 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:26:36,704 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 14:26:36,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 14:26:36,704 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:26:36,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:26:36,705 INFO L85 PathProgramCache]: Analyzing trace with hash -724112283, now seen corresponding path program 1 times [2025-03-08 14:26:36,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:26:36,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852780337] [2025-03-08 14:26:36,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:26:36,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:26:36,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 14:26:36,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 14:26:36,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:26:36,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:26:38,316 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 14:26:38,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:26:38,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852780337] [2025-03-08 14:26:38,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852780337] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:26:38,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:26:38,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 14:26:38,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364264852] [2025-03-08 14:26:38,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:26:38,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 14:26:38,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:26:38,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 14:26:38,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-08 14:26:38,319 INFO L87 Difference]: Start difference. First operand 153 states and 226 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 14:26:38,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:26:38,690 INFO L93 Difference]: Finished difference Result 153 states and 226 transitions. [2025-03-08 14:26:38,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 14:26:38,692 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 108 [2025-03-08 14:26:38,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:26:38,692 INFO L225 Difference]: With dead ends: 153 [2025-03-08 14:26:38,692 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 14:26:38,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-03-08 14:26:38,694 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 12 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 14:26:38,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 401 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 14:26:38,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 14:26:38,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 14:26:38,694 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-08 14:26:38,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 14:26:38,694 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 108 [2025-03-08 14:26:38,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:26:38,695 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 14:26:38,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 14:26:38,695 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 14:26:38,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 14:26:38,698 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 14:26:38,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 14:26:38,700 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-08 14:26:38,702 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 14:26:38,909 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 14:26:38,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 02:26:38 BoogieIcfgContainer [2025-03-08 14:26:38,931 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 14:26:38,932 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 14:26:38,932 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 14:26:38,932 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 14:26:38,933 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:26:32" (3/4) ... [2025-03-08 14:26:38,934 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 14:26:38,942 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-08 14:26:38,946 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-08 14:26:38,947 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-08 14:26:38,947 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 14:26:38,947 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 14:26:39,015 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 14:26:39,015 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 14:26:39,015 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 14:26:39,017 INFO L158 Benchmark]: Toolchain (without parser) took 7059.09ms. Allocated memory was 167.8MB in the beginning and 276.8MB in the end (delta: 109.1MB). Free memory was 133.2MB in the beginning and 113.5MB in the end (delta: 19.7MB). Peak memory consumption was 126.4MB. Max. memory is 16.1GB. [2025-03-08 14:26:39,017 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 125.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:26:39,018 INFO L158 Benchmark]: CACSL2BoogieTranslator took 211.93ms. Allocated memory is still 167.8MB. Free memory was 132.8MB in the beginning and 120.1MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 14:26:39,018 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.38ms. Allocated memory is still 167.8MB. Free memory was 120.1MB in the beginning and 117.2MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 14:26:39,019 INFO L158 Benchmark]: Boogie Preprocessor took 47.46ms. Allocated memory is still 167.8MB. Free memory was 117.2MB in the beginning and 112.4MB in the end (delta: 4.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:26:39,019 INFO L158 Benchmark]: IcfgBuilder took 311.96ms. Allocated memory is still 167.8MB. Free memory was 112.4MB in the beginning and 93.2MB in the end (delta: 19.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 14:26:39,019 INFO L158 Benchmark]: TraceAbstraction took 6346.82ms. Allocated memory was 167.8MB in the beginning and 276.8MB in the end (delta: 109.1MB). Free memory was 92.8MB in the beginning and 119.5MB in the end (delta: -26.7MB). Peak memory consumption was 76.0MB. Max. memory is 16.1GB. [2025-03-08 14:26:39,020 INFO L158 Benchmark]: Witness Printer took 83.59ms. Allocated memory is still 276.8MB. Free memory was 119.5MB in the beginning and 113.5MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 14:26:39,021 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.24ms. Allocated memory is still 201.3MB. Free memory is still 125.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 211.93ms. Allocated memory is still 167.8MB. Free memory was 132.8MB in the beginning and 120.1MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.38ms. Allocated memory is still 167.8MB. Free memory was 120.1MB in the beginning and 117.2MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.46ms. Allocated memory is still 167.8MB. Free memory was 117.2MB in the beginning and 112.4MB in the end (delta: 4.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 311.96ms. Allocated memory is still 167.8MB. Free memory was 112.4MB in the beginning and 93.2MB in the end (delta: 19.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6346.82ms. Allocated memory was 167.8MB in the beginning and 276.8MB in the end (delta: 109.1MB). Free memory was 92.8MB in the beginning and 119.5MB in the end (delta: -26.7MB). Peak memory consumption was 76.0MB. Max. memory is 16.1GB. * Witness Printer took 83.59ms. Allocated memory is still 276.8MB. Free memory was 119.5MB in the beginning and 113.5MB in the end (delta: 6.0MB). 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, 50 locations, 90 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.1s, OverallIterations: 4, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 99 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 99 mSDsluCounter, 870 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 596 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 359 IncrementalHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 274 mSDtfsCounter, 359 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=153occurred in iteration=3, InterpolantAutomatonStates: 24, 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, 4 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 540 NumberOfCodeBlocks, 540 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 535 ConstructedInterpolants, 0 QuantifiedInterpolants, 2041 SizeOfPredicates, 0 NumberOfNonLiveVariables, 250 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 2688/2720 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 - InvariantResult [Line: 96]: Location Invariant Derived location invariant: ((((var_1_18 == var_1_16) && (0 <= 0)) && ((((((var_1_7 == var_1_11) || (var_1_9 < ((((var_1_3 >= 0) ? (var_1_3 / var_1_8) : ((var_1_8 >= 0) ? ((var_1_3 / var_1_8) - 1) : ((var_1_3 / var_1_8) + 1))) + var_1_10) + 1))) || (var_1_16 == 0)) && (((((0 < (var_1_3 + 1)) || (var_1_7 == var_1_11)) || (var_1_16 == 0)) || (0 < ((long long) var_1_8 + 1))) || (((var_1_3 >= 0) ? (var_1_3 % var_1_8) : ((var_1_8 >= 0) ? ((var_1_3 % var_1_8) + var_1_8) : ((var_1_3 % var_1_8) - var_1_8))) == 0))) && ((((var_1_7 == var_1_11) || (var_1_16 == 0)) || (((long long) var_1_9 + 1) == (((var_1_3 >= 0) ? (var_1_3 / var_1_8) : ((var_1_8 >= 0) ? ((var_1_3 / var_1_8) - 1) : ((var_1_3 / var_1_8) + 1))) + var_1_10))) || (((var_1_3 + 1) <= 0) && (((var_1_3 >= 0) ? (var_1_3 % var_1_8) : ((var_1_8 >= 0) ? ((var_1_3 % var_1_8) + var_1_8) : ((var_1_3 % var_1_8) - var_1_8))) != 0)))) || (((long long) var_1_9 + 1) < (((var_1_3 >= 0) ? (var_1_3 / var_1_8) : ((var_1_8 >= 0) ? ((var_1_3 / var_1_8) - 1) : ((var_1_3 / var_1_8) + 1))) + var_1_10)))) || ((((((0 < var_1_7) || (var_1_12 == 0)) || (0 < (((var_1_7 * 4294967295) + var_1_13) % 4294967296))) && (var_1_7 == var_1_1)) && (var_1_13 <= ((((((4294967295 * var_1_11) + (4294967295 * last_1_var_1_1)) + 4294967196) + var_1_17) >= 0) ? (((((4294967295 * var_1_11) + (4294967295 * last_1_var_1_1)) + 4294967196) + var_1_17) % 4294967296) : ((((((4294967295 * var_1_11) + (4294967295 * last_1_var_1_1)) + 4294967196) + var_1_17) % 4294967296) + 4294967296)))) && ((((((var_1_7 == var_1_11) || (var_1_9 < ((((var_1_3 >= 0) ? (var_1_3 / var_1_8) : ((var_1_8 >= 0) ? ((var_1_3 / var_1_8) - 1) : ((var_1_3 / var_1_8) + 1))) + var_1_10) + 1))) || (var_1_16 == 0)) && (((((0 < (var_1_3 + 1)) || (var_1_7 == var_1_11)) || (var_1_16 == 0)) || (0 < ((long long) var_1_8 + 1))) || (((var_1_3 >= 0) ? (var_1_3 % var_1_8) : ((var_1_8 >= 0) ? ((var_1_3 % var_1_8) + var_1_8) : ((var_1_3 % var_1_8) - var_1_8))) == 0))) && ((((var_1_7 == var_1_11) || (var_1_16 == 0)) || (((long long) var_1_9 + 1) == (((var_1_3 >= 0) ? (var_1_3 / var_1_8) : ((var_1_8 >= 0) ? ((var_1_3 / var_1_8) - 1) : ((var_1_3 / var_1_8) + 1))) + var_1_10))) || (((var_1_3 + 1) <= 0) && (((var_1_3 >= 0) ? (var_1_3 % var_1_8) : ((var_1_8 >= 0) ? ((var_1_3 % var_1_8) + var_1_8) : ((var_1_3 % var_1_8) - var_1_8))) != 0)))) || (((long long) var_1_9 + 1) < (((var_1_3 >= 0) ? (var_1_3 / var_1_8) : ((var_1_8 >= 0) ? ((var_1_3 / var_1_8) - 1) : ((var_1_3 / var_1_8) + 1))) + var_1_10))))) RESULT: Ultimate proved your program to be correct! [2025-03-08 14:26:39,058 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 Writing output log to file Ultimate.log Result: TRUE