./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-26.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_loopvsstraightlinecode_25-while_file-26.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 ddce48067b4423a9dbd4ae41b2384910d5e8f4f139aef66a78ce087435d0c23b --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 01:20:48,379 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 01:20:48,441 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 01:20:48,449 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 01:20:48,449 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 01:20:48,461 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 01:20:48,461 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 01:20:48,461 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 01:20:48,461 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 01:20:48,462 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 01:20:48,462 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 01:20:48,462 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 01:20:48,462 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 01:20:48,462 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 01:20:48,462 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 01:20:48,462 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 01:20:48,462 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 01:20:48,462 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 01:20:48,462 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 01:20:48,462 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 01:20:48,462 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 01:20:48,462 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 01:20:48,462 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 01:20:48,462 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 01:20:48,462 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 01:20:48,463 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 01:20:48,463 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 01:20:48,463 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 01:20:48,463 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 01:20:48,463 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 01:20:48,463 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 01:20:48,463 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 01:20:48,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:20:48,463 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 01:20:48,463 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 01:20:48,463 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 01:20:48,463 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 01:20:48,463 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 01:20:48,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 01:20:48,463 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 01:20:48,463 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 01:20:48,464 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 01:20:48,464 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 01:20:48,464 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 -> ddce48067b4423a9dbd4ae41b2384910d5e8f4f139aef66a78ce087435d0c23b [2025-02-06 01:20:48,667 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 01:20:48,674 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 01:20:48,676 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 01:20:48,677 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 01:20:48,677 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 01:20:48,678 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-26.i [2025-02-06 01:20:49,869 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9b07c3d3f/8637f591336a4ef7866f0a8a773d00be/FLAGd02816e34 [2025-02-06 01:20:50,098 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 01:20:50,099 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-26.i [2025-02-06 01:20:50,104 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9b07c3d3f/8637f591336a4ef7866f0a8a773d00be/FLAGd02816e34 [2025-02-06 01:20:50,427 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9b07c3d3f/8637f591336a4ef7866f0a8a773d00be [2025-02-06 01:20:50,429 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 01:20:50,430 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 01:20:50,431 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 01:20:50,431 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 01:20:50,433 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 01:20:50,434 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:20:50" (1/1) ... [2025-02-06 01:20:50,434 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1064e960 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:20:50, skipping insertion in model container [2025-02-06 01:20:50,435 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:20:50" (1/1) ... [2025-02-06 01:20:50,444 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 01:20:50,548 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-26.i[915,928] [2025-02-06 01:20:50,574 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:20:50,581 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 01:20:50,588 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-26.i[915,928] [2025-02-06 01:20:50,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:20:50,615 INFO L204 MainTranslator]: Completed translation [2025-02-06 01:20:50,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:20:50 WrapperNode [2025-02-06 01:20:50,616 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 01:20:50,617 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 01:20:50,617 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 01:20:50,617 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 01:20:50,621 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:20:50" (1/1) ... [2025-02-06 01:20:50,627 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:20:50" (1/1) ... [2025-02-06 01:20:50,641 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 106 [2025-02-06 01:20:50,641 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 01:20:50,645 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 01:20:50,645 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 01:20:50,645 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 01:20:50,652 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:20:50" (1/1) ... [2025-02-06 01:20:50,652 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:20:50" (1/1) ... [2025-02-06 01:20:50,653 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:20:50" (1/1) ... [2025-02-06 01:20:50,669 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-06 01:20:50,671 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:20:50" (1/1) ... [2025-02-06 01:20:50,671 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:20:50" (1/1) ... [2025-02-06 01:20:50,674 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:20:50" (1/1) ... [2025-02-06 01:20:50,679 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:20:50" (1/1) ... [2025-02-06 01:20:50,680 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:20:50" (1/1) ... [2025-02-06 01:20:50,680 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:20:50" (1/1) ... [2025-02-06 01:20:50,682 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 01:20:50,682 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 01:20:50,682 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 01:20:50,683 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 01:20:50,683 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:20:50" (1/1) ... [2025-02-06 01:20:50,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:20:50,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:20:50,715 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-06 01:20:50,717 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-06 01:20:50,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 01:20:50,737 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 01:20:50,737 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 01:20:50,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 01:20:50,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 01:20:50,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 01:20:50,794 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 01:20:50,798 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 01:20:50,951 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-02-06 01:20:50,951 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 01:20:50,958 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 01:20:50,958 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 01:20:50,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:20:50 BoogieIcfgContainer [2025-02-06 01:20:50,959 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 01:20:50,960 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 01:20:50,960 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 01:20:50,963 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 01:20:50,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:20:50" (1/3) ... [2025-02-06 01:20:50,963 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16a4b6d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:20:50, skipping insertion in model container [2025-02-06 01:20:50,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:20:50" (2/3) ... [2025-02-06 01:20:50,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16a4b6d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:20:50, skipping insertion in model container [2025-02-06 01:20:50,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:20:50" (3/3) ... [2025-02-06 01:20:50,964 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-26.i [2025-02-06 01:20:50,973 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 01:20:50,974 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-26.i that has 2 procedures, 51 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 01:20:51,021 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 01:20:51,030 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;@1ddeac4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 01:20:51,032 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 01:20:51,035 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 01:20:51,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-06 01:20:51,041 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:20:51,041 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:20:51,042 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:20:51,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:20:51,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1088172704, now seen corresponding path program 1 times [2025-02-06 01:20:51,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:20:51,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332986858] [2025-02-06 01:20:51,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:20:51,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:20:51,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 01:20:51,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 01:20:51,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:20:51,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:20:51,220 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-02-06 01:20:51,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:20:51,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332986858] [2025-02-06 01:20:51,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332986858] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 01:20:51,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610167337] [2025-02-06 01:20:51,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:20:51,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:20:51,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:20:51,228 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-06 01:20:51,229 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-06 01:20:51,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 01:20:51,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 01:20:51,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:20:51,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:20:51,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 01:20:51,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:20:51,392 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-02-06 01:20:51,394 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:20:51,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610167337] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:20:51,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 01:20:51,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 01:20:51,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434420977] [2025-02-06 01:20:51,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:20:51,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 01:20:51,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:20:51,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 01:20:51,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 01:20:51,416 INFO L87 Difference]: Start difference. First operand has 51 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 01:20:51,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:20:51,430 INFO L93 Difference]: Finished difference Result 96 states and 160 transitions. [2025-02-06 01:20:51,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 01:20:51,432 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 107 [2025-02-06 01:20:51,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:20:51,435 INFO L225 Difference]: With dead ends: 96 [2025-02-06 01:20:51,436 INFO L226 Difference]: Without dead ends: 48 [2025-02-06 01:20:51,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 108 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-06 01:20:51,439 INFO L435 NwaCegarLoop]: 69 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, 69 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-06 01:20:51,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 01:20:51,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-02-06 01:20:51,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-02-06 01:20:51,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 01:20:51,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 69 transitions. [2025-02-06 01:20:51,464 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 69 transitions. Word has length 107 [2025-02-06 01:20:51,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:20:51,464 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 69 transitions. [2025-02-06 01:20:51,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 01:20:51,465 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 69 transitions. [2025-02-06 01:20:51,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-06 01:20:51,467 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:20:51,467 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:20:51,475 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-06 01:20:51,668 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-06 01:20:51,668 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:20:51,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:20:51,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1601682909, now seen corresponding path program 1 times [2025-02-06 01:20:51,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:20:51,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326025849] [2025-02-06 01:20:51,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:20:51,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:20:51,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 01:20:51,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 01:20:51,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:20:51,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 01:20:51,755 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 01:20:51,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 01:20:51,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 01:20:51,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:20:51,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 01:20:51,832 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 01:20:51,833 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 01:20:51,833 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 01:20:51,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 01:20:51,837 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-06 01:20:51,896 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 01:20:51,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 01:20:51 BoogieIcfgContainer [2025-02-06 01:20:51,898 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 01:20:51,898 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 01:20:51,898 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 01:20:51,899 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 01:20:51,899 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:20:50" (3/4) ... [2025-02-06 01:20:51,900 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 01:20:51,901 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 01:20:51,901 INFO L158 Benchmark]: Toolchain (without parser) took 1471.59ms. Allocated memory is still 167.8MB. Free memory was 133.5MB in the beginning and 128.3MB in the end (delta: 5.2MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. [2025-02-06 01:20:51,901 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 218.1MB. Free memory is still 132.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:20:51,902 INFO L158 Benchmark]: CACSL2BoogieTranslator took 185.79ms. Allocated memory is still 167.8MB. Free memory was 133.1MB in the beginning and 120.8MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 01:20:51,902 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.53ms. Allocated memory is still 167.8MB. Free memory was 120.8MB in the beginning and 119.2MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 01:20:51,902 INFO L158 Benchmark]: Boogie Preprocessor took 36.68ms. Allocated memory is still 167.8MB. Free memory was 119.2MB in the beginning and 117.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:20:51,902 INFO L158 Benchmark]: IcfgBuilder took 276.49ms. Allocated memory is still 167.8MB. Free memory was 117.0MB in the beginning and 102.4MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 01:20:51,903 INFO L158 Benchmark]: TraceAbstraction took 937.76ms. Allocated memory is still 167.8MB. Free memory was 101.5MB in the beginning and 128.3MB in the end (delta: -26.8MB). Peak memory consumption was 64.4MB. Max. memory is 16.1GB. [2025-02-06 01:20:51,903 INFO L158 Benchmark]: Witness Printer took 2.55ms. Allocated memory is still 167.8MB. Free memory was 128.3MB in the beginning and 128.3MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:20:51,904 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 218.1MB. Free memory is still 132.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 185.79ms. Allocated memory is still 167.8MB. Free memory was 133.1MB in the beginning and 120.8MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.53ms. Allocated memory is still 167.8MB. Free memory was 120.8MB in the beginning and 119.2MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.68ms. Allocated memory is still 167.8MB. Free memory was 119.2MB in the beginning and 117.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 276.49ms. Allocated memory is still 167.8MB. Free memory was 117.0MB in the beginning and 102.4MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 937.76ms. Allocated memory is still 167.8MB. Free memory was 101.5MB in the beginning and 128.3MB in the end (delta: -26.8MB). Peak memory consumption was 64.4MB. Max. memory is 16.1GB. * Witness Printer took 2.55ms. Allocated memory is still 167.8MB. Free memory was 128.3MB in the beginning and 128.3MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 38, overapproximation of someBinaryDOUBLEComparisonOperation at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 78, overapproximation of someBinaryDOUBLEComparisonOperation at line 80, overapproximation of someBinaryDOUBLEComparisonOperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 92, overapproximation of someBinaryDOUBLEComparisonOperation at line 39, overapproximation of someBinaryDOUBLEComparisonOperation at line 72, overapproximation of someBinaryDOUBLEComparisonOperation at line 70, overapproximation of someBinaryDOUBLEComparisonOperation at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 45. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -1; [L23] signed short int var_1_4 = 1; [L24] signed short int var_1_5 = -10; [L25] double var_1_6 = 10.4; [L26] double var_1_7 = 100000000000000.2; [L27] double var_1_8 = 99.4; [L28] double var_1_9 = 49.825; [L29] unsigned short int var_1_10 = 50; [L30] unsigned char var_1_11 = 0; [L31] double var_1_12 = 4.3; [L32] double var_1_13 = 2.875; [L33] unsigned short int var_1_14 = 64; [L34] unsigned short int var_1_15 = 50; VAL [isInitial=0, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=1, var_1_5=-10, var_1_6=52/5, var_1_7=500000000000001/5, var_1_8=497/5, var_1_9=1993/40] [L96] isInitial = 1 [L97] FCALL initially() [L98] COND TRUE 1 [L99] FCALL updateLastVariables() [L100] CALL updateVariables() [L61] var_1_4 = __VERIFIER_nondet_short() [L62] CALL assume_abort_if_not(var_1_4 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-10, var_1_6=52/5, var_1_7=500000000000001/5, var_1_8=497/5, var_1_9=1993/40] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-10, var_1_6=52/5, var_1_7=500000000000001/5, var_1_8=497/5, var_1_9=1993/40] [L62] RET assume_abort_if_not(var_1_4 >= -32767) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-10, var_1_6=52/5, var_1_7=500000000000001/5, var_1_8=497/5, var_1_9=1993/40] [L63] CALL assume_abort_if_not(var_1_4 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-10, var_1_6=52/5, var_1_7=500000000000001/5, var_1_8=497/5, var_1_9=1993/40] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-10, var_1_6=52/5, var_1_7=500000000000001/5, var_1_8=497/5, var_1_9=1993/40] [L63] RET assume_abort_if_not(var_1_4 <= 32766) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-10, var_1_6=52/5, var_1_7=500000000000001/5, var_1_8=497/5, var_1_9=1993/40] [L64] var_1_5 = __VERIFIER_nondet_short() [L65] CALL assume_abort_if_not(var_1_5 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5, var_1_7=500000000000001/5, var_1_8=497/5, var_1_9=1993/40] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5, var_1_7=500000000000001/5, var_1_8=497/5, var_1_9=1993/40] [L65] RET assume_abort_if_not(var_1_5 >= -32767) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5, var_1_7=500000000000001/5, var_1_8=497/5, var_1_9=1993/40] [L66] CALL assume_abort_if_not(var_1_5 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5, var_1_7=500000000000001/5, var_1_8=497/5, var_1_9=1993/40] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5, var_1_7=500000000000001/5, var_1_8=497/5, var_1_9=1993/40] [L66] RET assume_abort_if_not(var_1_5 <= 32766) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5, var_1_7=500000000000001/5, var_1_8=497/5, var_1_9=1993/40] [L67] var_1_7 = __VERIFIER_nondet_double() [L68] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5, var_1_8=497/5, var_1_9=1993/40] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5, var_1_8=497/5, var_1_9=1993/40] [L68] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5, var_1_8=497/5, var_1_9=1993/40] [L69] var_1_8 = __VERIFIER_nondet_double() [L70] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5, var_1_9=1993/40] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5, var_1_9=1993/40] [L70] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5, var_1_9=1993/40] [L71] var_1_9 = __VERIFIER_nondet_double() [L72] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L72] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L73] var_1_11 = __VERIFIER_nondet_uchar() [L74] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L74] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=50, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L75] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L75] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L76] var_1_12 = __VERIFIER_nondet_double() [L77] CALL assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L77] RET assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L78] CALL assume_abort_if_not(var_1_12 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L78] RET assume_abort_if_not(var_1_12 != 0.0F) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L79] var_1_13 = __VERIFIER_nondet_double() [L80] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L80] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L81] CALL assume_abort_if_not(var_1_13 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L81] RET assume_abort_if_not(var_1_13 != 0.0F) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L82] var_1_14 = __VERIFIER_nondet_ushort() [L83] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L83] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L84] CALL assume_abort_if_not(var_1_14 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_14=50, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_14=50, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L84] RET assume_abort_if_not(var_1_14 <= 65534) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_14=50, var_1_15=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L85] var_1_15 = __VERIFIER_nondet_ushort() [L86] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_14=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_14=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L86] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_14=50, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L87] CALL assume_abort_if_not(var_1_15 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_14=50, var_1_15=65534, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_14=50, var_1_15=65534, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L87] RET assume_abort_if_not(var_1_15 <= 65534) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_14=50, var_1_15=65534, var_1_1=-1, var_1_4=-5, var_1_5=-4, var_1_6=52/5] [L100] RET updateVariables() [L101] CALL step() [L38] var_1_6 = (var_1_7 - (var_1_8 + var_1_9)) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_14=50, var_1_15=65534, var_1_1=-1, var_1_4=-5, var_1_5=-4] [L39] COND TRUE var_1_6 > var_1_6 [L40] var_1_1 = ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_14=50, var_1_15=65534, var_1_1=-4, var_1_4=-5, var_1_5=-4] [L44] signed long int stepLocal_1 = 100; [L45] unsigned char stepLocal_0 = var_1_8 <= (var_1_7 + var_1_9); VAL [isInitial=1, stepLocal_0=0, stepLocal_1=100, var_1_10=50, var_1_11=0, var_1_14=50, var_1_15=65534, var_1_1=-4, var_1_4=-5, var_1_5=-4] [L46] COND FALSE !(var_1_11 || stepLocal_0) VAL [isInitial=1, stepLocal_1=100, var_1_10=50, var_1_11=0, var_1_14=50, var_1_15=65534, var_1_1=-4, var_1_4=-5, var_1_5=-4] [L101] RET step() [L102] CALL, EXPR property() [L92-L93] return (((var_1_6 > var_1_6) ? (var_1_1 == ((signed short int) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : (var_1_1 == ((signed short int) ((((-4) < (var_1_5)) ? (-4) : (var_1_5)))))) && (var_1_6 == ((double) (var_1_7 - (var_1_8 + var_1_9))))) && ((var_1_11 || (var_1_8 <= (var_1_7 + var_1_9))) ? ((((var_1_7 + var_1_6) / ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13)))) <= var_1_9) ? ((var_1_6 > 2.5) ? ((100 > var_1_1) ? (var_1_10 == ((unsigned short int) var_1_14)) : (var_1_10 == ((unsigned short int) var_1_15))) : (var_1_10 == ((unsigned short int) var_1_14))) : 1) : 1) ; VAL [\result=0, isInitial=1, var_1_10=50, var_1_11=0, var_1_14=50, var_1_15=65534, var_1_1=-4, var_1_4=-5, var_1_5=-4] [L102] RET, EXPR property() [L102] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_14=50, var_1_15=65534, var_1_1=-4, var_1_4=-5, var_1_5=-4] [L19] reach_error() VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_14=50, var_1_15=65534, var_1_1=-4, var_1_4=-5, var_1_5=-4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 69 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 69 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 321 NumberOfCodeBlocks, 321 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 212 ConstructedInterpolants, 0 QuantifiedInterpolants, 212 SizeOfPredicates, 0 NumberOfNonLiveVariables, 243 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 1056/1088 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-06 01:20:51,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-26.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 ddce48067b4423a9dbd4ae41b2384910d5e8f4f139aef66a78ce087435d0c23b --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 01:20:53,903 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 01:20:54,009 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 01:20:54,017 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 01:20:54,017 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 01:20:54,039 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 01:20:54,040 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 01:20:54,040 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 01:20:54,040 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 01:20:54,041 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 01:20:54,041 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 01:20:54,041 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 01:20:54,041 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 01:20:54,042 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 01:20:54,042 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 01:20:54,042 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 01:20:54,042 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 01:20:54,042 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 01:20:54,043 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 01:20:54,043 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 01:20:54,043 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 01:20:54,043 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 01:20:54,043 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 01:20:54,043 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 01:20:54,044 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 01:20:54,044 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 01:20:54,044 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 01:20:54,044 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 01:20:54,044 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 01:20:54,044 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 01:20:54,044 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 01:20:54,044 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 01:20:54,044 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 01:20:54,044 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 01:20:54,044 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:20:54,044 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 01:20:54,044 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 01:20:54,044 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 01:20:54,044 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 01:20:54,044 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 01:20:54,044 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 01:20:54,045 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 01:20:54,045 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 01:20:54,045 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 01:20:54,045 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 01:20:54,045 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 -> ddce48067b4423a9dbd4ae41b2384910d5e8f4f139aef66a78ce087435d0c23b [2025-02-06 01:20:54,292 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 01:20:54,298 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 01:20:54,299 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 01:20:54,300 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 01:20:54,300 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 01:20:54,300 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-26.i [2025-02-06 01:20:55,467 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/575de6c68/9b340d3c904247fab1b144f2bb6f42c0/FLAG684d3100c [2025-02-06 01:20:55,629 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 01:20:55,630 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-26.i [2025-02-06 01:20:55,637 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/575de6c68/9b340d3c904247fab1b144f2bb6f42c0/FLAG684d3100c [2025-02-06 01:20:55,651 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/575de6c68/9b340d3c904247fab1b144f2bb6f42c0 [2025-02-06 01:20:55,653 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 01:20:55,654 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 01:20:55,655 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 01:20:55,656 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 01:20:55,658 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 01:20:55,659 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:20:55" (1/1) ... [2025-02-06 01:20:55,659 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65bde35a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:20:55, skipping insertion in model container [2025-02-06 01:20:55,659 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:20:55" (1/1) ... [2025-02-06 01:20:55,672 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 01:20:55,776 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-26.i[915,928] [2025-02-06 01:20:55,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:20:55,829 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 01:20:55,837 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-26.i[915,928] [2025-02-06 01:20:55,847 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:20:55,862 INFO L204 MainTranslator]: Completed translation [2025-02-06 01:20:55,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:20:55 WrapperNode [2025-02-06 01:20:55,864 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 01:20:55,864 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 01:20:55,865 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 01:20:55,865 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 01:20:55,870 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:20:55" (1/1) ... [2025-02-06 01:20:55,877 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:20:55" (1/1) ... [2025-02-06 01:20:55,891 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 104 [2025-02-06 01:20:55,892 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 01:20:55,892 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 01:20:55,892 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 01:20:55,892 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 01:20:55,898 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:20:55" (1/1) ... [2025-02-06 01:20:55,898 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:20:55" (1/1) ... [2025-02-06 01:20:55,900 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:20:55" (1/1) ... [2025-02-06 01:20:55,906 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-06 01:20:55,906 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:20:55" (1/1) ... [2025-02-06 01:20:55,907 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:20:55" (1/1) ... [2025-02-06 01:20:55,911 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:20:55" (1/1) ... [2025-02-06 01:20:55,912 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:20:55" (1/1) ... [2025-02-06 01:20:55,916 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:20:55" (1/1) ... [2025-02-06 01:20:55,917 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:20:55" (1/1) ... [2025-02-06 01:20:55,921 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 01:20:55,921 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 01:20:55,921 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 01:20:55,921 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 01:20:55,922 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:20:55" (1/1) ... [2025-02-06 01:20:55,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:20:55,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:20:55,946 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-06 01:20:55,960 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-06 01:20:55,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 01:20:55,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 01:20:55,977 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 01:20:55,977 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 01:20:55,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 01:20:55,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 01:20:56,027 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 01:20:56,029 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 01:21:10,332 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-02-06 01:21:10,332 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 01:21:10,338 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 01:21:10,338 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 01:21:10,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:21:10 BoogieIcfgContainer [2025-02-06 01:21:10,338 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 01:21:10,340 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 01:21:10,340 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 01:21:10,343 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 01:21:10,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:20:55" (1/3) ... [2025-02-06 01:21:10,343 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3053880b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:21:10, skipping insertion in model container [2025-02-06 01:21:10,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:20:55" (2/3) ... [2025-02-06 01:21:10,344 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3053880b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:21:10, skipping insertion in model container [2025-02-06 01:21:10,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:21:10" (3/3) ... [2025-02-06 01:21:10,344 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-26.i [2025-02-06 01:21:10,354 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 01:21:10,355 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-26.i that has 2 procedures, 51 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 01:21:10,386 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 01:21:10,393 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@50b9e0a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 01:21:10,394 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 01:21:10,396 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 01:21:10,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-06 01:21:10,402 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:21:10,402 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:21:10,402 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:21:10,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:21:10,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1088172704, now seen corresponding path program 1 times [2025-02-06 01:21:10,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:21:10,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [358168554] [2025-02-06 01:21:10,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:21:10,446 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-06 01:21:10,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:21:10,448 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-06 01:21:10,450 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-06 01:21:10,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 01:21:11,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 01:21:11,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:21:11,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:21:11,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 01:21:11,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:21:11,389 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2025-02-06 01:21:11,390 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:21:11,390 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 01:21:11,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [358168554] [2025-02-06 01:21:11,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [358168554] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:21:11,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:21:11,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 01:21:11,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31813062] [2025-02-06 01:21:11,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:21:11,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 01:21:11,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 01:21:11,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 01:21:11,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 01:21:11,412 INFO L87 Difference]: Start difference. First operand has 51 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 01:21:11,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:21:11,432 INFO L93 Difference]: Finished difference Result 96 states and 160 transitions. [2025-02-06 01:21:11,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 01:21:11,434 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 107 [2025-02-06 01:21:11,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:21:11,438 INFO L225 Difference]: With dead ends: 96 [2025-02-06 01:21:11,438 INFO L226 Difference]: Without dead ends: 48 [2025-02-06 01:21:11,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 106 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-06 01:21:11,442 INFO L435 NwaCegarLoop]: 68 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, 68 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-06 01:21:11,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 01:21:11,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-02-06 01:21:11,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-02-06 01:21:11,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 01:21:11,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2025-02-06 01:21:11,473 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 107 [2025-02-06 01:21:11,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:21:11,473 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 68 transitions. [2025-02-06 01:21:11,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 01:21:11,473 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2025-02-06 01:21:11,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-06 01:21:11,475 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:21:11,475 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:21:11,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-02-06 01:21:11,676 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-06 01:21:11,676 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:21:11,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:21:11,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1805780706, now seen corresponding path program 1 times [2025-02-06 01:21:11,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:21:11,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [861472528] [2025-02-06 01:21:11,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:21:11,678 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-06 01:21:11,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:21:11,680 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-06 01:21:11,682 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-06 01:21:11,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 01:21:12,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 01:21:12,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:21:12,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:21:12,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 01:21:12,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:21:59,714 WARN L286 SmtUtils]: Spent 11.83s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)