./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-50.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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-50.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 31c38fc0029b15eea235546e14c5b61b4e70b436ee39f6c640a47d6a6b4e9a18 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:04:48,203 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:04:48,257 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:04:48,261 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:04:48,262 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:04:48,277 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:04:48,277 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:04:48,278 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:04:48,278 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:04:48,278 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:04:48,278 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:04:48,278 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:04:48,278 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:04:48,278 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:04:48,279 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:04:48,279 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:04:48,279 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:04:48,279 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:04:48,279 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:04:48,279 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:04:48,279 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:04:48,279 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:04:48,279 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:04:48,279 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:04:48,280 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:04:48,280 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:04:48,280 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:04:48,280 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:04:48,280 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:04:48,280 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:04:48,280 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:04:48,280 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:04:48,280 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:04:48,280 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:04:48,280 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:04:48,281 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:04:48,281 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:04:48,281 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:04:48,281 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:04:48,281 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:04:48,281 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:04:48,281 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:04:48,281 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:04:48,281 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 -> 31c38fc0029b15eea235546e14c5b61b4e70b436ee39f6c640a47d6a6b4e9a18 [2025-03-04 00:04:48,512 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:04:48,517 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:04:48,521 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:04:48,522 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:04:48,523 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:04:48,524 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-50.i [2025-03-04 00:04:49,642 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/322439062/fdc53252948b41a789da03b20f967731/FLAGb9028e460 [2025-03-04 00:04:49,885 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:04:49,885 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-50.i [2025-03-04 00:04:49,891 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/322439062/fdc53252948b41a789da03b20f967731/FLAGb9028e460 [2025-03-04 00:04:50,212 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/322439062/fdc53252948b41a789da03b20f967731 [2025-03-04 00:04:50,213 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:04:50,214 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:04:50,215 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:04:50,215 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:04:50,218 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:04:50,219 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:04:50" (1/1) ... [2025-03-04 00:04:50,219 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67682a6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:50, skipping insertion in model container [2025-03-04 00:04:50,219 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:04:50" (1/1) ... [2025-03-04 00:04:50,229 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:04:50,329 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-50.i[915,928] [2025-03-04 00:04:50,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:04:50,367 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:04:50,374 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-50.i[915,928] [2025-03-04 00:04:50,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:04:50,404 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:04:50,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:50 WrapperNode [2025-03-04 00:04:50,405 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:04:50,406 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:04:50,406 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:04:50,406 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:04:50,410 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:50" (1/1) ... [2025-03-04 00:04:50,419 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:50" (1/1) ... [2025-03-04 00:04:50,434 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 81 [2025-03-04 00:04:50,436 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:04:50,437 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:04:50,438 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:04:50,438 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:04:50,443 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:50" (1/1) ... [2025-03-04 00:04:50,444 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:50" (1/1) ... [2025-03-04 00:04:50,445 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:50" (1/1) ... [2025-03-04 00:04:50,459 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-04 00:04:50,460 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:50" (1/1) ... [2025-03-04 00:04:50,460 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:50" (1/1) ... [2025-03-04 00:04:50,464 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:50" (1/1) ... [2025-03-04 00:04:50,467 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:50" (1/1) ... [2025-03-04 00:04:50,468 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:50" (1/1) ... [2025-03-04 00:04:50,472 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:50" (1/1) ... [2025-03-04 00:04:50,473 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:04:50,473 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:04:50,474 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:04:50,474 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:04:50,474 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:50" (1/1) ... [2025-03-04 00:04:50,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:04:50,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:04:50,502 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-04 00:04:50,506 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-04 00:04:50,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:04:50,525 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:04:50,525 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:04:50,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:04:50,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:04:50,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:04:50,581 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:04:50,582 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:04:50,727 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-04 00:04:50,727 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:04:50,734 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:04:50,734 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:04:50,734 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:04:50 BoogieIcfgContainer [2025-03-04 00:04:50,735 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:04:50,737 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:04:50,737 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:04:50,740 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:04:50,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:04:50" (1/3) ... [2025-03-04 00:04:50,741 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e3ac562 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:04:50, skipping insertion in model container [2025-03-04 00:04:50,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:50" (2/3) ... [2025-03-04 00:04:50,741 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e3ac562 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:04:50, skipping insertion in model container [2025-03-04 00:04:50,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:04:50" (3/3) ... [2025-03-04 00:04:50,742 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-50.i [2025-03-04 00:04:50,752 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:04:50,753 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-50.i that has 2 procedures, 39 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:04:50,786 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:04:50,797 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;@a4c6c30, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:04:50,797 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:04:50,803 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 00:04:50,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-04 00:04:50,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:04:50,809 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:04:50,809 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:04:50,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:04:50,815 INFO L85 PathProgramCache]: Analyzing trace with hash -572064079, now seen corresponding path program 1 times [2025-03-04 00:04:50,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:04:50,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806285615] [2025-03-04 00:04:50,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:04:50,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:04:50,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 00:04:50,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 00:04:50,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:04:50,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:04:50,984 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-04 00:04:50,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:04:50,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806285615] [2025-03-04 00:04:50,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806285615] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:04:50,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109574710] [2025-03-04 00:04:50,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:04:50,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:04:50,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:04:50,989 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-04 00:04:50,990 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-04 00:04:51,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 00:04:51,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 00:04:51,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:04:51,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:04:51,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:04:51,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:04:51,094 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-04 00:04:51,096 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:04:51,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109574710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:04:51,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:04:51,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:04:51,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748895817] [2025-03-04 00:04:51,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:04:51,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:04:51,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:04:51,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:04:51,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:04:51,117 INFO L87 Difference]: Start difference. First operand has 39 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 00:04:51,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:04:51,133 INFO L93 Difference]: Finished difference Result 72 states and 115 transitions. [2025-03-04 00:04:51,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:04:51,135 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 77 [2025-03-04 00:04:51,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:04:51,138 INFO L225 Difference]: With dead ends: 72 [2025-03-04 00:04:51,139 INFO L226 Difference]: Without dead ends: 36 [2025-03-04 00:04:51,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 78 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-04 00:04:51,142 INFO L435 NwaCegarLoop]: 49 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, 49 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-04 00:04:51,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:04:51,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-04 00:04:51,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-04 00:04:51,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 00:04:51,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2025-03-04 00:04:51,170 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 77 [2025-03-04 00:04:51,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:04:51,171 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2025-03-04 00:04:51,171 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 00:04:51,171 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2025-03-04 00:04:51,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-04 00:04:51,173 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:04:51,173 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:04:51,179 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-04 00:04:51,374 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-04 00:04:51,374 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:04:51,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:04:51,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1268939505, now seen corresponding path program 1 times [2025-03-04 00:04:51,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:04:51,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147430281] [2025-03-04 00:04:51,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:04:51,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:04:51,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 00:04:51,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 00:04:51,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:04:51,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 00:04:51,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1140938954] [2025-03-04 00:04:51,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:04:51,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:04:51,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:04:51,455 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-04 00:04:51,457 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-04 00:04:51,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 00:04:51,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 00:04:51,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:04:51,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:04:51,536 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 00:04:51,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 00:04:51,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 00:04:51,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:04:51,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:04:51,618 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 00:04:51,619 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 00:04:51,620 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:04:51,628 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-04 00:04:51,822 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,SelfDestructingSolverStorable1 [2025-03-04 00:04:51,824 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 00:04:51,849 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:04:51,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:04:51 BoogieIcfgContainer [2025-03-04 00:04:51,852 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:04:51,852 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:04:51,852 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:04:51,853 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:04:51,853 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:04:50" (3/4) ... [2025-03-04 00:04:51,855 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 00:04:51,855 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:04:51,856 INFO L158 Benchmark]: Toolchain (without parser) took 1641.50ms. Allocated memory is still 142.6MB. Free memory was 113.3MB in the beginning and 104.0MB in the end (delta: 9.2MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. [2025-03-04 00:04:51,856 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:04:51,856 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.39ms. Allocated memory is still 142.6MB. Free memory was 113.3MB in the beginning and 101.1MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:04:51,856 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.73ms. Allocated memory is still 142.6MB. Free memory was 101.1MB in the beginning and 99.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:04:51,857 INFO L158 Benchmark]: Boogie Preprocessor took 35.90ms. Allocated memory is still 142.6MB. Free memory was 99.7MB in the beginning and 98.2MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:04:51,857 INFO L158 Benchmark]: IcfgBuilder took 261.25ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 84.9MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:04:51,857 INFO L158 Benchmark]: TraceAbstraction took 1115.26ms. Allocated memory is still 142.6MB. Free memory was 84.4MB in the beginning and 104.1MB in the end (delta: -19.7MB). Peak memory consumption was 55.5MB. Max. memory is 16.1GB. [2025-03-04 00:04:51,857 INFO L158 Benchmark]: Witness Printer took 2.78ms. Allocated memory is still 142.6MB. Free memory was 104.1MB in the beginning and 104.0MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:04:51,858 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.21ms. Allocated memory is still 201.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 190.39ms. Allocated memory is still 142.6MB. Free memory was 113.3MB in the beginning and 101.1MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.73ms. Allocated memory is still 142.6MB. Free memory was 101.1MB in the beginning and 99.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.90ms. Allocated memory is still 142.6MB. Free memory was 99.7MB in the beginning and 98.2MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 261.25ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 84.9MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1115.26ms. Allocated memory is still 142.6MB. Free memory was 84.4MB in the beginning and 104.1MB in the end (delta: -19.7MB). Peak memory consumption was 55.5MB. Max. memory is 16.1GB. * Witness Printer took 2.78ms. Allocated memory is still 142.6MB. Free memory was 104.1MB in the beginning and 104.0MB in the end (delta: 27.1kB). 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 someUnaryDOUBLEoperation at line 24, overapproximation of someBinaryDOUBLEComparisonOperation at line 33, overapproximation of someBinaryDOUBLEComparisonOperation at line 46, overapproximation of someBinaryDOUBLEComparisonOperation at line 48, overapproximation of someBinaryDOUBLEComparisonOperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 60. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 5; [L23] double var_1_2 = 99999.67; [L24] double var_1_3 = -0.05; [L25] signed short int var_1_4 = 128; [L26] signed short int var_1_5 = 128; [L27] signed long int var_1_6 = -10; [L28] double var_1_7 = 8.6; [L29] unsigned char var_1_8 = 1; VAL [isInitial=0, var_1_1=5, var_1_2=9999967/100, var_1_4=128, var_1_5=128, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L72] isInitial = 1 [L73] FCALL initially() [L74] COND TRUE 1 [L75] FCALL updateLastVariables() [L76] CALL updateVariables() [L45] var_1_2 = __VERIFIER_nondet_double() [L46] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=128, var_1_5=128, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=128, var_1_5=128, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L46] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=5, var_1_4=128, var_1_5=128, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L47] var_1_3 = __VERIFIER_nondet_double() [L48] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=128, var_1_5=128, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=128, var_1_5=128, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L48] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=5, var_1_4=128, var_1_5=128, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L49] var_1_4 = __VERIFIER_nondet_short() [L50] CALL assume_abort_if_not(var_1_4 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=1, var_1_5=128, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=1, var_1_5=128, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L50] RET assume_abort_if_not(var_1_4 >= -32768) VAL [isInitial=1, var_1_1=5, var_1_4=1, var_1_5=128, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L51] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=1, var_1_5=128, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=1, var_1_5=128, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L51] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, var_1_1=5, var_1_4=1, var_1_5=128, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L52] var_1_5 = __VERIFIER_nondet_short() [L53] CALL assume_abort_if_not(var_1_5 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=1, var_1_5=2, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=1, var_1_5=2, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L53] RET assume_abort_if_not(var_1_5 >= -32768) VAL [isInitial=1, var_1_1=5, var_1_4=1, var_1_5=2, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L54] CALL assume_abort_if_not(var_1_5 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=1, var_1_5=2, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=1, var_1_5=2, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L54] RET assume_abort_if_not(var_1_5 <= 32767) VAL [isInitial=1, var_1_1=5, var_1_4=1, var_1_5=2, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L55] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=1, var_1_5=2, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=1, var_1_5=2, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L55] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, var_1_1=5, var_1_4=1, var_1_5=2, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L56] var_1_6 = __VERIFIER_nondet_long() [L57] CALL assume_abort_if_not(var_1_6 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=43/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=43/5, var_1_8=1] [L57] RET assume_abort_if_not(var_1_6 >= -2147483648) VAL [isInitial=1, var_1_1=5, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=43/5, var_1_8=1] [L58] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=43/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=43/5, var_1_8=1] [L58] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, var_1_1=5, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=43/5, var_1_8=1] [L59] var_1_7 = __VERIFIER_nondet_double() [L60] CALL assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=1, var_1_5=2, var_1_6=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=1, var_1_5=2, var_1_6=1, var_1_8=1] [L60] RET assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=5, var_1_4=1, var_1_5=2, var_1_6=1, var_1_8=1] [L61] var_1_8 = __VERIFIER_nondet_uchar() [L62] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=1, var_1_5=2, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=1, var_1_5=2, var_1_6=1] [L62] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_1=5, var_1_4=1, var_1_5=2, var_1_6=1] [L63] CALL assume_abort_if_not(var_1_8 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=1, var_1_5=2, var_1_6=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=1, var_1_5=2, var_1_6=1, var_1_8=0] [L63] RET assume_abort_if_not(var_1_8 <= 254) VAL [isInitial=1, var_1_1=5, var_1_4=1, var_1_5=2, var_1_6=1, var_1_8=0] [L76] RET updateVariables() [L77] CALL step() [L33] unsigned char stepLocal_0 = ((((63.6) < (var_1_2)) ? (63.6) : (var_1_2))) != var_1_3; VAL [isInitial=1, stepLocal_0=0, var_1_1=5, var_1_4=1, var_1_5=2, var_1_6=1, var_1_8=0] [L34] COND FALSE !(stepLocal_0 && ((var_1_4 / var_1_5) < var_1_6)) [L41] var_1_1 = 10 VAL [isInitial=1, var_1_1=10, var_1_4=1, var_1_5=2, var_1_6=1, var_1_8=0] [L77] RET step() [L78] CALL, EXPR property() [L68-L69] return ((((((63.6) < (var_1_2)) ? (63.6) : (var_1_2))) != var_1_3) && ((var_1_4 / var_1_5) < var_1_6)) ? ((var_1_3 >= (var_1_2 + var_1_7)) ? (var_1_1 == ((unsigned char) var_1_8)) : (var_1_1 == ((unsigned char) var_1_8))) : (var_1_1 == ((unsigned char) 10)) ; VAL [\result=0, isInitial=1, var_1_1=10, var_1_4=1, var_1_5=2, var_1_6=1, var_1_8=0] [L78] RET, EXPR property() [L78] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=10, var_1_4=1, var_1_5=2, var_1_6=1, var_1_8=0] [L19] reach_error() VAL [isInitial=1, var_1_1=10, var_1_4=1, var_1_5=2, var_1_6=1, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 2, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 49 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 49 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 308 NumberOfCodeBlocks, 308 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 152 ConstructedInterpolants, 0 QuantifiedInterpolants, 152 SizeOfPredicates, 0 NumberOfNonLiveVariables, 177 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 506/528 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-04 00:04:51,871 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-50.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 31c38fc0029b15eea235546e14c5b61b4e70b436ee39f6c640a47d6a6b4e9a18 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:04:53,695 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:04:53,783 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 00:04:53,789 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:04:53,791 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:04:53,807 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:04:53,808 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:04:53,808 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:04:53,808 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:04:53,808 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:04:53,808 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:04:53,808 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:04:53,809 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:04:53,809 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:04:53,809 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:04:53,809 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:04:53,809 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:04:53,809 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:04:53,809 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:04:53,809 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:04:53,810 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:04:53,810 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:04:53,810 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:04:53,810 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 00:04:53,810 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 00:04:53,810 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 00:04:53,810 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:04:53,810 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:04:53,810 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:04:53,810 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:04:53,810 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:04:53,811 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:04:53,811 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:04:53,811 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:04:53,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:04:53,811 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:04:53,811 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:04:53,811 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:04:53,811 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:04:53,811 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 00:04:53,811 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 00:04:53,811 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:04:53,812 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:04:53,812 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:04:53,812 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:04:53,812 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 -> 31c38fc0029b15eea235546e14c5b61b4e70b436ee39f6c640a47d6a6b4e9a18 [2025-03-04 00:04:54,049 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:04:54,054 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:04:54,056 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:04:54,057 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:04:54,057 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:04:54,058 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-50.i [2025-03-04 00:04:55,190 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff63c42c5/6139eae7c6654a0bbd2fb089fe3d96c4/FLAGe59bb4b1e [2025-03-04 00:04:55,421 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:04:55,421 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-50.i [2025-03-04 00:04:55,430 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff63c42c5/6139eae7c6654a0bbd2fb089fe3d96c4/FLAGe59bb4b1e [2025-03-04 00:04:55,445 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff63c42c5/6139eae7c6654a0bbd2fb089fe3d96c4 [2025-03-04 00:04:55,448 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:04:55,450 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:04:55,451 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:04:55,451 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:04:55,454 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:04:55,455 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:04:55" (1/1) ... [2025-03-04 00:04:55,456 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@469f2ec3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:55, skipping insertion in model container [2025-03-04 00:04:55,457 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:04:55" (1/1) ... [2025-03-04 00:04:55,471 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:04:55,577 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-50.i[915,928] [2025-03-04 00:04:55,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:04:55,625 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:04:55,636 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-50.i[915,928] [2025-03-04 00:04:55,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:04:55,657 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:04:55,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:55 WrapperNode [2025-03-04 00:04:55,658 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:04:55,659 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:04:55,659 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:04:55,660 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:04:55,664 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:55" (1/1) ... [2025-03-04 00:04:55,670 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:55" (1/1) ... [2025-03-04 00:04:55,683 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 78 [2025-03-04 00:04:55,684 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:04:55,684 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:04:55,684 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:04:55,684 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:04:55,690 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:55" (1/1) ... [2025-03-04 00:04:55,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:55" (1/1) ... [2025-03-04 00:04:55,695 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:55" (1/1) ... [2025-03-04 00:04:55,703 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-04 00:04:55,703 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:55" (1/1) ... [2025-03-04 00:04:55,703 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:55" (1/1) ... [2025-03-04 00:04:55,710 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:55" (1/1) ... [2025-03-04 00:04:55,711 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:55" (1/1) ... [2025-03-04 00:04:55,712 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:55" (1/1) ... [2025-03-04 00:04:55,713 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:55" (1/1) ... [2025-03-04 00:04:55,714 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:04:55,715 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:04:55,715 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:04:55,715 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:04:55,716 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:55" (1/1) ... [2025-03-04 00:04:55,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:04:55,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:04:55,744 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-04 00:04:55,746 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-04 00:04:55,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:04:55,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 00:04:55,766 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:04:55,766 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:04:55,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:04:55,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:04:55,832 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:04:55,834 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:04:56,301 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-04 00:04:56,302 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:04:56,308 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:04:56,308 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:04:56,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:04:56 BoogieIcfgContainer [2025-03-04 00:04:56,309 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:04:56,311 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:04:56,311 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:04:56,314 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:04:56,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:04:55" (1/3) ... [2025-03-04 00:04:56,315 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f6da93e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:04:56, skipping insertion in model container [2025-03-04 00:04:56,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:55" (2/3) ... [2025-03-04 00:04:56,315 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f6da93e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:04:56, skipping insertion in model container [2025-03-04 00:04:56,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:04:56" (3/3) ... [2025-03-04 00:04:56,316 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-50.i [2025-03-04 00:04:56,326 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:04:56,328 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-50.i that has 2 procedures, 39 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:04:56,363 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:04:56,370 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;@1fda08, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:04:56,371 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:04:56,373 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 00:04:56,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-04 00:04:56,379 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:04:56,379 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:04:56,379 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:04:56,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:04:56,383 INFO L85 PathProgramCache]: Analyzing trace with hash -572064079, now seen corresponding path program 1 times [2025-03-04 00:04:56,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:04:56,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [907694922] [2025-03-04 00:04:56,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:04:56,390 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:04:56,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:04:56,394 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:04:56,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-04 00:04:56,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 00:04:56,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 00:04:56,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:04:56,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:04:56,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:04:56,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:04:56,572 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2025-03-04 00:04:56,573 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:04:56,574 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:04:56,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [907694922] [2025-03-04 00:04:56,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [907694922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:04:56,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:04:56,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 00:04:56,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121689460] [2025-03-04 00:04:56,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:04:56,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:04:56,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:04:56,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:04:56,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:04:56,596 INFO L87 Difference]: Start difference. First operand has 39 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 00:04:56,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:04:56,617 INFO L93 Difference]: Finished difference Result 72 states and 115 transitions. [2025-03-04 00:04:56,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:04:56,618 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 77 [2025-03-04 00:04:56,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:04:56,623 INFO L225 Difference]: With dead ends: 72 [2025-03-04 00:04:56,623 INFO L226 Difference]: Without dead ends: 36 [2025-03-04 00:04:56,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 76 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-04 00:04:56,628 INFO L435 NwaCegarLoop]: 49 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, 49 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-04 00:04:56,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:04:56,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-04 00:04:56,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-04 00:04:56,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 00:04:56,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2025-03-04 00:04:56,659 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 77 [2025-03-04 00:04:56,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:04:56,660 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2025-03-04 00:04:56,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 00:04:56,660 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2025-03-04 00:04:56,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-04 00:04:56,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:04:56,662 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:04:56,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-04 00:04:56,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:04:56,863 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:04:56,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:04:56,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1268939505, now seen corresponding path program 1 times [2025-03-04 00:04:56,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:04:56,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [426219496] [2025-03-04 00:04:56,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:04:56,865 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:04:56,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:04:56,866 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:04:56,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-04 00:04:56,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 00:04:56,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 00:04:56,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:04:56,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:04:56,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 00:04:56,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:04:58,666 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 00:04:58,667 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:04:58,667 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:04:58,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [426219496] [2025-03-04 00:04:58,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [426219496] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:04:58,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:04:58,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:04:58,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776383266] [2025-03-04 00:04:58,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:04:58,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:04:58,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:04:58,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:04:58,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:04:58,670 INFO L87 Difference]: Start difference. First operand 36 states and 49 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 00:05:00,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:05:00,245 INFO L93 Difference]: Finished difference Result 44 states and 57 transitions. [2025-03-04 00:05:00,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 00:05:00,250 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 77 [2025-03-04 00:05:00,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:05:00,251 INFO L225 Difference]: With dead ends: 44 [2025-03-04 00:05:00,251 INFO L226 Difference]: Without dead ends: 42 [2025-03-04 00:05:00,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:05:00,251 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 5 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:05:00,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 199 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 00:05:00,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-04 00:05:00,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2025-03-04 00:05:00,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 00:05:00,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2025-03-04 00:05:00,257 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 52 transitions. Word has length 77 [2025-03-04 00:05:00,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:05:00,258 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 52 transitions. [2025-03-04 00:05:00,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 00:05:00,258 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 52 transitions. [2025-03-04 00:05:00,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-04 00:05:00,259 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:05:00,259 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:05:00,266 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-04 00:05:00,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:05:00,464 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:05:00,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:05:00,465 INFO L85 PathProgramCache]: Analyzing trace with hash -652804778, now seen corresponding path program 1 times [2025-03-04 00:05:00,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:05:00,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1074376501] [2025-03-04 00:05:00,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:05:00,465 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:05:00,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:05:00,467 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:05:00,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-04 00:05:00,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-04 00:05:00,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 00:05:00,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:05:00,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:05:00,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 00:05:00,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:05:02,262 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 00:05:02,262 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:05:02,262 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:05:02,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1074376501] [2025-03-04 00:05:02,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1074376501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:05:02,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:05:02,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 00:05:02,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545087261] [2025-03-04 00:05:02,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:05:02,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 00:05:02,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:05:02,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 00:05:02,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:05:02,263 INFO L87 Difference]: Start difference. First operand 39 states and 52 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 00:05:04,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:05:04,519 INFO L93 Difference]: Finished difference Result 42 states and 55 transitions. [2025-03-04 00:05:04,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 00:05:04,523 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 78 [2025-03-04 00:05:04,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:05:04,525 INFO L225 Difference]: With dead ends: 42 [2025-03-04 00:05:04,525 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 00:05:04,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:05:04,526 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 5 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-04 00:05:04,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 216 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-04 00:05:04,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 00:05:04,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 00:05:04,527 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-04 00:05:04,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 00:05:04,528 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2025-03-04 00:05:04,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:05:04,528 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 00:05:04,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 00:05:04,528 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 00:05:04,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 00:05:04,530 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:05:04,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-04 00:05:04,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:05:04,733 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-04 00:05:04,735 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 00:05:04,750 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:05:04,757 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:05:04 BoogieIcfgContainer [2025-03-04 00:05:04,757 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:05:04,758 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:05:04,758 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:05:04,758 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:05:04,761 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:04:56" (3/4) ... [2025-03-04 00:05:04,763 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 00:05:04,767 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-04 00:05:04,769 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-03-04 00:05:04,769 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-04 00:05:04,770 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 00:05:04,770 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 00:05:04,831 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 00:05:04,831 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 00:05:04,831 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:05:04,832 INFO L158 Benchmark]: Toolchain (without parser) took 9382.24ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 92.4MB in the beginning and 51.5MB in the end (delta: 40.9MB). Peak memory consumption was 72.0MB. Max. memory is 16.1GB. [2025-03-04 00:05:04,833 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 83.9MB. Free memory is still 61.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:05:04,833 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.82ms. Allocated memory is still 117.4MB. Free memory was 92.4MB in the beginning and 79.8MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:05:04,834 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.60ms. Allocated memory is still 117.4MB. Free memory was 79.8MB in the beginning and 78.5MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:05:04,834 INFO L158 Benchmark]: Boogie Preprocessor took 30.22ms. Allocated memory is still 117.4MB. Free memory was 78.3MB in the beginning and 76.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:05:04,834 INFO L158 Benchmark]: IcfgBuilder took 594.12ms. Allocated memory is still 117.4MB. Free memory was 76.4MB in the beginning and 63.4MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:05:04,835 INFO L158 Benchmark]: TraceAbstraction took 8446.89ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 63.0MB in the beginning and 57.2MB in the end (delta: 5.7MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB. [2025-03-04 00:05:04,835 INFO L158 Benchmark]: Witness Printer took 73.04ms. Allocated memory is still 151.0MB. Free memory was 57.2MB in the beginning and 51.5MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:05:04,836 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.22ms. Allocated memory is still 83.9MB. Free memory is still 61.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 207.82ms. Allocated memory is still 117.4MB. Free memory was 92.4MB in the beginning and 79.8MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.60ms. Allocated memory is still 117.4MB. Free memory was 79.8MB in the beginning and 78.5MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.22ms. Allocated memory is still 117.4MB. Free memory was 78.3MB in the beginning and 76.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 594.12ms. Allocated memory is still 117.4MB. Free memory was 76.4MB in the beginning and 63.4MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 8446.89ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 63.0MB in the beginning and 57.2MB in the end (delta: 5.7MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB. * Witness Printer took 73.04ms. Allocated memory is still 151.0MB. Free memory was 57.2MB in the beginning and 51.5MB in the end (delta: 5.8MB). 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, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.4s, OverallIterations: 3, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10 mSDsluCounter, 464 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 323 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 137 IncrementalHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 141 mSDtfsCounter, 137 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 233 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=0, InterpolantAutomatonStates: 15, 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, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 232 NumberOfCodeBlocks, 232 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 229 ConstructedInterpolants, 0 QuantifiedInterpolants, 475 SizeOfPredicates, 16 NumberOfNonLiveVariables, 377 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 792/792 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-04 00:05:04,861 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