./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-17.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-17.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6f0f0785f7665ff69f705d3a9523d6aab7318d460c58516c4546aa5262d21f76 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:43:38,299 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:43:38,366 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 20:43:38,374 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:43:38,375 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:43:38,399 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:43:38,399 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:43:38,400 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:43:38,400 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:43:38,401 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:43:38,401 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:43:38,402 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:43:38,402 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:43:38,402 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:43:38,402 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:43:38,402 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:43:38,402 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:43:38,403 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 20:43:38,403 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 20:43:38,403 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 20:43:38,403 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:43:38,403 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:43:38,403 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:43:38,404 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:43:38,404 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 20:43:38,404 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:43:38,404 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:43:38,404 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:43:38,404 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:43:38,404 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:43:38,404 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:43:38,405 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:43:38,405 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:43:38,405 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:43:38,405 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:43:38,405 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:43:38,406 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:43:38,406 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 20:43:38,406 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 20:43:38,406 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:43:38,406 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:43:38,406 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:43:38,406 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:43:38,406 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6f0f0785f7665ff69f705d3a9523d6aab7318d460c58516c4546aa5262d21f76 [2025-02-05 20:43:38,691 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:43:38,701 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:43:38,705 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:43:38,706 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:43:38,706 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:43:38,709 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-17.i [2025-02-05 20:43:40,053 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2a5526c07/399d83a6bffd4a389e6e428387803b73/FLAG630936fe0 [2025-02-05 20:43:40,311 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:43:40,311 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-17.i [2025-02-05 20:43:40,320 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2a5526c07/399d83a6bffd4a389e6e428387803b73/FLAG630936fe0 [2025-02-05 20:43:40,342 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2a5526c07/399d83a6bffd4a389e6e428387803b73 [2025-02-05 20:43:40,344 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:43:40,346 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:43:40,347 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:43:40,347 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:43:40,353 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:43:40,354 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:43:40" (1/1) ... [2025-02-05 20:43:40,356 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7343d04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:43:40, skipping insertion in model container [2025-02-05 20:43:40,357 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:43:40" (1/1) ... [2025-02-05 20:43:40,377 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:43:40,503 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-17.i[917,930] [2025-02-05 20:43:40,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:43:40,597 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:43:40,606 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-17.i[917,930] [2025-02-05 20:43:40,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:43:40,663 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:43:40,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:43:40 WrapperNode [2025-02-05 20:43:40,665 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:43:40,665 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:43:40,666 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:43:40,666 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:43:40,671 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:43:40" (1/1) ... [2025-02-05 20:43:40,683 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:43:40" (1/1) ... [2025-02-05 20:43:40,727 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 169 [2025-02-05 20:43:40,727 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:43:40,728 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:43:40,728 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:43:40,728 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:43:40,735 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:43:40" (1/1) ... [2025-02-05 20:43:40,735 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:43:40" (1/1) ... [2025-02-05 20:43:40,738 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:43:40" (1/1) ... [2025-02-05 20:43:40,759 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-02-05 20:43:40,759 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:43:40" (1/1) ... [2025-02-05 20:43:40,760 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:43:40" (1/1) ... [2025-02-05 20:43:40,767 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:43:40" (1/1) ... [2025-02-05 20:43:40,775 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:43:40" (1/1) ... [2025-02-05 20:43:40,777 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:43:40" (1/1) ... [2025-02-05 20:43:40,778 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:43:40" (1/1) ... [2025-02-05 20:43:40,783 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:43:40,784 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:43:40,784 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:43:40,788 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:43:40,789 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:43:40" (1/1) ... [2025-02-05 20:43:40,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:43:40,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:43:40,825 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 20:43:40,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 20:43:40,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:43:40,850 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 20:43:40,850 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 20:43:40,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 20:43:40,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:43:40,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:43:40,922 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:43:40,924 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:43:41,274 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L125: havoc property_#t~ite19#1;havoc property_#t~ite18#1;havoc property_#t~bitwise17#1;havoc property_#t~short20#1; [2025-02-05 20:43:41,311 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-02-05 20:43:41,312 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:43:41,333 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:43:41,335 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:43:41,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:43:41 BoogieIcfgContainer [2025-02-05 20:43:41,335 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:43:41,338 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:43:41,339 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:43:41,343 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:43:41,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:43:40" (1/3) ... [2025-02-05 20:43:41,344 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1072a5bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:43:41, skipping insertion in model container [2025-02-05 20:43:41,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:43:40" (2/3) ... [2025-02-05 20:43:41,345 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1072a5bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:43:41, skipping insertion in model container [2025-02-05 20:43:41,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:43:41" (3/3) ... [2025-02-05 20:43:41,346 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-17.i [2025-02-05 20:43:41,361 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:43:41,362 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-17.i that has 2 procedures, 78 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:43:41,427 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:43:41,440 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;@3c9d9c0c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:43:41,440 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:43:41,445 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 54 states have internal predecessors, (74), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-05 20:43:41,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-05 20:43:41,457 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:43:41,458 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 20:43:41,459 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:43:41,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:43:41,464 INFO L85 PathProgramCache]: Analyzing trace with hash -3597491, now seen corresponding path program 1 times [2025-02-05 20:43:41,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:43:41,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100280566] [2025-02-05 20:43:41,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:43:41,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:43:41,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-05 20:43:41,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-05 20:43:41,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:43:41,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:43:41,756 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-02-05 20:43:41,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:43:41,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100280566] [2025-02-05 20:43:41,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100280566] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:43:41,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992202246] [2025-02-05 20:43:41,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:43:41,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:43:41,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:43:41,762 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:43:41,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 20:43:41,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-05 20:43:41,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-05 20:43:41,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:43:41,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:43:41,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 20:43:41,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:43:41,923 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-02-05 20:43:41,924 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:43:41,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992202246] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:43:41,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 20:43:41,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 20:43:41,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134288145] [2025-02-05 20:43:41,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:43:41,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 20:43:41,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:43:41,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 20:43:41,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 20:43:41,952 INFO L87 Difference]: Start difference. First operand has 78 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 54 states have internal predecessors, (74), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-05 20:43:41,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:43:41,981 INFO L93 Difference]: Finished difference Result 150 states and 253 transitions. [2025-02-05 20:43:41,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 20:43:41,983 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 142 [2025-02-05 20:43:41,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:43:41,991 INFO L225 Difference]: With dead ends: 150 [2025-02-05 20:43:41,992 INFO L226 Difference]: Without dead ends: 75 [2025-02-05 20:43:41,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 143 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-02-05 20:43:41,999 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:43:42,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:43:42,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-02-05 20:43:42,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-02-05 20:43:42,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 51 states have internal predecessors, (69), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-05 20:43:42,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 113 transitions. [2025-02-05 20:43:42,054 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 113 transitions. Word has length 142 [2025-02-05 20:43:42,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:43:42,054 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 113 transitions. [2025-02-05 20:43:42,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-05 20:43:42,056 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 113 transitions. [2025-02-05 20:43:42,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-05 20:43:42,063 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:43:42,063 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 20:43:42,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 20:43:42,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 20:43:42,264 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:43:42,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:43:42,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1670088907, now seen corresponding path program 1 times [2025-02-05 20:43:42,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:43:42,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479085833] [2025-02-05 20:43:42,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:43:42,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:43:42,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-05 20:43:42,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-05 20:43:42,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:43:42,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 20:43:42,581 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 20:43:42,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-05 20:43:42,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-05 20:43:42,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:43:42,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 20:43:42,817 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 20:43:42,818 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 20:43:42,819 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 20:43:42,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 20:43:42,823 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-05 20:43:42,931 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 20:43:42,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 08:43:42 BoogieIcfgContainer [2025-02-05 20:43:42,934 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 20:43:42,934 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 20:43:42,936 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 20:43:42,936 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 20:43:42,937 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:43:41" (3/4) ... [2025-02-05 20:43:42,940 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 20:43:42,940 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 20:43:42,941 INFO L158 Benchmark]: Toolchain (without parser) took 2595.67ms. Allocated memory is still 201.3MB. Free memory was 154.8MB in the beginning and 107.8MB in the end (delta: 47.1MB). Peak memory consumption was 49.1MB. Max. memory is 16.1GB. [2025-02-05 20:43:42,942 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 201.3MB. Free memory is still 119.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:43:42,942 INFO L158 Benchmark]: CACSL2BoogieTranslator took 318.09ms. Allocated memory is still 201.3MB. Free memory was 154.6MB in the beginning and 140.6MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 20:43:42,943 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.78ms. Allocated memory is still 201.3MB. Free memory was 140.6MB in the beginning and 137.2MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:43:42,943 INFO L158 Benchmark]: Boogie Preprocessor took 55.67ms. Allocated memory is still 201.3MB. Free memory was 137.2MB in the beginning and 132.8MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:43:42,943 INFO L158 Benchmark]: IcfgBuilder took 551.19ms. Allocated memory is still 201.3MB. Free memory was 132.5MB in the beginning and 107.9MB in the end (delta: 24.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 20:43:42,943 INFO L158 Benchmark]: TraceAbstraction took 1595.47ms. Allocated memory is still 201.3MB. Free memory was 107.3MB in the beginning and 108.8MB in the end (delta: -1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:43:42,944 INFO L158 Benchmark]: Witness Printer took 6.24ms. Allocated memory is still 201.3MB. Free memory was 108.8MB in the beginning and 107.8MB in the end (delta: 1.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 20:43:42,945 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.42ms. Allocated memory is still 201.3MB. Free memory is still 119.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 318.09ms. Allocated memory is still 201.3MB. Free memory was 154.6MB in the beginning and 140.6MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.78ms. Allocated memory is still 201.3MB. Free memory was 140.6MB in the beginning and 137.2MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 55.67ms. Allocated memory is still 201.3MB. Free memory was 137.2MB in the beginning and 132.8MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 551.19ms. Allocated memory is still 201.3MB. Free memory was 132.5MB in the beginning and 107.9MB in the end (delta: 24.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1595.47ms. Allocated memory is still 201.3MB. Free memory was 107.3MB in the beginning and 108.8MB in the end (delta: -1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 6.24ms. Allocated memory is still 201.3MB. Free memory was 108.8MB in the beginning and 107.8MB in the end (delta: 1.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 109, overapproximation of someBinaryDOUBLEComparisonOperation at line 125, overapproximation of someBinaryDOUBLEComparisonOperation at line 62, overapproximation of someBinaryDOUBLEComparisonOperation at line 111, overapproximation of someBinaryDOUBLEComparisonOperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 60. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 25; [L23] unsigned char var_1_2 = 25; [L24] unsigned char var_1_3 = 0; [L25] unsigned char var_1_4 = 0; [L26] signed long int var_1_5 = 4; [L27] unsigned char var_1_6 = 1; [L28] unsigned char var_1_7 = 0; [L29] unsigned char var_1_8 = 1; [L30] unsigned char var_1_9 = 0; [L31] unsigned char var_1_10 = 0; [L32] double var_1_11 = 7.3; [L33] double var_1_12 = 1.25; [L34] double var_1_13 = 128.8; [L35] signed char var_1_14 = -1; [L36] signed char var_1_15 = 10; [L37] signed short int var_1_16 = 8; [L38] signed short int var_1_17 = 10; [L39] unsigned long int var_1_18 = 128; [L40] unsigned long int var_1_19 = 3963666122; VAL [isInitial=0, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=25, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L129] isInitial = 1 [L130] FCALL initially() [L131] COND TRUE 1 [L132] FCALL updateLastVariables() [L133] CALL updateVariables() [L87] var_1_2 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L88] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L89] CALL assume_abort_if_not(var_1_2 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L89] RET assume_abort_if_not(var_1_2 <= 127) VAL [isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L90] var_1_3 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_4=0, var_1_5=4, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_4=0, var_1_5=4, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L91] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_4=0, var_1_5=4, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L92] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=-205, var_1_4=0, var_1_5=4, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=-205, var_1_4=0, var_1_5=4, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L92] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=-205, var_1_4=0, var_1_5=4, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L93] var_1_4 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=-205, var_1_5=4, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=-205, var_1_5=4, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L94] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=-205, var_1_5=4, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L95] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L95] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L96] var_1_6 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L97] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L98] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L98] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L99] var_1_7 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_6=1, var_1_8=1, var_1_9=0] [L100] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_6=1, var_1_8=1, var_1_9=0] [L101] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_6=1, var_1_7=-256, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_6=1, var_1_7=-256, var_1_8=1, var_1_9=0] [L101] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_6=1, var_1_7=-256, var_1_8=1, var_1_9=0] [L102] var_1_9 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_9 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_6=1, var_1_7=-256, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_6=1, var_1_7=-256, var_1_8=1, var_1_9=1] [L103] RET assume_abort_if_not(var_1_9 >= 1) VAL [isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_6=1, var_1_7=-256, var_1_8=1, var_1_9=1] [L104] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_6=1, var_1_7=-256, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_6=1, var_1_7=-256, var_1_8=1, var_1_9=1] [L104] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_6=1, var_1_7=-256, var_1_8=1, var_1_9=1] [L105] var_1_10 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_6=1, var_1_7=-256, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_6=1, var_1_7=-256, var_1_8=1, var_1_9=1] [L106] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_6=1, var_1_7=-256, var_1_8=1, var_1_9=1] [L107] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_6=1, var_1_7=-256, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_6=1, var_1_7=-256, var_1_8=1, var_1_9=1] [L107] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_6=1, var_1_7=-256, var_1_8=1, var_1_9=1] [L108] var_1_12 = __VERIFIER_nondet_double() [L109] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=73/10, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_6=1, var_1_7=-256, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=73/10, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_6=1, var_1_7=-256, var_1_8=1, var_1_9=1] [L109] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=73/10, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_6=1, var_1_7=-256, var_1_8=1, var_1_9=1] [L110] var_1_13 = __VERIFIER_nondet_double() [L111] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_6=1, var_1_7=-256, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_6=1, var_1_7=-256, var_1_8=1, var_1_9=1] [L111] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_6=1, var_1_7=-256, var_1_8=1, var_1_9=1] [L112] var_1_15 = __VERIFIER_nondet_char() [L113] CALL assume_abort_if_not(var_1_15 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=-127, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_6=1, var_1_7=-256, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=-127, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_6=1, var_1_7=-256, var_1_8=1, var_1_9=1] [L113] RET assume_abort_if_not(var_1_15 >= -127) VAL [isInitial=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=-127, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_6=1, var_1_7=-256, var_1_8=1, var_1_9=1] [L114] CALL assume_abort_if_not(var_1_15 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=-127, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_6=1, var_1_7=-256, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=-127, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_6=1, var_1_7=-256, var_1_8=1, var_1_9=1] [L114] RET assume_abort_if_not(var_1_15 <= 126) VAL [isInitial=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=-127, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_6=1, var_1_7=-256, var_1_8=1, var_1_9=1] [L115] var_1_17 = __VERIFIER_nondet_short() [L116] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=-127, var_1_16=8, var_1_17=32766, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_6=1, var_1_7=-256, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=-127, var_1_16=8, var_1_17=32766, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_6=1, var_1_7=-256, var_1_8=1, var_1_9=1] [L116] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=-127, var_1_16=8, var_1_17=32766, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_6=1, var_1_7=-256, var_1_8=1, var_1_9=1] [L117] CALL assume_abort_if_not(var_1_17 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=-127, var_1_16=8, var_1_17=32766, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_6=1, var_1_7=-256, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=-127, var_1_16=8, var_1_17=32766, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_6=1, var_1_7=-256, var_1_8=1, var_1_9=1] [L117] RET assume_abort_if_not(var_1_17 <= 32766) VAL [isInitial=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=-127, var_1_16=8, var_1_17=32766, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_6=1, var_1_7=-256, var_1_8=1, var_1_9=1] [L118] var_1_19 = __VERIFIER_nondet_ulong() [L119] CALL assume_abort_if_not(var_1_19 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=-127, var_1_16=8, var_1_17=32766, var_1_18=128, var_1_19=4294967294, var_1_1=25, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_6=1, var_1_7=-256, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=-127, var_1_16=8, var_1_17=32766, var_1_18=128, var_1_19=4294967294, var_1_1=25, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_6=1, var_1_7=-256, var_1_8=1, var_1_9=1] [L119] RET assume_abort_if_not(var_1_19 >= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=-127, var_1_16=8, var_1_17=32766, var_1_18=128, var_1_19=4294967294, var_1_1=25, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_6=1, var_1_7=-256, var_1_8=1, var_1_9=1] [L120] CALL assume_abort_if_not(var_1_19 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=-127, var_1_16=8, var_1_17=32766, var_1_18=128, var_1_19=4294967294, var_1_1=25, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_6=1, var_1_7=-256, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=-127, var_1_16=8, var_1_17=32766, var_1_18=128, var_1_19=4294967294, var_1_1=25, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_6=1, var_1_7=-256, var_1_8=1, var_1_9=1] [L120] RET assume_abort_if_not(var_1_19 <= 4294967294) VAL [isInitial=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=-127, var_1_16=8, var_1_17=32766, var_1_18=128, var_1_19=4294967294, var_1_1=25, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_6=1, var_1_7=-256, var_1_8=1, var_1_9=1] [L133] RET updateVariables() [L134] CALL step() [L44] var_1_1 = (50 + ((((var_1_2) < (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) ? (var_1_2) : (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))))) [L45] unsigned char stepLocal_0 = var_1_7; VAL [isInitial=1, stepLocal_0=-256, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=-127, var_1_16=8, var_1_17=32766, var_1_18=128, var_1_19=4294967294, var_1_1=50, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_6=1, var_1_7=-256, var_1_8=1, var_1_9=1] [L46] COND FALSE !(var_1_6 && stepLocal_0) VAL [isInitial=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=-127, var_1_16=8, var_1_17=32766, var_1_18=128, var_1_19=4294967294, var_1_1=50, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_6=1, var_1_7=-256, var_1_8=1, var_1_9=1] [L53] COND TRUE var_1_1 < var_1_3 [L54] var_1_8 = ((var_1_7 || (var_1_6 || var_1_9)) && var_1_10) VAL [isInitial=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=-127, var_1_16=8, var_1_17=32766, var_1_18=128, var_1_19=4294967294, var_1_1=50, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_6=1, var_1_7=-256, var_1_8=1, var_1_9=1] [L58] unsigned char stepLocal_1 = var_1_4; VAL [isInitial=1, stepLocal_1=58, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=-127, var_1_16=8, var_1_17=32766, var_1_18=128, var_1_19=4294967294, var_1_1=50, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_6=1, var_1_7=-256, var_1_8=1, var_1_9=1] [L59] COND TRUE stepLocal_1 == (8 + var_1_1) [L60] var_1_11 = ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))) VAL [isInitial=1, var_1_10=1, var_1_11=4294967299, var_1_12=4294967299, var_1_13=4294967299, var_1_14=-1, var_1_15=-127, var_1_16=8, var_1_17=32766, var_1_18=128, var_1_19=4294967294, var_1_1=50, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_6=1, var_1_7=-256, var_1_8=1, var_1_9=1] [L62] COND FALSE !((64.4f + 1.5f) <= var_1_13) VAL [isInitial=1, var_1_10=1, var_1_11=4294967299, var_1_12=4294967299, var_1_13=4294967299, var_1_14=-1, var_1_15=-127, var_1_16=8, var_1_17=32766, var_1_18=128, var_1_19=4294967294, var_1_1=50, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_6=1, var_1_7=-256, var_1_8=1, var_1_9=1] [L67] unsigned char stepLocal_2 = var_1_3; VAL [isInitial=1, stepLocal_2=-205, var_1_10=1, var_1_11=4294967299, var_1_12=4294967299, var_1_13=4294967299, var_1_14=-1, var_1_15=-127, var_1_16=8, var_1_17=32766, var_1_18=128, var_1_19=4294967294, var_1_1=50, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_6=1, var_1_7=-256, var_1_8=1, var_1_9=1] [L68] COND FALSE !(var_1_12 >= 9.6) VAL [isInitial=1, stepLocal_2=-205, var_1_10=1, var_1_11=4294967299, var_1_12=4294967299, var_1_13=4294967299, var_1_14=-1, var_1_15=-127, var_1_16=8, var_1_17=32766, var_1_18=128, var_1_19=4294967294, var_1_1=50, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_6=1, var_1_7=-256, var_1_8=1, var_1_9=1] [L79] unsigned char stepLocal_3 = var_1_9 && var_1_6; VAL [isInitial=1, stepLocal_2=-205, stepLocal_3=1, var_1_10=1, var_1_11=4294967299, var_1_12=4294967299, var_1_13=4294967299, var_1_14=-1, var_1_15=-127, var_1_16=8, var_1_17=32766, var_1_18=128, var_1_19=4294967294, var_1_1=50, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_6=1, var_1_7=-256, var_1_8=1, var_1_9=1] [L80] COND TRUE stepLocal_3 || (var_1_7 && var_1_10) [L81] var_1_18 = (var_1_19 - (((((1991720936u - var_1_17)) < (var_1_2)) ? ((1991720936u - var_1_17)) : (var_1_2)))) VAL [isInitial=1, stepLocal_2=-205, var_1_10=1, var_1_11=4294967299, var_1_12=4294967299, var_1_13=4294967299, var_1_14=-1, var_1_15=-127, var_1_16=8, var_1_17=32766, var_1_18=4294967294, var_1_19=4294967294, var_1_1=50, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_6=1, var_1_7=-256, var_1_8=1, var_1_9=1] [L134] RET step() [L135] CALL, EXPR property() [L125] EXPR (((((var_1_1 == ((unsigned char) (50 + ((((var_1_2) < (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) ? (var_1_2) : (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))))))) && ((var_1_6 && var_1_7) ? (var_1_7 ? (var_1_5 == ((signed long int) (((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1))) - ((((var_1_4) < (var_1_2)) ? (var_1_4) : (var_1_2)))))) : (var_1_5 == ((signed long int) 8))) : 1)) && ((var_1_1 < var_1_3) ? (var_1_8 == ((unsigned char) ((var_1_7 || (var_1_6 || var_1_9)) && var_1_10))) : (var_1_8 == ((unsigned char) (! var_1_10))))) && ((var_1_4 == (8 + var_1_1)) ? (var_1_11 == ((double) ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))))) : 1)) && (((64.4f + 1.5f) <= var_1_13) ? ((var_1_5 >= var_1_4) ? (var_1_14 == ((signed char) var_1_15)) : 1) : 1)) && ((var_1_12 >= 9.6) ? (var_1_10 ? (var_1_16 == ((signed short int) (2 - var_1_17))) : (((var_1_1 * (var_1_15 & var_1_17)) <= var_1_3) ? (var_1_16 == ((signed short int) var_1_1)) : (var_1_16 == ((signed short int) var_1_4)))) : 1) VAL [isInitial=1, var_1_10=1, var_1_11=4294967299, var_1_12=4294967299, var_1_13=4294967299, var_1_14=-1, var_1_15=-127, var_1_16=8, var_1_17=32766, var_1_18=4294967294, var_1_19=4294967294, var_1_1=50, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_6=1, var_1_7=-256, var_1_8=1, var_1_9=1] [L125-L126] return ((((((var_1_1 == ((unsigned char) (50 + ((((var_1_2) < (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) ? (var_1_2) : (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))))))) && ((var_1_6 && var_1_7) ? (var_1_7 ? (var_1_5 == ((signed long int) (((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1))) - ((((var_1_4) < (var_1_2)) ? (var_1_4) : (var_1_2)))))) : (var_1_5 == ((signed long int) 8))) : 1)) && ((var_1_1 < var_1_3) ? (var_1_8 == ((unsigned char) ((var_1_7 || (var_1_6 || var_1_9)) && var_1_10))) : (var_1_8 == ((unsigned char) (! var_1_10))))) && ((var_1_4 == (8 + var_1_1)) ? (var_1_11 == ((double) ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))))) : 1)) && (((64.4f + 1.5f) <= var_1_13) ? ((var_1_5 >= var_1_4) ? (var_1_14 == ((signed char) var_1_15)) : 1) : 1)) && ((var_1_12 >= 9.6) ? (var_1_10 ? (var_1_16 == ((signed short int) (2 - var_1_17))) : (((var_1_1 * (var_1_15 & var_1_17)) <= var_1_3) ? (var_1_16 == ((signed short int) var_1_1)) : (var_1_16 == ((signed short int) var_1_4)))) : 1)) && (((var_1_9 && var_1_6) || (var_1_7 && var_1_10)) ? (var_1_18 == ((unsigned long int) (var_1_19 - (((((1991720936u - var_1_17)) < (var_1_2)) ? ((1991720936u - var_1_17)) : (var_1_2)))))) : (var_1_18 == ((unsigned long int) var_1_2))) ; [L135] RET, EXPR property() [L135] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1, var_1_11=4294967299, var_1_12=4294967299, var_1_13=4294967299, var_1_14=-1, var_1_15=-127, var_1_16=8, var_1_17=32766, var_1_18=4294967294, var_1_19=4294967294, var_1_1=50, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_6=1, var_1_7=-256, var_1_8=1, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_10=1, var_1_11=4294967299, var_1_12=4294967299, var_1_13=4294967299, var_1_14=-1, var_1_15=-127, var_1_16=8, var_1_17=32766, var_1_18=4294967294, var_1_19=4294967294, var_1_1=50, var_1_2=0, var_1_3=-205, var_1_4=58, var_1_5=4, var_1_6=1, var_1_7=-256, var_1_8=1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 78 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 2, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 111 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2 IncrementalHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 111 mSDtfsCounter, 2 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 143 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred 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.4s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 426 NumberOfCodeBlocks, 426 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 282 ConstructedInterpolants, 0 QuantifiedInterpolants, 282 SizeOfPredicates, 0 NumberOfNonLiveVariables, 315 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 1806/1848 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-02-05 20:43:42,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-17.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6f0f0785f7665ff69f705d3a9523d6aab7318d460c58516c4546aa5262d21f76 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:43:45,203 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:43:45,315 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-05 20:43:45,326 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:43:45,326 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:43:45,349 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:43:45,351 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:43:45,351 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:43:45,351 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:43:45,352 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:43:45,352 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:43:45,352 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:43:45,352 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:43:45,353 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:43:45,353 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:43:45,354 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:43:45,354 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:43:45,354 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 20:43:45,354 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 20:43:45,355 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:43:45,355 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:43:45,355 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:43:45,355 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:43:45,355 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 20:43:45,355 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 20:43:45,355 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 20:43:45,355 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 20:43:45,355 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:43:45,356 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:43:45,356 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:43:45,356 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:43:45,356 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:43:45,356 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:43:45,356 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:43:45,356 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:43:45,356 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:43:45,356 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:43:45,356 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:43:45,356 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:43:45,356 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 20:43:45,356 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 20:43:45,357 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:43:45,357 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:43:45,357 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:43:45,357 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:43:45,357 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6f0f0785f7665ff69f705d3a9523d6aab7318d460c58516c4546aa5262d21f76 [2025-02-05 20:43:45,693 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:43:45,701 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:43:45,704 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:43:45,706 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:43:45,706 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:43:45,708 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-17.i [2025-02-05 20:43:47,135 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cfff0492c/bf804aeb810d4408bce707df156c2635/FLAGe8c5c2148 [2025-02-05 20:43:47,393 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:43:47,394 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-17.i [2025-02-05 20:43:47,404 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cfff0492c/bf804aeb810d4408bce707df156c2635/FLAGe8c5c2148 [2025-02-05 20:43:47,424 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cfff0492c/bf804aeb810d4408bce707df156c2635 [2025-02-05 20:43:47,427 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:43:47,429 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:43:47,431 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:43:47,432 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:43:47,435 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:43:47,436 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:43:47" (1/1) ... [2025-02-05 20:43:47,439 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4138786d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:43:47, skipping insertion in model container [2025-02-05 20:43:47,439 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:43:47" (1/1) ... [2025-02-05 20:43:47,459 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:43:47,599 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-17.i[917,930] [2025-02-05 20:43:47,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:43:47,692 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:43:47,702 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-17.i[917,930] [2025-02-05 20:43:47,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:43:47,763 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:43:47,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:43:47 WrapperNode [2025-02-05 20:43:47,765 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:43:47,766 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:43:47,766 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:43:47,767 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:43:47,773 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:43:47" (1/1) ... [2025-02-05 20:43:47,789 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:43:47" (1/1) ... [2025-02-05 20:43:47,825 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 134 [2025-02-05 20:43:47,826 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:43:47,830 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:43:47,830 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:43:47,830 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:43:47,838 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:43:47" (1/1) ... [2025-02-05 20:43:47,838 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:43:47" (1/1) ... [2025-02-05 20:43:47,842 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:43:47" (1/1) ... [2025-02-05 20:43:47,857 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-02-05 20:43:47,857 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:43:47" (1/1) ... [2025-02-05 20:43:47,857 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:43:47" (1/1) ... [2025-02-05 20:43:47,868 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:43:47" (1/1) ... [2025-02-05 20:43:47,869 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:43:47" (1/1) ... [2025-02-05 20:43:47,874 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:43:47" (1/1) ... [2025-02-05 20:43:47,875 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:43:47" (1/1) ... [2025-02-05 20:43:47,881 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:43:47,882 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:43:47,882 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:43:47,882 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:43:47,883 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:43:47" (1/1) ... [2025-02-05 20:43:47,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:43:47,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:43:47,928 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 20:43:47,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 20:43:47,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:43:47,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 20:43:47,955 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 20:43:47,955 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 20:43:47,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:43:47,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:43:48,040 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:43:48,042 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:43:48,750 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-02-05 20:43:48,751 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:43:48,760 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:43:48,762 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:43:48,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:43:48 BoogieIcfgContainer [2025-02-05 20:43:48,763 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:43:48,765 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:43:48,766 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:43:48,770 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:43:48,771 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:43:47" (1/3) ... [2025-02-05 20:43:48,772 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ae74f39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:43:48, skipping insertion in model container [2025-02-05 20:43:48,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:43:47" (2/3) ... [2025-02-05 20:43:48,772 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ae74f39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:43:48, skipping insertion in model container [2025-02-05 20:43:48,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:43:48" (3/3) ... [2025-02-05 20:43:48,773 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-17.i [2025-02-05 20:43:48,787 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:43:48,789 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-17.i that has 2 procedures, 65 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:43:48,856 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:43:48,866 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;@af4ea69, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:43:48,866 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:43:48,870 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 40 states have (on average 1.35) internal successors, (54), 41 states have internal predecessors, (54), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-05 20:43:48,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-05 20:43:48,880 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:43:48,881 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 20:43:48,881 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:43:48,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:43:48,886 INFO L85 PathProgramCache]: Analyzing trace with hash 785370287, now seen corresponding path program 1 times [2025-02-05 20:43:48,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:43:48,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [592538577] [2025-02-05 20:43:48,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:43:48,897 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-02-05 20:43:48,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:43:48,900 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 20:43:48,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-02-05 20:43:48,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-05 20:43:49,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-05 20:43:49,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:43:49,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:43:49,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 20:43:49,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:43:49,197 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2025-02-05 20:43:49,198 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:43:49,199 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:43:49,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [592538577] [2025-02-05 20:43:49,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [592538577] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:43:49,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:43:49,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 20:43:49,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369329541] [2025-02-05 20:43:49,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:43:49,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 20:43:49,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:43:49,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 20:43:49,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 20:43:49,225 INFO L87 Difference]: Start difference. First operand has 65 states, 40 states have (on average 1.35) internal successors, (54), 41 states have internal predecessors, (54), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-05 20:43:49,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:43:49,257 INFO L93 Difference]: Finished difference Result 124 states and 213 transitions. [2025-02-05 20:43:49,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 20:43:49,260 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 140 [2025-02-05 20:43:49,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:43:49,269 INFO L225 Difference]: With dead ends: 124 [2025-02-05 20:43:49,270 INFO L226 Difference]: Without dead ends: 62 [2025-02-05 20:43:49,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 139 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-02-05 20:43:49,279 INFO L435 NwaCegarLoop]: 93 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, 93 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-02-05 20:43:49,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:43:49,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-02-05 20:43:49,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-02-05 20:43:49,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-05 20:43:49,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 93 transitions. [2025-02-05 20:43:49,325 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 93 transitions. Word has length 140 [2025-02-05 20:43:49,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:43:49,326 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 93 transitions. [2025-02-05 20:43:49,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-05 20:43:49,326 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 93 transitions. [2025-02-05 20:43:49,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-05 20:43:49,329 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:43:49,329 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 20:43:49,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-02-05 20:43:49,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 20:43:49,530 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:43:49,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:43:49,531 INFO L85 PathProgramCache]: Analyzing trace with hash 447447469, now seen corresponding path program 1 times [2025-02-05 20:43:49,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:43:49,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1920098898] [2025-02-05 20:43:49,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:43:49,532 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-02-05 20:43:49,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:43:49,534 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 20:43:49,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-02-05 20:43:49,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-05 20:43:49,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-05 20:43:49,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:43:49,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:43:49,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-05 20:43:49,756 INFO L279 TraceCheckSpWp]: Computing forward predicates...