./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-77.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-77.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 eff1ff2fbe095e30506b4d334a945725d3f6714ca8682efc4ac13327e20d214d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:43:31,704 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:43:31,753 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 03:43:31,757 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:43:31,758 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:43:31,773 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:43:31,773 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:43:31,774 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:43:31,774 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:43:31,774 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:43:31,774 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:43:31,774 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:43:31,774 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:43:31,775 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:43:31,775 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:43:31,775 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:43:31,775 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:43:31,775 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:43:31,775 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 03:43:31,775 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:43:31,775 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:43:31,775 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:43:31,775 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:43:31,776 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:43:31,776 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:43:31,776 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:43:31,776 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:43:31,776 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:43:31,776 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:43:31,776 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:43:31,776 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:43:31,776 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:43:31,776 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:43:31,776 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:43:31,777 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:43:31,777 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:43:31,777 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:43:31,777 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 03:43:31,777 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 03:43:31,777 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:43:31,777 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:43:31,777 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:43:31,777 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:43:31,777 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 -> eff1ff2fbe095e30506b4d334a945725d3f6714ca8682efc4ac13327e20d214d [2025-03-17 03:43:32,014 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:43:32,023 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:43:32,026 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:43:32,027 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:43:32,028 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:43:32,028 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-77.i [2025-03-17 03:43:33,265 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cd5328ee/c133b3ac97ce424cb6f20e9a248e9e05/FLAGd5ec13059 [2025-03-17 03:43:33,605 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:43:33,606 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-77.i [2025-03-17 03:43:33,614 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cd5328ee/c133b3ac97ce424cb6f20e9a248e9e05/FLAGd5ec13059 [2025-03-17 03:43:33,633 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cd5328ee/c133b3ac97ce424cb6f20e9a248e9e05 [2025-03-17 03:43:33,636 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:43:33,637 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:43:33,638 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:43:33,639 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:43:33,645 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:43:33,645 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:43:33" (1/1) ... [2025-03-17 03:43:33,646 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4333af9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:33, skipping insertion in model container [2025-03-17 03:43:33,646 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:43:33" (1/1) ... [2025-03-17 03:43:33,663 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:43:33,769 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-77.i[915,928] [2025-03-17 03:43:33,804 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:43:33,815 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:43:33,825 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-77.i[915,928] [2025-03-17 03:43:33,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:43:33,865 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:43:33,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:33 WrapperNode [2025-03-17 03:43:33,866 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:43:33,866 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:43:33,866 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:43:33,866 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:43:33,872 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:33" (1/1) ... [2025-03-17 03:43:33,879 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:33" (1/1) ... [2025-03-17 03:43:33,902 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 100 [2025-03-17 03:43:33,902 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:43:33,903 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:43:33,903 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:43:33,903 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:43:33,915 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:33" (1/1) ... [2025-03-17 03:43:33,915 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:33" (1/1) ... [2025-03-17 03:43:33,917 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:33" (1/1) ... [2025-03-17 03:43:33,931 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 03:43:33,931 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:33" (1/1) ... [2025-03-17 03:43:33,931 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:33" (1/1) ... [2025-03-17 03:43:33,938 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:33" (1/1) ... [2025-03-17 03:43:33,941 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:33" (1/1) ... [2025-03-17 03:43:33,942 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:33" (1/1) ... [2025-03-17 03:43:33,943 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:33" (1/1) ... [2025-03-17 03:43:33,945 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:43:33,950 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:43:33,950 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:43:33,950 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:43:33,953 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:33" (1/1) ... [2025-03-17 03:43:33,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:43:33,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:43:33,980 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 03:43:33,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 03:43:34,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:43:34,003 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:43:34,003 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:43:34,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 03:43:34,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:43:34,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:43:34,062 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:43:34,064 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:43:34,287 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-17 03:43:34,290 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:43:34,305 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:43:34,306 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:43:34,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:43:34 BoogieIcfgContainer [2025-03-17 03:43:34,307 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:43:34,310 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:43:34,311 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:43:34,315 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:43:34,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:43:33" (1/3) ... [2025-03-17 03:43:34,316 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31aa0bb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:43:34, skipping insertion in model container [2025-03-17 03:43:34,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:33" (2/3) ... [2025-03-17 03:43:34,317 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31aa0bb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:43:34, skipping insertion in model container [2025-03-17 03:43:34,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:43:34" (3/3) ... [2025-03-17 03:43:34,318 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-77.i [2025-03-17 03:43:34,329 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:43:34,332 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-77.i that has 2 procedures, 43 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:43:34,383 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:43:34,393 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;@4c9a5f2c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:43:34,394 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:43:34,399 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 03:43:34,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-17 03:43:34,406 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:43:34,406 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:43:34,408 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:43:34,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:43:34,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1479551599, now seen corresponding path program 1 times [2025-03-17 03:43:34,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:43:34,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327389768] [2025-03-17 03:43:34,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:43:34,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:43:34,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 03:43:34,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 03:43:34,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:43:34,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:43:34,614 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-17 03:43:34,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:43:34,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327389768] [2025-03-17 03:43:34,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327389768] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:43:34,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753713451] [2025-03-17 03:43:34,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:43:34,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:43:34,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:43:34,618 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:43:34,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 03:43:34,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 03:43:34,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 03:43:34,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:43:34,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:43:34,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:43:34,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:43:34,771 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-17 03:43:34,772 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:43:34,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753713451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:43:34,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:43:34,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 03:43:34,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360362822] [2025-03-17 03:43:34,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:43:34,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:43:34,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:43:34,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:43:34,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:43:34,794 INFO L87 Difference]: Start difference. First operand has 43 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 03:43:34,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:43:34,809 INFO L93 Difference]: Finished difference Result 83 states and 139 transitions. [2025-03-17 03:43:34,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:43:34,812 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 94 [2025-03-17 03:43:34,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:43:34,816 INFO L225 Difference]: With dead ends: 83 [2025-03-17 03:43:34,816 INFO L226 Difference]: Without dead ends: 41 [2025-03-17 03:43:34,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:43:34,821 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-03-17 03:43:34,823 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-03-17 03:43:34,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-17 03:43:34,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-03-17 03:43:34,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 03:43:34,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 59 transitions. [2025-03-17 03:43:34,857 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 59 transitions. Word has length 94 [2025-03-17 03:43:34,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:43:34,858 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 59 transitions. [2025-03-17 03:43:34,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 03:43:34,858 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 59 transitions. [2025-03-17 03:43:34,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-17 03:43:34,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:43:34,861 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:43:34,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 03:43:35,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 03:43:35,062 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:43:35,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:43:35,064 INFO L85 PathProgramCache]: Analyzing trace with hash 774166796, now seen corresponding path program 1 times [2025-03-17 03:43:35,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:43:35,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555251131] [2025-03-17 03:43:35,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:43:35,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:43:35,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 03:43:35,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 03:43:35,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:43:35,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:43:35,196 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 03:43:35,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 03:43:35,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 03:43:35,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:43:35,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:43:35,317 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 03:43:35,318 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 03:43:35,319 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 03:43:35,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 03:43:35,322 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-17 03:43:35,381 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 03:43:35,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:43:35 BoogieIcfgContainer [2025-03-17 03:43:35,387 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 03:43:35,387 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 03:43:35,387 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 03:43:35,388 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 03:43:35,389 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:43:34" (3/4) ... [2025-03-17 03:43:35,391 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 03:43:35,392 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 03:43:35,393 INFO L158 Benchmark]: Toolchain (without parser) took 1755.18ms. Allocated memory is still 201.3MB. Free memory was 154.8MB in the beginning and 57.8MB in the end (delta: 96.9MB). Peak memory consumption was 92.3MB. Max. memory is 16.1GB. [2025-03-17 03:43:35,393 INFO L158 Benchmark]: CDTParser took 0.68ms. Allocated memory is still 201.3MB. Free memory is still 117.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:43:35,393 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.39ms. Allocated memory is still 201.3MB. Free memory was 154.4MB in the beginning and 141.6MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:43:35,393 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.70ms. Allocated memory is still 201.3MB. Free memory was 141.6MB in the beginning and 139.4MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:43:35,393 INFO L158 Benchmark]: Boogie Preprocessor took 42.24ms. Allocated memory is still 201.3MB. Free memory was 139.4MB in the beginning and 135.8MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:43:35,395 INFO L158 Benchmark]: IcfgBuilder took 357.85ms. Allocated memory is still 201.3MB. Free memory was 135.8MB in the beginning and 118.2MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 03:43:35,395 INFO L158 Benchmark]: TraceAbstraction took 1076.40ms. Allocated memory is still 201.3MB. Free memory was 117.8MB in the beginning and 58.3MB in the end (delta: 59.5MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-17 03:43:35,395 INFO L158 Benchmark]: Witness Printer took 4.59ms. Allocated memory is still 201.3MB. Free memory was 58.3MB in the beginning and 57.8MB in the end (delta: 411.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:43:35,396 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.68ms. Allocated memory is still 201.3MB. Free memory is still 117.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 227.39ms. Allocated memory is still 201.3MB. Free memory was 154.4MB in the beginning and 141.6MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.70ms. Allocated memory is still 201.3MB. Free memory was 141.6MB in the beginning and 139.4MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.24ms. Allocated memory is still 201.3MB. Free memory was 139.4MB in the beginning and 135.8MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 357.85ms. Allocated memory is still 201.3MB. Free memory was 135.8MB in the beginning and 118.2MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1076.40ms. Allocated memory is still 201.3MB. Free memory was 117.8MB in the beginning and 58.3MB in the end (delta: 59.5MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Witness Printer took 4.59ms. Allocated memory is still 201.3MB. Free memory was 58.3MB in the beginning and 57.8MB in the end (delta: 411.5kB). 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 someBinaryFLOATComparisonOperation at line 88, overapproximation of someBinaryFLOATComparisonOperation at line 73, overapproximation of someBinaryFLOATComparisonOperation at line 46, overapproximation of someBinaryFLOATComparisonOperation at line 75, overapproximation of someBinaryFLOATComparisonOperation at line 77, overapproximation of someBinaryArithmeticFLOAToperation at line 42. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 50; [L23] unsigned short int var_1_4 = 60871; [L24] unsigned short int var_1_5 = 1; [L25] unsigned short int var_1_6 = 28896; [L26] unsigned short int var_1_7 = 5; [L27] float var_1_8 = 63.8; [L28] float var_1_9 = 49.5; [L29] float var_1_10 = 31.875; [L30] float var_1_11 = 255.25; [L31] unsigned short int var_1_12 = 0; [L32] unsigned char var_1_13 = 0; [L33] unsigned char var_1_14 = 1; [L34] float var_1_16 = 0.8; [L35] unsigned short int var_1_17 = 64; [L92] isInitial = 1 [L93] FCALL initially() [L94] COND TRUE 1 [L95] FCALL updateLastVariables() [L96] CALL updateVariables() [L60] var_1_4 = __VERIFIER_nondet_ushort() [L61] CALL assume_abort_if_not(var_1_4 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-32739, var_1_5=1, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-32739, var_1_5=1, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L61] RET assume_abort_if_not(var_1_4 >= 32767) VAL [isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-32739, var_1_5=1, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L62] CALL assume_abort_if_not(var_1_4 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-32739, var_1_5=1, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-32739, var_1_5=1, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L62] RET assume_abort_if_not(var_1_4 <= 65534) VAL [isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-32739, var_1_5=1, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L63] var_1_5 = __VERIFIER_nondet_ushort() [L64] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-32739, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-32739, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L64] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-32739, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L65] CALL assume_abort_if_not(var_1_5 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-32739, var_1_5=32766, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-32739, var_1_5=32766, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L65] RET assume_abort_if_not(var_1_5 <= 32767) VAL [isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-32739, var_1_5=32766, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L66] var_1_6 = __VERIFIER_nondet_ushort() [L67] CALL assume_abort_if_not(var_1_6 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-32739, var_1_5=32766, var_1_6=32767, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-32739, var_1_5=32766, var_1_6=32767, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L67] RET assume_abort_if_not(var_1_6 >= 16383) VAL [isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-32739, var_1_5=32766, var_1_6=32767, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L68] CALL assume_abort_if_not(var_1_6 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-32739, var_1_5=32766, var_1_6=32767, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-32739, var_1_5=32766, var_1_6=32767, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L68] RET assume_abort_if_not(var_1_6 <= 32767) VAL [isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-32739, var_1_5=32766, var_1_6=32767, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L69] var_1_7 = __VERIFIER_nondet_ushort() [L70] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-32739, var_1_5=32766, var_1_6=32767, var_1_8=319/5, var_1_9=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-32739, var_1_5=32766, var_1_6=32767, var_1_8=319/5, var_1_9=99/2] [L70] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-32739, var_1_5=32766, var_1_6=32767, var_1_8=319/5, var_1_9=99/2] [L71] CALL assume_abort_if_not(var_1_7 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-32739, var_1_5=32766, var_1_6=32767, var_1_7=0, var_1_8=319/5, var_1_9=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-32739, var_1_5=32766, var_1_6=32767, var_1_7=0, var_1_8=319/5, var_1_9=99/2] [L71] RET assume_abort_if_not(var_1_7 <= 16383) VAL [isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-32739, var_1_5=32766, var_1_6=32767, var_1_7=0, var_1_8=319/5, var_1_9=99/2] [L72] var_1_9 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-32739, var_1_5=32766, var_1_6=32767, var_1_7=0, var_1_8=319/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-32739, var_1_5=32766, var_1_6=32767, var_1_7=0, var_1_8=319/5] [L73] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-32739, var_1_5=32766, var_1_6=32767, var_1_7=0, var_1_8=319/5] [L74] var_1_10 = __VERIFIER_nondet_float() [L75] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-32739, var_1_5=32766, var_1_6=32767, var_1_7=0, var_1_8=319/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-32739, var_1_5=32766, var_1_6=32767, var_1_7=0, var_1_8=319/5] [L75] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-32739, var_1_5=32766, var_1_6=32767, var_1_7=0, var_1_8=319/5] [L76] var_1_11 = __VERIFIER_nondet_float() [L77] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-32739, var_1_5=32766, var_1_6=32767, var_1_7=0, var_1_8=319/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-32739, var_1_5=32766, var_1_6=32767, var_1_7=0, var_1_8=319/5] [L77] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-32739, var_1_5=32766, var_1_6=32767, var_1_7=0, var_1_8=319/5] [L78] var_1_13 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-32739, var_1_5=32766, var_1_6=32767, var_1_7=0, var_1_8=319/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-32739, var_1_5=32766, var_1_6=32767, var_1_7=0, var_1_8=319/5] [L79] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_12=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-32739, var_1_5=32766, var_1_6=32767, var_1_7=0, var_1_8=319/5] [L80] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=-256, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-32739, var_1_5=32766, var_1_6=32767, var_1_7=0, var_1_8=319/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=-256, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-32739, var_1_5=32766, var_1_6=32767, var_1_7=0, var_1_8=319/5] [L80] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_12=0, var_1_13=-256, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-32739, var_1_5=32766, var_1_6=32767, var_1_7=0, var_1_8=319/5] [L81] var_1_14 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=-256, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-32739, var_1_5=32766, var_1_6=32767, var_1_7=0, var_1_8=319/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=-256, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-32739, var_1_5=32766, var_1_6=32767, var_1_7=0, var_1_8=319/5] [L82] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_12=0, var_1_13=-256, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-32739, var_1_5=32766, var_1_6=32767, var_1_7=0, var_1_8=319/5] [L83] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=-256, var_1_14=0, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-32739, var_1_5=32766, var_1_6=32767, var_1_7=0, var_1_8=319/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=-256, var_1_14=0, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-32739, var_1_5=32766, var_1_6=32767, var_1_7=0, var_1_8=319/5] [L83] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, var_1_12=0, var_1_13=-256, var_1_14=0, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-32739, var_1_5=32766, var_1_6=32767, var_1_7=0, var_1_8=319/5] [L96] RET updateVariables() [L97] CALL step() [L39] COND FALSE !(var_1_7 > var_1_5) [L42] var_1_8 = (((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - 1.6f) VAL [isInitial=1, var_1_12=0, var_1_13=-256, var_1_14=0, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-32739, var_1_5=32766, var_1_6=32767, var_1_7=0] [L44] var_1_16 = var_1_11 [L45] var_1_17 = var_1_5 VAL [isInitial=1, var_1_11=60876, var_1_12=0, var_1_13=-256, var_1_14=0, var_1_16=60876, var_1_17=32766, var_1_1=50, var_1_4=-32739, var_1_5=32766, var_1_6=32767, var_1_7=0] [L46] COND TRUE var_1_8 != var_1_16 [L47] var_1_1 = (var_1_4 - ((((var_1_5) < ((var_1_6 - var_1_7))) ? (var_1_5) : ((var_1_6 - var_1_7))))) VAL [isInitial=1, var_1_11=60876, var_1_12=0, var_1_13=-256, var_1_14=0, var_1_16=60876, var_1_17=32766, var_1_1=31, var_1_4=-32739, var_1_5=32766, var_1_6=32767, var_1_7=0] [L49] unsigned char stepLocal_1 = var_1_13; [L50] signed long int stepLocal_0 = (((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6)); VAL [isInitial=1, stepLocal_0=32766, stepLocal_1=-256, var_1_11=60876, var_1_12=0, var_1_13=-256, var_1_14=0, var_1_16=60876, var_1_17=32766, var_1_1=31, var_1_4=-32739, var_1_5=32766, var_1_6=32767, var_1_7=0] [L51] COND FALSE !(stepLocal_1 && var_1_14) [L56] var_1_12 = 64 VAL [isInitial=1, stepLocal_0=32766, var_1_11=60876, var_1_12=64, var_1_13=-256, var_1_14=0, var_1_16=60876, var_1_17=32766, var_1_1=31, var_1_4=-32739, var_1_5=32766, var_1_6=32767, var_1_7=0] [L97] RET step() [L98] CALL, EXPR property() [L88-L89] return (((((var_1_8 != var_1_16) ? (var_1_1 == ((unsigned short int) (var_1_4 - ((((var_1_5) < ((var_1_6 - var_1_7))) ? (var_1_5) : ((var_1_6 - var_1_7))))))) : 1) && ((var_1_7 > var_1_5) ? (var_1_8 == ((float) ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))))) : (var_1_8 == ((float) (((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - 1.6f))))) && ((var_1_13 && var_1_14) ? ((((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6))) < ((((32) > ((var_1_1 - var_1_7))) ? (32) : ((var_1_1 - var_1_7))))) ? (var_1_12 == ((unsigned short int) (var_1_7 + 5))) : 1) : (var_1_12 == ((unsigned short int) 64)))) && (var_1_16 == ((float) var_1_11))) && (var_1_17 == ((unsigned short int) var_1_5)) ; [L98] RET, EXPR property() [L98] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=60876, var_1_12=64, var_1_13=-256, var_1_14=0, var_1_16=60876, var_1_17=32766, var_1_1=31, var_1_4=-32739, var_1_5=32766, var_1_6=32767, var_1_7=0] [L19] reach_error() VAL [isInitial=1, var_1_11=60876, var_1_12=64, var_1_13=-256, var_1_14=0, var_1_16=60876, var_1_17=32766, var_1_1=31, var_1_4=-32739, var_1_5=32766, var_1_6=32767, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 43 locations, 78 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 2, TraceHistogramMax: 15, 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, 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, 95 GetRequests, 95 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.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 282 NumberOfCodeBlocks, 282 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 186 ConstructedInterpolants, 0 QuantifiedInterpolants, 186 SizeOfPredicates, 0 NumberOfNonLiveVariables, 224 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 812/840 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 03:43:35,417 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-77.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 eff1ff2fbe095e30506b4d334a945725d3f6714ca8682efc4ac13327e20d214d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:43:37,655 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:43:37,750 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 03:43:37,754 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:43:37,754 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:43:37,771 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:43:37,773 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:43:37,773 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:43:37,773 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:43:37,774 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:43:37,774 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:43:37,774 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:43:37,775 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:43:37,775 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:43:37,775 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:43:37,775 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:43:37,776 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:43:37,776 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:43:37,776 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:43:37,776 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:43:37,776 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:43:37,776 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:43:37,776 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:43:37,776 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 03:43:37,776 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 03:43:37,776 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 03:43:37,776 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:43:37,777 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:43:37,777 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:43:37,777 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:43:37,777 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:43:37,777 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:43:37,777 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:43:37,777 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:43:37,777 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:43:37,778 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:43:37,778 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:43:37,778 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:43:37,778 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:43:37,778 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 03:43:37,778 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 03:43:37,778 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:43:37,778 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:43:37,778 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:43:37,779 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:43:37,779 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 -> eff1ff2fbe095e30506b4d334a945725d3f6714ca8682efc4ac13327e20d214d [2025-03-17 03:43:38,035 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:43:38,044 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:43:38,045 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:43:38,047 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:43:38,047 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:43:38,049 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-77.i [2025-03-17 03:43:39,272 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df960d69a/2ce68f8fc987454d8da775b746abf3b1/FLAG698d70698 [2025-03-17 03:43:39,466 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:43:39,468 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-77.i [2025-03-17 03:43:39,477 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df960d69a/2ce68f8fc987454d8da775b746abf3b1/FLAG698d70698 [2025-03-17 03:43:39,497 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df960d69a/2ce68f8fc987454d8da775b746abf3b1 [2025-03-17 03:43:39,503 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:43:39,504 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:43:39,505 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:43:39,505 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:43:39,509 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:43:39,509 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:43:39" (1/1) ... [2025-03-17 03:43:39,510 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@88a877f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:39, skipping insertion in model container [2025-03-17 03:43:39,510 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:43:39" (1/1) ... [2025-03-17 03:43:39,527 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:43:39,642 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-77.i[915,928] [2025-03-17 03:43:39,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:43:39,705 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:43:39,713 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-77.i[915,928] [2025-03-17 03:43:39,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:43:39,756 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:43:39,758 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:39 WrapperNode [2025-03-17 03:43:39,758 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:43:39,759 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:43:39,759 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:43:39,759 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:43:39,764 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:39" (1/1) ... [2025-03-17 03:43:39,774 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:39" (1/1) ... [2025-03-17 03:43:39,796 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 100 [2025-03-17 03:43:39,796 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:43:39,797 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:43:39,798 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:43:39,798 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:43:39,804 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:39" (1/1) ... [2025-03-17 03:43:39,804 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:39" (1/1) ... [2025-03-17 03:43:39,806 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:39" (1/1) ... [2025-03-17 03:43:39,817 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 03:43:39,821 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:39" (1/1) ... [2025-03-17 03:43:39,821 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:39" (1/1) ... [2025-03-17 03:43:39,830 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:39" (1/1) ... [2025-03-17 03:43:39,830 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:39" (1/1) ... [2025-03-17 03:43:39,831 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:39" (1/1) ... [2025-03-17 03:43:39,832 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:39" (1/1) ... [2025-03-17 03:43:39,838 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:43:39,839 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:43:39,839 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:43:39,839 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:43:39,840 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:39" (1/1) ... [2025-03-17 03:43:39,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:43:39,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:43:39,866 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 03:43:39,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 03:43:39,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:43:39,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 03:43:39,888 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:43:39,888 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:43:39,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:43:39,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:43:39,951 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:43:39,953 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:43:40,240 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-17 03:43:40,241 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:43:40,248 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:43:40,248 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:43:40,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:43:40 BoogieIcfgContainer [2025-03-17 03:43:40,250 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:43:40,253 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:43:40,253 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:43:40,257 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:43:40,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:43:39" (1/3) ... [2025-03-17 03:43:40,258 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72e3032b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:43:40, skipping insertion in model container [2025-03-17 03:43:40,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:39" (2/3) ... [2025-03-17 03:43:40,259 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72e3032b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:43:40, skipping insertion in model container [2025-03-17 03:43:40,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:43:40" (3/3) ... [2025-03-17 03:43:40,260 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-77.i [2025-03-17 03:43:40,271 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:43:40,273 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-77.i that has 2 procedures, 43 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:43:40,319 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:43:40,329 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;@4e3c335, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:43:40,329 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:43:40,334 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 03:43:40,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-17 03:43:40,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:43:40,341 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:43:40,341 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:43:40,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:43:40,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1479551599, now seen corresponding path program 1 times [2025-03-17 03:43:40,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:43:40,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1074373525] [2025-03-17 03:43:40,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:43:40,354 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-17 03:43:40,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:43:40,356 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-17 03:43:40,357 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-17 03:43:40,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 03:43:40,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 03:43:40,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:43:40,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:43:40,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:43:40,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:43:40,580 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-17 03:43:40,581 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:43:40,582 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:43:40,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1074373525] [2025-03-17 03:43:40,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1074373525] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:43:40,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:43:40,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 03:43:40,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376608697] [2025-03-17 03:43:40,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:43:40,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:43:40,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:43:40,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:43:40,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:43:40,602 INFO L87 Difference]: Start difference. First operand has 43 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 03:43:40,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:43:40,618 INFO L93 Difference]: Finished difference Result 83 states and 139 transitions. [2025-03-17 03:43:40,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:43:40,619 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 94 [2025-03-17 03:43:40,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:43:40,624 INFO L225 Difference]: With dead ends: 83 [2025-03-17 03:43:40,625 INFO L226 Difference]: Without dead ends: 41 [2025-03-17 03:43:40,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:43:40,629 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-03-17 03:43:40,629 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-03-17 03:43:40,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-17 03:43:40,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-03-17 03:43:40,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 03:43:40,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 59 transitions. [2025-03-17 03:43:40,681 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 59 transitions. Word has length 94 [2025-03-17 03:43:40,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:43:40,681 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 59 transitions. [2025-03-17 03:43:40,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 03:43:40,681 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 59 transitions. [2025-03-17 03:43:40,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-17 03:43:40,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:43:40,684 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:43:40,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 03:43:40,884 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-17 03:43:40,886 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:43:40,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:43:40,887 INFO L85 PathProgramCache]: Analyzing trace with hash 774166796, now seen corresponding path program 1 times [2025-03-17 03:43:40,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:43:40,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [964055041] [2025-03-17 03:43:40,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:43:40,888 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-17 03:43:40,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:43:40,890 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-17 03:43:40,891 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-17 03:43:40,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 03:43:41,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 03:43:41,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:43:41,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:43:41,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 03:43:41,060 INFO L279 TraceCheckSpWp]: Computing forward predicates...