./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-99.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-99.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5b933671a1fface527dbef89f2ee599c80d54d1c8c988a3b741df55fc4b83921 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:27:16,832 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:27:16,887 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 23:27:16,891 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:27:16,892 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:27:16,909 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:27:16,910 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:27:16,910 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:27:16,911 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:27:16,911 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:27:16,911 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:27:16,912 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:27:16,912 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:27:16,912 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:27:16,912 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:27:16,913 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:27:16,913 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:27:16,913 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:27:16,913 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 23:27:16,913 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:27:16,913 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:27:16,913 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:27:16,913 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:27:16,913 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:27:16,913 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:27:16,913 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:27:16,914 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:27:16,914 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:27:16,914 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:27:16,914 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:27:16,914 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:27:16,914 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:27:16,914 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:27:16,914 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:27:16,915 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:27:16,915 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:27:16,915 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:27:16,915 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 23:27:16,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 23:27:16,915 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:27:16,915 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:27:16,915 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:27:16,915 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:27:16,915 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5b933671a1fface527dbef89f2ee599c80d54d1c8c988a3b741df55fc4b83921 [2025-03-03 23:27:17,149 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:27:17,155 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:27:17,157 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:27:17,158 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:27:17,158 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:27:17,159 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-99.i [2025-03-03 23:27:18,280 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f60c865e/9c5c67a59e894943847b89506b387162/FLAGd71211ca0 [2025-03-03 23:27:18,532 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:27:18,532 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-99.i [2025-03-03 23:27:18,540 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f60c865e/9c5c67a59e894943847b89506b387162/FLAGd71211ca0 [2025-03-03 23:27:18,844 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f60c865e/9c5c67a59e894943847b89506b387162 [2025-03-03 23:27:18,846 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:27:18,847 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:27:18,848 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:27:18,848 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:27:18,851 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:27:18,852 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:27:18" (1/1) ... [2025-03-03 23:27:18,852 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7826c68c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:27:18, skipping insertion in model container [2025-03-03 23:27:18,852 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:27:18" (1/1) ... [2025-03-03 23:27:18,862 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:27:18,965 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-99.i[915,928] [2025-03-03 23:27:19,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:27:19,016 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:27:19,025 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-99.i[915,928] [2025-03-03 23:27:19,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:27:19,052 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:27:19,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:27:19 WrapperNode [2025-03-03 23:27:19,052 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:27:19,053 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:27:19,053 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:27:19,053 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:27:19,057 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:27:19" (1/1) ... [2025-03-03 23:27:19,062 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:27:19" (1/1) ... [2025-03-03 23:27:19,078 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 83 [2025-03-03 23:27:19,079 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:27:19,079 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:27:19,080 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:27:19,080 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:27:19,086 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:27:19" (1/1) ... [2025-03-03 23:27:19,086 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:27:19" (1/1) ... [2025-03-03 23:27:19,087 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:27:19" (1/1) ... [2025-03-03 23:27:19,095 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 23:27:19,095 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:27:19" (1/1) ... [2025-03-03 23:27:19,096 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:27:19" (1/1) ... [2025-03-03 23:27:19,099 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:27:19" (1/1) ... [2025-03-03 23:27:19,099 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:27:19" (1/1) ... [2025-03-03 23:27:19,100 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:27:19" (1/1) ... [2025-03-03 23:27:19,100 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:27:19" (1/1) ... [2025-03-03 23:27:19,101 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:27:19,102 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:27:19,102 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:27:19,102 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:27:19,102 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:27:19" (1/1) ... [2025-03-03 23:27:19,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:27:19,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:27:19,129 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 23:27:19,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 23:27:19,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:27:19,146 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:27:19,146 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:27:19,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 23:27:19,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:27:19,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:27:19,193 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:27:19,194 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:27:19,315 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-03 23:27:19,315 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:27:19,322 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:27:19,322 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:27:19,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:27:19 BoogieIcfgContainer [2025-03-03 23:27:19,324 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:27:19,326 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:27:19,326 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:27:19,329 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:27:19,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:27:18" (1/3) ... [2025-03-03 23:27:19,329 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@502099c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:27:19, skipping insertion in model container [2025-03-03 23:27:19,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:27:19" (2/3) ... [2025-03-03 23:27:19,330 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@502099c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:27:19, skipping insertion in model container [2025-03-03 23:27:19,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:27:19" (3/3) ... [2025-03-03 23:27:19,331 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-99.i [2025-03-03 23:27:19,341 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:27:19,345 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-99.i that has 2 procedures, 39 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:27:19,389 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:27:19,400 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;@1a5af76e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:27:19,401 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:27:19,404 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-03 23:27:19,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 23:27:19,411 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:27:19,411 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:27:19,411 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:27:19,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:27:19,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1866891103, now seen corresponding path program 1 times [2025-03-03 23:27:19,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:27:19,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975634628] [2025-03-03 23:27:19,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:27:19,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:27:19,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 23:27:19,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 23:27:19,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:27:19,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:27:19,549 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-03-03 23:27:19,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:27:19,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975634628] [2025-03-03 23:27:19,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975634628] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:27:19,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827039089] [2025-03-03 23:27:19,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:27:19,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:27:19,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:27:19,554 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:27:19,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 23:27:19,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 23:27:19,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 23:27:19,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:27:19,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:27:19,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:27:19,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:27:19,655 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-03-03 23:27:19,656 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:27:19,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827039089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:27:19,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:27:19,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 23:27:19,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373960225] [2025-03-03 23:27:19,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:27:19,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:27:19,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:27:19,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:27:19,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:27:19,675 INFO L87 Difference]: Start difference. First operand has 39 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 23:27:19,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:27:19,688 INFO L93 Difference]: Finished difference Result 72 states and 112 transitions. [2025-03-03 23:27:19,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:27:19,690 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 65 [2025-03-03 23:27:19,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:27:19,693 INFO L225 Difference]: With dead ends: 72 [2025-03-03 23:27:19,694 INFO L226 Difference]: Without dead ends: 36 [2025-03-03 23:27:19,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:27:19,698 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:27:19,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:27:19,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-03 23:27:19,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-03 23:27:19,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-03 23:27:19,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2025-03-03 23:27:19,720 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 65 [2025-03-03 23:27:19,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:27:19,720 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2025-03-03 23:27:19,720 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 23:27:19,720 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2025-03-03 23:27:19,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 23:27:19,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:27:19,722 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:27:19,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 23:27:19,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 23:27:19,926 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:27:19,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:27:19,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1103209948, now seen corresponding path program 1 times [2025-03-03 23:27:19,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:27:19,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965077388] [2025-03-03 23:27:19,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:27:19,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:27:19,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 23:27:19,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 23:27:19,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:27:19,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:27:19,972 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 23:27:19,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 23:27:20,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 23:27:20,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:27:20,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:27:20,032 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 23:27:20,032 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 23:27:20,033 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 23:27:20,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 23:27:20,036 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-03 23:27:20,078 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 23:27:20,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:27:20 BoogieIcfgContainer [2025-03-03 23:27:20,083 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 23:27:20,083 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 23:27:20,083 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 23:27:20,084 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 23:27:20,084 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:27:19" (3/4) ... [2025-03-03 23:27:20,086 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 23:27:20,086 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 23:27:20,087 INFO L158 Benchmark]: Toolchain (without parser) took 1239.91ms. Allocated memory is still 167.8MB. Free memory was 132.6MB in the beginning and 60.8MB in the end (delta: 71.8MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-03-03 23:27:20,088 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:27:20,088 INFO L158 Benchmark]: CACSL2BoogieTranslator took 204.53ms. Allocated memory is still 167.8MB. Free memory was 132.2MB in the beginning and 120.1MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:27:20,089 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.71ms. Allocated memory is still 167.8MB. Free memory was 120.1MB in the beginning and 118.5MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:27:20,089 INFO L158 Benchmark]: Boogie Preprocessor took 21.97ms. Allocated memory is still 167.8MB. Free memory was 118.5MB in the beginning and 116.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:27:20,089 INFO L158 Benchmark]: IcfgBuilder took 222.36ms. Allocated memory is still 167.8MB. Free memory was 116.9MB in the beginning and 103.1MB in the end (delta: 13.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:27:20,090 INFO L158 Benchmark]: TraceAbstraction took 756.92ms. Allocated memory is still 167.8MB. Free memory was 102.6MB in the beginning and 60.8MB in the end (delta: 41.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-03 23:27:20,090 INFO L158 Benchmark]: Witness Printer took 2.84ms. Allocated memory is still 167.8MB. Free memory is still 60.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:27:20,092 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.19ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 204.53ms. Allocated memory is still 167.8MB. Free memory was 132.2MB in the beginning and 120.1MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.71ms. Allocated memory is still 167.8MB. Free memory was 120.1MB in the beginning and 118.5MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.97ms. Allocated memory is still 167.8MB. Free memory was 118.5MB in the beginning and 116.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 222.36ms. Allocated memory is still 167.8MB. Free memory was 116.9MB in the beginning and 103.1MB in the end (delta: 13.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 756.92ms. Allocated memory is still 167.8MB. Free memory was 102.6MB in the beginning and 60.8MB in the end (delta: 41.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Witness Printer took 2.84ms. Allocated memory is still 167.8MB. Free memory is still 60.8MB. 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 someBinaryArithmeticDOUBLEoperation at line 43, overapproximation of someBinaryFLOATComparisonOperation at line 59, overapproximation of someBinaryFLOATComparisonOperation at line 63, overapproximation of someBinaryFLOATComparisonOperation at line 61, overapproximation of someBinaryFLOATComparisonOperation at line 75, overapproximation of someBinaryFLOATComparisonOperation at line 42, overapproximation of someUnaryDOUBLEoperation at line 43, overapproximation of someUnaryDOUBLEoperation at line 28, overapproximation of someBinaryDOUBLEComparisonOperation at line 65, overapproximation of someBinaryDOUBLEComparisonOperation at line 45, overapproximation of someBinaryDOUBLEComparisonOperation at line 67, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 43, overapproximation of someBinaryArithmeticFLOAToperation at line 38. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 255.5; [L23] unsigned char var_1_2 = 16; [L24] float var_1_4 = 1000000000000000.6; [L25] float var_1_5 = 500.5; [L26] float var_1_6 = 99999999999.5; [L27] double var_1_7 = 9.6; [L28] double var_1_8 = -0.2; [L29] double var_1_9 = 25.2; [L30] signed short int var_1_10 = 1; [L31] unsigned char var_1_11 = 0; [L32] signed long int var_1_15 = -64; VAL [isInitial=0, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_2=16, var_1_4=5000000000000003/5, var_1_5=1001/2, var_1_6=199999999999/2, var_1_7=48/5, var_1_9=126/5] [L79] isInitial = 1 [L80] FCALL initially() [L81] COND TRUE 1 [L82] FCALL updateLastVariables() [L83] CALL updateVariables() [L55] var_1_2 = __VERIFIER_nondet_uchar() [L56] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_4=5000000000000003/5, var_1_5=1001/2, var_1_6=199999999999/2, var_1_7=48/5, var_1_9=126/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_4=5000000000000003/5, var_1_5=1001/2, var_1_6=199999999999/2, var_1_7=48/5, var_1_9=126/5] [L56] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_4=5000000000000003/5, var_1_5=1001/2, var_1_6=199999999999/2, var_1_7=48/5, var_1_9=126/5] [L57] CALL assume_abort_if_not(var_1_2 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_4=5000000000000003/5, var_1_5=1001/2, var_1_6=199999999999/2, var_1_7=48/5, var_1_9=126/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_4=5000000000000003/5, var_1_5=1001/2, var_1_6=199999999999/2, var_1_7=48/5, var_1_9=126/5] [L57] RET assume_abort_if_not(var_1_2 <= 127) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_4=5000000000000003/5, var_1_5=1001/2, var_1_6=199999999999/2, var_1_7=48/5, var_1_9=126/5] [L58] var_1_4 = __VERIFIER_nondet_float() [L59] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_5=1001/2, var_1_6=199999999999/2, var_1_7=48/5, var_1_9=126/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_5=1001/2, var_1_6=199999999999/2, var_1_7=48/5, var_1_9=126/5] [L59] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_5=1001/2, var_1_6=199999999999/2, var_1_7=48/5, var_1_9=126/5] [L60] var_1_5 = __VERIFIER_nondet_float() [L61] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_6=199999999999/2, var_1_7=48/5, var_1_9=126/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_6=199999999999/2, var_1_7=48/5, var_1_9=126/5] [L61] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_6=199999999999/2, var_1_7=48/5, var_1_9=126/5] [L62] var_1_6 = __VERIFIER_nondet_float() [L63] CALL assume_abort_if_not((var_1_6 >= 0.0F && 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=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_7=48/5, var_1_9=126/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_7=48/5, var_1_9=126/5] [L63] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_7=48/5, var_1_9=126/5] [L64] var_1_8 = __VERIFIER_nondet_double() [L65] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_7=48/5, var_1_9=126/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_7=48/5, var_1_9=126/5] [L65] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_7=48/5, var_1_9=126/5] [L66] var_1_9 = __VERIFIER_nondet_double() [L67] CALL assume_abort_if_not((var_1_9 >= -461168.6018427382800e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_7=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_7=48/5] [L67] RET assume_abort_if_not((var_1_9 >= -461168.6018427382800e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_7=48/5] [L68] var_1_11 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_7=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_7=48/5] [L69] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=1, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_7=48/5] [L70] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_7=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_7=48/5] [L70] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_7=48/5] [L83] RET updateVariables() [L84] CALL step() [L36] signed long int stepLocal_0 = (((8) < 0 ) ? -(8) : (8)); VAL [isInitial=1, stepLocal_0=8, var_1_10=1, var_1_11=1, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_7=48/5] [L37] COND TRUE (((((200) < (128)) ? (200) : (128))) - var_1_2) > stepLocal_0 [L38] var_1_1 = (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))) - var_1_6) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_15=-64, var_1_2=119, var_1_7=48/5] [L42] COND TRUE var_1_5 >= (var_1_4 + var_1_6) [L43] var_1_7 = ((((var_1_8 + var_1_9) < 0 ) ? -(var_1_8 + var_1_9) : (var_1_8 + var_1_9))) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_15=-64, var_1_2=119, var_1_7=1000000000000005] [L45] COND FALSE !(((var_1_6 - var_1_4) + var_1_7) >= var_1_5) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_15=-64, var_1_2=119, var_1_7=1000000000000005] [L50] COND TRUE ((var_1_2 + var_1_15) + var_1_15) >= var_1_15 [L51] var_1_10 = var_1_2 VAL [isInitial=1, var_1_10=119, var_1_11=1, var_1_15=-64, var_1_2=119, var_1_7=1000000000000005] [L84] RET step() [L85] CALL, EXPR property() [L75-L76] return (((((((((200) < (128)) ? (200) : (128))) - var_1_2) > ((((8) < 0 ) ? -(8) : (8)))) ? (var_1_1 == ((float) (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))) - var_1_6))) : (var_1_1 == ((float) var_1_6))) && ((var_1_5 >= (var_1_4 + var_1_6)) ? (var_1_7 == ((double) ((((var_1_8 + var_1_9) < 0 ) ? -(var_1_8 + var_1_9) : (var_1_8 + var_1_9))))) : 1)) && ((((var_1_2 + var_1_15) + var_1_15) >= var_1_15) ? (var_1_10 == ((signed short int) var_1_2)) : 1)) && ((((var_1_6 - var_1_4) + var_1_7) >= var_1_5) ? (var_1_11 ? (var_1_15 == ((signed long int) 100)) : 1) : 1) ; VAL [\result=0, isInitial=1, var_1_10=119, var_1_11=1, var_1_15=-64, var_1_2=119, var_1_7=1000000000000005] [L85] RET, EXPR property() [L85] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=119, var_1_11=1, var_1_15=-64, var_1_2=119, var_1_7=1000000000000005] [L19] reach_error() VAL [isInitial=1, var_1_10=119, var_1_11=1, var_1_15=-64, var_1_2=119, var_1_7=1000000000000005] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 49 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 49 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 195 NumberOfCodeBlocks, 195 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 128 ConstructedInterpolants, 0 QuantifiedInterpolants, 128 SizeOfPredicates, 0 NumberOfNonLiveVariables, 158 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 272/288 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 23:27:20,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-99.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5b933671a1fface527dbef89f2ee599c80d54d1c8c988a3b741df55fc4b83921 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:27:21,906 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:27:21,982 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 23:27:21,990 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:27:21,992 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:27:22,007 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:27:22,008 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:27:22,008 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:27:22,008 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:27:22,008 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:27:22,009 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:27:22,009 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:27:22,009 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:27:22,009 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:27:22,009 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:27:22,009 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:27:22,009 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:27:22,009 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:27:22,009 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:27:22,010 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:27:22,010 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:27:22,010 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:27:22,010 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:27:22,010 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 23:27:22,010 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 23:27:22,010 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 23:27:22,010 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:27:22,010 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:27:22,010 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:27:22,010 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:27:22,011 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:27:22,011 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:27:22,011 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:27:22,011 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:27:22,011 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:27:22,011 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:27:22,011 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:27:22,011 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:27:22,011 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:27:22,011 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 23:27:22,011 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 23:27:22,012 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:27:22,012 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:27:22,012 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:27:22,012 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:27:22,012 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5b933671a1fface527dbef89f2ee599c80d54d1c8c988a3b741df55fc4b83921 [2025-03-03 23:27:22,247 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:27:22,256 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:27:22,258 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:27:22,260 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:27:22,260 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:27:22,261 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-99.i [2025-03-03 23:27:23,446 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae83b7c8b/81fdd2b3e6884ae7b79be8e73453e451/FLAG04d83a826 [2025-03-03 23:27:23,642 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:27:23,642 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-99.i [2025-03-03 23:27:23,649 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae83b7c8b/81fdd2b3e6884ae7b79be8e73453e451/FLAG04d83a826 [2025-03-03 23:27:24,017 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae83b7c8b/81fdd2b3e6884ae7b79be8e73453e451 [2025-03-03 23:27:24,021 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:27:24,023 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:27:24,024 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:27:24,024 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:27:24,027 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:27:24,028 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:27:24" (1/1) ... [2025-03-03 23:27:24,028 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dfc3084 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:27:24, skipping insertion in model container [2025-03-03 23:27:24,029 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:27:24" (1/1) ... [2025-03-03 23:27:24,043 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:27:24,138 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-99.i[915,928] [2025-03-03 23:27:24,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:27:24,177 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:27:24,188 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-99.i[915,928] [2025-03-03 23:27:24,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:27:24,214 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:27:24,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:27:24 WrapperNode [2025-03-03 23:27:24,216 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:27:24,217 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:27:24,217 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:27:24,217 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:27:24,221 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:27:24" (1/1) ... [2025-03-03 23:27:24,228 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:27:24" (1/1) ... [2025-03-03 23:27:24,242 INFO L138 Inliner]: procedures = 27, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 83 [2025-03-03 23:27:24,242 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:27:24,243 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:27:24,243 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:27:24,243 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:27:24,248 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:27:24" (1/1) ... [2025-03-03 23:27:24,249 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:27:24" (1/1) ... [2025-03-03 23:27:24,251 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:27:24" (1/1) ... [2025-03-03 23:27:24,259 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 23:27:24,259 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:27:24" (1/1) ... [2025-03-03 23:27:24,259 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:27:24" (1/1) ... [2025-03-03 23:27:24,267 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:27:24" (1/1) ... [2025-03-03 23:27:24,267 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:27:24" (1/1) ... [2025-03-03 23:27:24,270 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:27:24" (1/1) ... [2025-03-03 23:27:24,271 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:27:24" (1/1) ... [2025-03-03 23:27:24,272 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:27:24,273 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:27:24,273 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:27:24,273 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:27:24,274 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:27:24" (1/1) ... [2025-03-03 23:27:24,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:27:24,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:27:24,296 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 23:27:24,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 23:27:24,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:27:24,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 23:27:24,313 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:27:24,313 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:27:24,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:27:24,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:27:24,359 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:27:24,361 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:27:32,036 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-03 23:27:32,036 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:27:32,044 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:27:32,045 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:27:32,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:27:32 BoogieIcfgContainer [2025-03-03 23:27:32,046 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:27:32,047 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:27:32,047 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:27:32,051 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:27:32,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:27:24" (1/3) ... [2025-03-03 23:27:32,051 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@535b9400 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:27:32, skipping insertion in model container [2025-03-03 23:27:32,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:27:24" (2/3) ... [2025-03-03 23:27:32,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@535b9400 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:27:32, skipping insertion in model container [2025-03-03 23:27:32,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:27:32" (3/3) ... [2025-03-03 23:27:32,053 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-99.i [2025-03-03 23:27:32,063 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:27:32,064 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-99.i that has 2 procedures, 39 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:27:32,103 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:27:32,115 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;@5b49680, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:27:32,115 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:27:32,118 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-03 23:27:32,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 23:27:32,123 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:27:32,124 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:27:32,124 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:27:32,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:27:32,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1866891103, now seen corresponding path program 1 times [2025-03-03 23:27:32,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:27:32,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [270839733] [2025-03-03 23:27:32,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:27:32,137 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:27:32,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:27:32,139 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 23:27:32,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-03 23:27:32,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 23:27:32,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 23:27:32,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:27:32,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:27:32,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:27:32,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:27:32,475 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-03 23:27:32,475 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:27:32,476 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:27:32,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [270839733] [2025-03-03 23:27:32,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [270839733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:27:32,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:27:32,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 23:27:32,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921409397] [2025-03-03 23:27:32,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:27:32,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:27:32,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:27:32,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:27:32,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:27:32,494 INFO L87 Difference]: Start difference. First operand has 39 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) 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, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 23:27:32,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:27:32,507 INFO L93 Difference]: Finished difference Result 72 states and 112 transitions. [2025-03-03 23:27:32,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:27:32,508 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, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 65 [2025-03-03 23:27:32,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:27:32,512 INFO L225 Difference]: With dead ends: 72 [2025-03-03 23:27:32,512 INFO L226 Difference]: Without dead ends: 36 [2025-03-03 23:27:32,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:27:32,516 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:27:32,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:27:32,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-03 23:27:32,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-03 23:27:32,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-03 23:27:32,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2025-03-03 23:27:32,545 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 65 [2025-03-03 23:27:32,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:27:32,546 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2025-03-03 23:27:32,546 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, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 23:27:32,546 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2025-03-03 23:27:32,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 23:27:32,548 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:27:32,548 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:27:32,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-03 23:27:32,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:27:32,749 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:27:32,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:27:32,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1103209948, now seen corresponding path program 1 times [2025-03-03 23:27:32,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:27:32,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2004280060] [2025-03-03 23:27:32,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:27:32,750 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:27:32,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:27:32,752 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 23:27:32,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-03 23:27:32,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 23:27:33,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 23:27:33,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:27:33,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:27:33,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-03 23:27:33,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:28:00,463 WARN L286 SmtUtils]: Spent 6.73s on a formula simplification that was a NOOP. DAG size: 63 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-03 23:28:49,626 WARN L286 SmtUtils]: Spent 18.68s on a formula simplification that was a NOOP. DAG size: 74 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-03 23:28:57,730 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)