./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-51.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-51.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4d0d9346d03692e5aa17dc110f0097921008598edde0d474bc7067d212c257c2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:19:13,116 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:19:13,188 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 13:19:13,198 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:19:13,198 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:19:13,227 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:19:13,228 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:19:13,228 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:19:13,229 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:19:13,229 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:19:13,230 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:19:13,230 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:19:13,230 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:19:13,231 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:19:13,231 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:19:13,231 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:19:13,231 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:19:13,231 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:19:13,231 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 13:19:13,231 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:19:13,231 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:19:13,231 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:19:13,231 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:19:13,231 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:19:13,231 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:19:13,231 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:19:13,232 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:19:13,232 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:19:13,232 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:19:13,232 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:19:13,232 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:19:13,232 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:19:13,232 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:19:13,232 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:19:13,232 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:19:13,232 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:19:13,232 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:19:13,232 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:19:13,233 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:19:13,234 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:19:13,234 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:19:13,234 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:19:13,234 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 13:19:13,234 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 13:19:13,234 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:19:13,234 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:19:13,235 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:19:13,235 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:19:13,235 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4d0d9346d03692e5aa17dc110f0097921008598edde0d474bc7067d212c257c2 [2025-01-09 13:19:13,488 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:19:13,498 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:19:13,501 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:19:13,502 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:19:13,503 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:19:13,504 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-51.i [2025-01-09 13:19:14,823 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d48b4153d/33341429f00c4849a8275c20f81212c4/FLAG101b03e9f [2025-01-09 13:19:15,122 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:19:15,124 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-51.i [2025-01-09 13:19:15,134 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d48b4153d/33341429f00c4849a8275c20f81212c4/FLAG101b03e9f [2025-01-09 13:19:15,157 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d48b4153d/33341429f00c4849a8275c20f81212c4 [2025-01-09 13:19:15,159 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:19:15,160 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:19:15,163 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:19:15,163 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:19:15,169 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:19:15,170 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:19:15" (1/1) ... [2025-01-09 13:19:15,171 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42e0a1a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:15, skipping insertion in model container [2025-01-09 13:19:15,171 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:19:15" (1/1) ... [2025-01-09 13:19:15,185 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:19:15,314 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-51.i[915,928] [2025-01-09 13:19:15,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:19:15,375 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:19:15,384 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-51.i[915,928] [2025-01-09 13:19:15,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:19:15,419 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:19:15,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:15 WrapperNode [2025-01-09 13:19:15,420 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:19:15,421 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:19:15,421 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:19:15,421 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:19:15,427 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:15" (1/1) ... [2025-01-09 13:19:15,438 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:15" (1/1) ... [2025-01-09 13:19:15,466 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 96 [2025-01-09 13:19:15,467 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:19:15,467 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:19:15,468 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:19:15,468 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:19:15,477 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:15" (1/1) ... [2025-01-09 13:19:15,477 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:15" (1/1) ... [2025-01-09 13:19:15,479 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:15" (1/1) ... [2025-01-09 13:19:15,497 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 13:19:15,499 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:15" (1/1) ... [2025-01-09 13:19:15,500 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:15" (1/1) ... [2025-01-09 13:19:15,505 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:15" (1/1) ... [2025-01-09 13:19:15,506 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:15" (1/1) ... [2025-01-09 13:19:15,516 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:15" (1/1) ... [2025-01-09 13:19:15,517 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:15" (1/1) ... [2025-01-09 13:19:15,518 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:15" (1/1) ... [2025-01-09 13:19:15,524 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:19:15,525 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:19:15,525 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:19:15,525 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:19:15,526 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:15" (1/1) ... [2025-01-09 13:19:15,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:19:15,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:19:15,566 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 13:19:15,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 13:19:15,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:19:15,593 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:19:15,593 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:19:15,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 13:19:15,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:19:15,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:19:15,666 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:19:15,668 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:19:15,879 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-01-09 13:19:15,880 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:19:15,887 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:19:15,887 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 13:19:15,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:19:15 BoogieIcfgContainer [2025-01-09 13:19:15,888 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:19:15,890 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:19:15,890 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:19:15,896 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:19:15,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:19:15" (1/3) ... [2025-01-09 13:19:15,897 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@748a78d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:19:15, skipping insertion in model container [2025-01-09 13:19:15,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:15" (2/3) ... [2025-01-09 13:19:15,897 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@748a78d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:19:15, skipping insertion in model container [2025-01-09 13:19:15,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:19:15" (3/3) ... [2025-01-09 13:19:15,898 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-51.i [2025-01-09 13:19:15,912 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:19:15,914 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-51.i that has 2 procedures, 43 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:19:15,965 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:19:15,978 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;@43079c7b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:19:15,979 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:19:15,983 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 29 states have internal predecessors, (37), 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-01-09 13:19:15,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 13:19:15,991 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:19:15,991 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, 1, 1] [2025-01-09 13:19:15,992 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:19:15,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:19:15,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1237969454, now seen corresponding path program 1 times [2025-01-09 13:19:16,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:19:16,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024009604] [2025-01-09 13:19:16,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:19:16,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:19:16,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 13:19:16,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 13:19:16,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:19:16,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:19:16,237 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-01-09 13:19:16,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:19:16,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024009604] [2025-01-09 13:19:16,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024009604] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:19:16,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991707363] [2025-01-09 13:19:16,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:19:16,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:19:16,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:19:16,243 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 13:19:16,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 13:19:16,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 13:19:16,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 13:19:16,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:19:16,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:19:16,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:19:16,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:19:16,408 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-01-09 13:19:16,411 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:19:16,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991707363] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:19:16,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:19:16,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 13:19:16,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735051398] [2025-01-09 13:19:16,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:19:16,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:19:16,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:19:16,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:19:16,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:19:16,436 INFO L87 Difference]: Start difference. First operand has 43 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 29 states have internal predecessors, (37), 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.5) internal successors, (25), 2 states have internal predecessors, (25), 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-01-09 13:19:16,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:19:16,459 INFO L93 Difference]: Finished difference Result 83 states and 131 transitions. [2025-01-09 13:19:16,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:19:16,461 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (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 80 [2025-01-09 13:19:16,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:19:16,467 INFO L225 Difference]: With dead ends: 83 [2025-01-09 13:19:16,467 INFO L226 Difference]: Without dead ends: 40 [2025-01-09 13:19:16,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:19:16,475 INFO L435 NwaCegarLoop]: 59 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, 59 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:19:16,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:19:16,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-01-09 13:19:16,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-01-09 13:19:16,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 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-01-09 13:19:16,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 56 transitions. [2025-01-09 13:19:16,509 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 56 transitions. Word has length 80 [2025-01-09 13:19:16,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:19:16,509 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 56 transitions. [2025-01-09 13:19:16,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (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-01-09 13:19:16,510 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2025-01-09 13:19:16,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 13:19:16,512 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:19:16,512 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, 1, 1] [2025-01-09 13:19:16,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 13:19:16,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 13:19:16,713 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:19:16,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:19:16,714 INFO L85 PathProgramCache]: Analyzing trace with hash -332843250, now seen corresponding path program 1 times [2025-01-09 13:19:16,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:19:16,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4102381] [2025-01-09 13:19:16,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:19:16,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:19:16,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 13:19:16,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 13:19:16,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:19:16,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 13:19:16,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1228085135] [2025-01-09 13:19:16,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:19:16,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:19:16,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:19:16,855 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 13:19:16,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 13:19:16,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 13:19:17,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 13:19:17,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:19:17,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:19:17,024 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 13:19:17,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 13:19:17,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 13:19:17,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:19:17,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:19:17,138 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 13:19:17,139 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 13:19:17,140 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 13:19:17,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 13:19:17,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:19:17,349 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-09 13:19:17,419 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 13:19:17,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 01:19:17 BoogieIcfgContainer [2025-01-09 13:19:17,424 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 13:19:17,425 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 13:19:17,425 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 13:19:17,425 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 13:19:17,425 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:19:15" (3/4) ... [2025-01-09 13:19:17,429 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 13:19:17,430 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 13:19:17,431 INFO L158 Benchmark]: Toolchain (without parser) took 2270.49ms. Allocated memory is still 167.8MB. Free memory was 129.2MB in the beginning and 42.7MB in the end (delta: 86.5MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. [2025-01-09 13:19:17,431 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:19:17,432 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.58ms. Allocated memory is still 167.8MB. Free memory was 129.2MB in the beginning and 117.1MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:19:17,432 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.03ms. Allocated memory is still 167.8MB. Free memory was 117.1MB in the beginning and 115.5MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:19:17,433 INFO L158 Benchmark]: Boogie Preprocessor took 56.59ms. Allocated memory is still 167.8MB. Free memory was 115.5MB in the beginning and 113.2MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:19:17,433 INFO L158 Benchmark]: RCFGBuilder took 363.85ms. Allocated memory is still 167.8MB. Free memory was 113.2MB in the beginning and 99.1MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 13:19:17,434 INFO L158 Benchmark]: TraceAbstraction took 1533.87ms. Allocated memory is still 167.8MB. Free memory was 98.7MB in the beginning and 42.7MB in the end (delta: 56.0MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-01-09 13:19:17,435 INFO L158 Benchmark]: Witness Printer took 5.25ms. Allocated memory is still 167.8MB. Free memory is still 42.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:19:17,436 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 257.58ms. Allocated memory is still 167.8MB. Free memory was 129.2MB in the beginning and 117.1MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.03ms. Allocated memory is still 167.8MB. Free memory was 117.1MB in the beginning and 115.5MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.59ms. Allocated memory is still 167.8MB. Free memory was 115.5MB in the beginning and 113.2MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 363.85ms. Allocated memory is still 167.8MB. Free memory was 113.2MB in the beginning and 99.1MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1533.87ms. Allocated memory is still 167.8MB. Free memory was 98.7MB in the beginning and 42.7MB in the end (delta: 56.0MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Witness Printer took 5.25ms. Allocated memory is still 167.8MB. Free memory is still 42.7MB. 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 someBinaryDOUBLEComparisonOperation at line 71, overapproximation of someBinaryDOUBLEComparisonOperation at line 85, overapproximation of someBinaryDOUBLEComparisonOperation at line 53. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 10.8; [L23] unsigned char var_1_2 = 0; [L24] signed short int var_1_5 = -16; [L25] double var_1_6 = 100.01; [L26] unsigned short int var_1_7 = 50; [L27] signed short int var_1_8 = 5; [L28] unsigned short int var_1_9 = 256; [L29] signed long int var_1_10 = -100; [L30] unsigned long int var_1_12 = 10000000; [L31] unsigned short int var_1_13 = 2; [L32] unsigned short int var_1_14 = 4; [L33] double var_1_15 = 4.5; VAL [isInitial=0, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-16, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L89] isInitial = 1 [L90] FCALL initially() [L91] int k_loop; [L92] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-16, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L92] COND TRUE k_loop < 1 [L93] FCALL updateLastVariables() [L94] CALL updateVariables() [L63] var_1_2 = __VERIFIER_nondet_uchar() [L64] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_5=-16, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_5=-16, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L64] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_5=-16, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L65] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-16, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-16, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L65] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-16, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L66] var_1_5 = __VERIFIER_nondet_short() [L67] CALL assume_abort_if_not(var_1_5 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-1, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-1, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L67] RET assume_abort_if_not(var_1_5 >= -32768) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-1, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L68] CALL assume_abort_if_not(var_1_5 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-1, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-1, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L68] RET assume_abort_if_not(var_1_5 <= 32767) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-1, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L69] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-1, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-1, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L69] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-1, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L70] var_1_6 = __VERIFIER_nondet_double() [L71] CALL assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-1, var_1_7=50, var_1_8=5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-1, var_1_7=50, var_1_8=5, var_1_9=256] [L71] RET assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-1, var_1_7=50, var_1_8=5, var_1_9=256] [L72] var_1_8 = __VERIFIER_nondet_short() [L73] CALL assume_abort_if_not(var_1_8 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-1, var_1_7=50, var_1_8=1, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-1, var_1_7=50, var_1_8=1, var_1_9=256] [L73] RET assume_abort_if_not(var_1_8 >= -32767) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-1, var_1_7=50, var_1_8=1, var_1_9=256] [L74] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-1, var_1_7=50, var_1_8=1, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-1, var_1_7=50, var_1_8=1, var_1_9=256] [L74] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-1, var_1_7=50, var_1_8=1, var_1_9=256] [L75] var_1_9 = __VERIFIER_nondet_ushort() [L76] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-1, var_1_7=50, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-1, var_1_7=50, var_1_8=1] [L76] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-1, var_1_7=50, var_1_8=1] [L77] CALL assume_abort_if_not(var_1_9 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-1, var_1_7=50, var_1_8=1, var_1_9=229375] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-1, var_1_7=50, var_1_8=1, var_1_9=229375] [L77] RET assume_abort_if_not(var_1_9 <= 32767) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-1, var_1_7=50, var_1_8=1, var_1_9=229375] [L78] var_1_14 = __VERIFIER_nondet_ushort() [L79] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-1, var_1_7=50, var_1_8=1, var_1_9=229375] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-1, var_1_7=50, var_1_8=1, var_1_9=229375] [L79] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-1, var_1_7=50, var_1_8=1, var_1_9=229375] [L80] CALL assume_abort_if_not(var_1_14 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=0, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-1, var_1_7=50, var_1_8=1, var_1_9=229375] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=0, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-1, var_1_7=50, var_1_8=1, var_1_9=229375] [L80] RET assume_abort_if_not(var_1_14 <= 65534) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=0, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-1, var_1_7=50, var_1_8=1, var_1_9=229375] [L94] RET updateVariables() [L95] CALL step() [L37] COND TRUE ! (var_1_5 >= ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8)))) [L38] var_1_7 = (var_1_9 + 1) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=0, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-1, var_1_7=32768, var_1_8=1, var_1_9=229375] [L40] var_1_12 = var_1_9 [L41] var_1_13 = var_1_14 [L42] var_1_15 = var_1_6 [L43] unsigned long int stepLocal_0 = var_1_12; VAL [isInitial=1, stepLocal_0=32767, var_1_10=-100, var_1_12=32767, var_1_13=0, var_1_14=0, var_1_15=2, var_1_1=54/5, var_1_2=0, var_1_5=-1, var_1_6=2, var_1_7=32768, var_1_8=1, var_1_9=229375] [L44] COND FALSE !(\read(var_1_2)) [L51] var_1_1 = var_1_6 VAL [isInitial=1, stepLocal_0=32767, var_1_10=-100, var_1_12=32767, var_1_13=0, var_1_14=0, var_1_15=2, var_1_1=2, var_1_2=0, var_1_5=-1, var_1_6=2, var_1_7=32768, var_1_8=1, var_1_9=229375] [L53] unsigned char stepLocal_1 = (var_1_6 * var_1_15) >= var_1_1; VAL [isInitial=1, stepLocal_0=32767, stepLocal_1=0, var_1_10=-100, var_1_12=32767, var_1_13=0, var_1_14=0, var_1_15=2, var_1_1=2, var_1_2=0, var_1_5=-1, var_1_6=2, var_1_7=32768, var_1_8=1, var_1_9=229375] [L54] COND FALSE !(stepLocal_1 || var_1_2) [L59] var_1_10 = -1 VAL [isInitial=1, stepLocal_0=32767, var_1_10=-1, var_1_12=32767, var_1_13=0, var_1_14=0, var_1_15=2, var_1_1=2, var_1_2=0, var_1_5=-1, var_1_6=2, var_1_7=32768, var_1_8=1, var_1_9=229375] [L95] RET step() [L96] CALL, EXPR property() [L85-L86] return (((((var_1_2 ? ((var_1_12 >= (var_1_12 / var_1_5)) ? (var_1_1 == ((double) ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))))) : (var_1_1 == ((double) var_1_6))) : (var_1_1 == ((double) var_1_6))) && ((! (var_1_5 >= ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))) ? (var_1_7 == ((unsigned short int) (var_1_9 + 1))) : 1)) && ((((var_1_6 * var_1_15) >= var_1_1) || var_1_2) ? ((var_1_6 <= var_1_1) ? (var_1_10 == ((signed long int) var_1_9)) : 1) : (var_1_10 == ((signed long int) -1)))) && (var_1_12 == ((unsigned long int) var_1_9))) && (var_1_13 == ((unsigned short int) var_1_14))) && (var_1_15 == ((double) var_1_6)) ; VAL [\result=0, isInitial=1, var_1_10=-1, var_1_12=32767, var_1_13=0, var_1_14=0, var_1_15=2, var_1_1=2, var_1_2=0, var_1_5=-1, var_1_6=2, var_1_7=32768, var_1_8=1, var_1_9=229375] [L96] RET, EXPR property() [L96] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-1, var_1_12=32767, var_1_13=0, var_1_14=0, var_1_15=2, var_1_1=2, var_1_2=0, var_1_5=-1, var_1_6=2, var_1_7=32768, var_1_8=1, var_1_9=229375] [L19] reach_error() VAL [isInitial=1, var_1_10=-1, var_1_12=32767, var_1_13=0, var_1_14=0, var_1_15=2, var_1_1=2, var_1_2=0, var_1_5=-1, var_1_6=2, var_1_7=32768, var_1_8=1, var_1_9=229375] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 2, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 59 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, 59 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred 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.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 320 NumberOfCodeBlocks, 320 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 158 ConstructedInterpolants, 0 QuantifiedInterpolants, 158 SizeOfPredicates, 0 NumberOfNonLiveVariables, 205 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-01-09 13:19:17,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-51.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4d0d9346d03692e5aa17dc110f0097921008598edde0d474bc7067d212c257c2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:19:19,733 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:19:19,820 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 13:19:19,830 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:19:19,830 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:19:19,861 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:19:19,862 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:19:19,862 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:19:19,862 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:19:19,863 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:19:19,863 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:19:19,863 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:19:19,863 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:19:19,864 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:19:19,864 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:19:19,864 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:19:19,864 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:19:19,864 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:19:19,865 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:19:19,865 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:19:19,865 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:19:19,865 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:19:19,865 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:19:19,865 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 13:19:19,865 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 13:19:19,865 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 13:19:19,865 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:19:19,865 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:19:19,865 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:19:19,865 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:19:19,865 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:19:19,865 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:19:19,865 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:19:19,865 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:19:19,866 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:19:19,866 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:19:19,866 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:19:19,866 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:19:19,866 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:19:19,866 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:19:19,866 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:19:19,866 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:19:19,866 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:19:19,866 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:19:19,866 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 13:19:19,866 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 13:19:19,867 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:19:19,867 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:19:19,867 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:19:19,867 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:19:19,867 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4d0d9346d03692e5aa17dc110f0097921008598edde0d474bc7067d212c257c2 [2025-01-09 13:19:20,160 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:19:20,169 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:19:20,172 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:19:20,173 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:19:20,173 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:19:20,174 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-51.i [2025-01-09 13:19:21,436 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/be92a7b9a/d50dc4b0880e42dc9920415146aa482c/FLAG429e6699d [2025-01-09 13:19:21,674 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:19:21,675 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-51.i [2025-01-09 13:19:21,683 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/be92a7b9a/d50dc4b0880e42dc9920415146aa482c/FLAG429e6699d [2025-01-09 13:19:21,699 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/be92a7b9a/d50dc4b0880e42dc9920415146aa482c [2025-01-09 13:19:21,702 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:19:21,703 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:19:21,706 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:19:21,706 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:19:21,710 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:19:21,711 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:19:21" (1/1) ... [2025-01-09 13:19:21,711 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b439e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:21, skipping insertion in model container [2025-01-09 13:19:21,712 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:19:21" (1/1) ... [2025-01-09 13:19:21,729 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:19:21,866 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-51.i[915,928] [2025-01-09 13:19:21,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:19:21,936 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:19:21,946 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-51.i[915,928] [2025-01-09 13:19:21,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:19:21,994 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:19:21,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:21 WrapperNode [2025-01-09 13:19:21,996 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:19:21,997 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:19:21,997 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:19:21,997 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:19:22,003 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:21" (1/1) ... [2025-01-09 13:19:22,013 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:21" (1/1) ... [2025-01-09 13:19:22,039 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 94 [2025-01-09 13:19:22,039 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:19:22,041 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:19:22,041 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:19:22,041 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:19:22,049 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:21" (1/1) ... [2025-01-09 13:19:22,050 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:21" (1/1) ... [2025-01-09 13:19:22,056 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:21" (1/1) ... [2025-01-09 13:19:22,068 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 13:19:22,068 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:21" (1/1) ... [2025-01-09 13:19:22,068 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:21" (1/1) ... [2025-01-09 13:19:22,078 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:21" (1/1) ... [2025-01-09 13:19:22,079 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:21" (1/1) ... [2025-01-09 13:19:22,086 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:21" (1/1) ... [2025-01-09 13:19:22,088 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:21" (1/1) ... [2025-01-09 13:19:22,089 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:21" (1/1) ... [2025-01-09 13:19:22,091 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:19:22,097 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:19:22,097 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:19:22,098 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:19:22,099 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:21" (1/1) ... [2025-01-09 13:19:22,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:19:22,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:19:22,132 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 13:19:22,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 13:19:22,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:19:22,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 13:19:22,164 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:19:22,164 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:19:22,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:19:22,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:19:22,239 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:19:22,241 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:19:27,911 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-01-09 13:19:27,911 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:19:27,919 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:19:27,919 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 13:19:27,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:19:27 BoogieIcfgContainer [2025-01-09 13:19:27,920 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:19:27,922 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:19:27,922 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:19:27,926 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:19:27,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:19:21" (1/3) ... [2025-01-09 13:19:27,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@267fba7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:19:27, skipping insertion in model container [2025-01-09 13:19:27,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:21" (2/3) ... [2025-01-09 13:19:27,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@267fba7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:19:27, skipping insertion in model container [2025-01-09 13:19:27,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:19:27" (3/3) ... [2025-01-09 13:19:27,929 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-51.i [2025-01-09 13:19:27,941 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:19:27,942 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-51.i that has 2 procedures, 43 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:19:27,995 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:19:28,008 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;@4aff52dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:19:28,008 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:19:28,011 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 29 states have internal predecessors, (37), 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-01-09 13:19:28,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 13:19:28,019 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:19:28,020 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, 1, 1] [2025-01-09 13:19:28,020 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:19:28,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:19:28,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1237969454, now seen corresponding path program 1 times [2025-01-09 13:19:28,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:19:28,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1893014187] [2025-01-09 13:19:28,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:19:28,039 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-01-09 13:19:28,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:19:28,041 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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-01-09 13:19:28,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 13:19:28,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 13:19:28,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 13:19:28,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:19:28,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:19:28,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:19:28,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:19:28,384 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2025-01-09 13:19:28,384 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:19:28,384 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:19:28,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1893014187] [2025-01-09 13:19:28,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1893014187] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:19:28,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:19:28,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 13:19:28,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939035407] [2025-01-09 13:19:28,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:19:28,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:19:28,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:19:28,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:19:28,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:19:28,412 INFO L87 Difference]: Start difference. First operand has 43 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 29 states have internal predecessors, (37), 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 13.5) internal successors, (27), 2 states have internal predecessors, (27), 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-01-09 13:19:28,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:19:28,436 INFO L93 Difference]: Finished difference Result 83 states and 131 transitions. [2025-01-09 13:19:28,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:19:28,438 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 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 80 [2025-01-09 13:19:28,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:19:28,442 INFO L225 Difference]: With dead ends: 83 [2025-01-09 13:19:28,443 INFO L226 Difference]: Without dead ends: 40 [2025-01-09 13:19:28,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:19:28,449 INFO L435 NwaCegarLoop]: 59 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, 59 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:19:28,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:19:28,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-01-09 13:19:28,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-01-09 13:19:28,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 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-01-09 13:19:28,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 56 transitions. [2025-01-09 13:19:28,489 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 56 transitions. Word has length 80 [2025-01-09 13:19:28,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:19:28,490 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 56 transitions. [2025-01-09 13:19:28,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 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-01-09 13:19:28,491 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2025-01-09 13:19:28,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 13:19:28,494 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:19:28,494 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, 1, 1] [2025-01-09 13:19:28,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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)] Ended with exit code 0 [2025-01-09 13:19:28,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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-01-09 13:19:28,695 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:19:28,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:19:28,696 INFO L85 PathProgramCache]: Analyzing trace with hash -332843250, now seen corresponding path program 1 times [2025-01-09 13:19:28,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:19:28,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2056255122] [2025-01-09 13:19:28,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:19:28,697 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-01-09 13:19:28,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:19:28,699 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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-01-09 13:19:28,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 13:19:28,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 13:19:28,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 13:19:28,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:19:28,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:19:28,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 13:19:29,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:20:44,847 WARN L286 SmtUtils]: Spent 9.52s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)