./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-39.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-39.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 78bf3ce40ded3ae0bef00a22026555953d3817587ab73904ce26421056be8ea6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:50:26,048 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:50:26,107 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 03:50:26,113 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:50:26,114 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:50:26,136 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:50:26,138 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:50:26,138 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:50:26,138 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:50:26,138 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:50:26,139 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:50:26,139 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:50:26,139 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:50:26,139 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:50:26,140 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:50:26,140 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:50:26,140 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:50:26,140 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:50:26,140 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 03:50:26,140 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:50:26,140 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:50:26,140 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:50:26,141 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:50:26,141 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:50:26,141 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:50:26,141 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:50:26,141 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:50:26,141 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:50:26,141 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:50:26,141 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:50:26,141 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:50:26,142 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:50:26,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:50:26,142 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:50:26,142 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:50:26,142 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:50:26,142 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:50:26,142 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 03:50:26,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 03:50:26,142 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:50:26,142 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:50:26,142 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:50:26,142 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:50:26,142 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 78bf3ce40ded3ae0bef00a22026555953d3817587ab73904ce26421056be8ea6 [2025-03-17 03:50:26,387 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:50:26,396 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:50:26,397 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:50:26,399 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:50:26,399 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:50:26,401 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-39.i [2025-03-17 03:50:27,466 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3593dfaa3/3e60b9626afe42febc2bbab50eb065d6/FLAG14e5cebea [2025-03-17 03:50:27,755 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:50:27,755 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-39.i [2025-03-17 03:50:27,762 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3593dfaa3/3e60b9626afe42febc2bbab50eb065d6/FLAG14e5cebea [2025-03-17 03:50:27,773 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3593dfaa3/3e60b9626afe42febc2bbab50eb065d6 [2025-03-17 03:50:27,775 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:50:27,777 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:50:27,778 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:50:27,778 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:50:27,781 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:50:27,782 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:50:27" (1/1) ... [2025-03-17 03:50:27,782 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a6a2277 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:50:27, skipping insertion in model container [2025-03-17 03:50:27,782 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:50:27" (1/1) ... [2025-03-17 03:50:27,795 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:50:27,899 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-39.i[915,928] [2025-03-17 03:50:27,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:50:27,971 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:50:27,980 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-39.i[915,928] [2025-03-17 03:50:28,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:50:28,024 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:50:28,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:50:28 WrapperNode [2025-03-17 03:50:28,025 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:50:28,026 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:50:28,026 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:50:28,026 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:50:28,030 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:50:28" (1/1) ... [2025-03-17 03:50:28,036 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:50:28" (1/1) ... [2025-03-17 03:50:28,053 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 160 [2025-03-17 03:50:28,053 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:50:28,054 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:50:28,054 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:50:28,054 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:50:28,060 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:50:28" (1/1) ... [2025-03-17 03:50:28,060 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:50:28" (1/1) ... [2025-03-17 03:50:28,062 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:50:28" (1/1) ... [2025-03-17 03:50:28,073 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 03:50:28,073 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:50:28" (1/1) ... [2025-03-17 03:50:28,074 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:50:28" (1/1) ... [2025-03-17 03:50:28,078 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:50:28" (1/1) ... [2025-03-17 03:50:28,078 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:50:28" (1/1) ... [2025-03-17 03:50:28,079 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:50:28" (1/1) ... [2025-03-17 03:50:28,080 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:50:28" (1/1) ... [2025-03-17 03:50:28,081 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:50:28,082 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:50:28,082 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:50:28,082 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:50:28,082 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:50:28" (1/1) ... [2025-03-17 03:50:28,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:50:28,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:50:28,107 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 03:50:28,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 03:50:28,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:50:28,126 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:50:28,126 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:50:28,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 03:50:28,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:50:28,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:50:28,183 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:50:28,184 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:50:28,408 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L126: havoc property_#t~bitwise15#1; [2025-03-17 03:50:28,425 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-17 03:50:28,425 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:50:28,436 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:50:28,437 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:50:28,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:50:28 BoogieIcfgContainer [2025-03-17 03:50:28,437 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:50:28,439 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:50:28,439 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:50:28,442 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:50:28,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:50:27" (1/3) ... [2025-03-17 03:50:28,443 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79e08545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:50:28, skipping insertion in model container [2025-03-17 03:50:28,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:50:28" (2/3) ... [2025-03-17 03:50:28,444 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79e08545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:50:28, skipping insertion in model container [2025-03-17 03:50:28,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:50:28" (3/3) ... [2025-03-17 03:50:28,445 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-39.i [2025-03-17 03:50:28,456 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:50:28,457 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-39.i that has 2 procedures, 62 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:50:28,501 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:50:28,509 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;@3f13769e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:50:28,509 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:50:28,512 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 43 states have (on average 1.441860465116279) internal successors, (62), 44 states have internal predecessors, (62), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 03:50:28,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-17 03:50:28,519 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:50:28,519 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:50:28,520 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:50:28,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:50:28,524 INFO L85 PathProgramCache]: Analyzing trace with hash 969083164, now seen corresponding path program 1 times [2025-03-17 03:50:28,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:50:28,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849381786] [2025-03-17 03:50:28,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:50:28,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:50:28,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 03:50:28,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 03:50:28,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:50:28,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:50:28,747 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-17 03:50:28,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:50:28,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849381786] [2025-03-17 03:50:28,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849381786] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:50:28,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254473851] [2025-03-17 03:50:28,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:50:28,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:50:28,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:50:28,756 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:50:28,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 03:50:28,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 03:50:28,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 03:50:28,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:50:28,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:50:28,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:50:28,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:50:28,901 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-17 03:50:28,906 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:50:28,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254473851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:50:28,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:50:28,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 03:50:28,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463867881] [2025-03-17 03:50:28,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:50:28,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:50:28,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:50:28,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:50:28,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:50:28,929 INFO L87 Difference]: Start difference. First operand has 62 states, 43 states have (on average 1.441860465116279) internal successors, (62), 44 states have internal predecessors, (62), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 03:50:28,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:50:28,949 INFO L93 Difference]: Finished difference Result 123 states and 203 transitions. [2025-03-17 03:50:28,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:50:28,951 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 108 [2025-03-17 03:50:28,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:50:28,956 INFO L225 Difference]: With dead ends: 123 [2025-03-17 03:50:28,956 INFO L226 Difference]: Without dead ends: 60 [2025-03-17 03:50:28,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:50:28,960 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:50:28,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:50:28,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-17 03:50:28,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-03-17 03:50:28,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.380952380952381) internal successors, (58), 42 states have internal predecessors, (58), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 03:50:28,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 90 transitions. [2025-03-17 03:50:28,996 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 90 transitions. Word has length 108 [2025-03-17 03:50:28,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:50:28,997 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 90 transitions. [2025-03-17 03:50:28,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 03:50:28,997 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 90 transitions. [2025-03-17 03:50:28,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-17 03:50:28,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:50:29,000 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:50:29,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 03:50:29,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 03:50:29,205 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:50:29,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:50:29,205 INFO L85 PathProgramCache]: Analyzing trace with hash -280217184, now seen corresponding path program 1 times [2025-03-17 03:50:29,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:50:29,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715644362] [2025-03-17 03:50:29,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:50:29,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:50:29,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 03:50:29,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 03:50:29,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:50:29,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:50:29,663 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 03:50:29,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 03:50:29,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 03:50:29,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:50:29,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:50:29,852 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 03:50:29,852 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 03:50:29,853 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 03:50:29,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 03:50:29,856 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-17 03:50:29,928 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 03:50:29,933 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:50:29 BoogieIcfgContainer [2025-03-17 03:50:29,933 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 03:50:29,934 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 03:50:29,934 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 03:50:29,934 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 03:50:29,935 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:50:28" (3/4) ... [2025-03-17 03:50:29,936 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 03:50:29,937 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 03:50:29,937 INFO L158 Benchmark]: Toolchain (without parser) took 2160.94ms. Allocated memory is still 142.6MB. Free memory was 103.0MB in the beginning and 35.2MB in the end (delta: 67.9MB). Peak memory consumption was 68.8MB. Max. memory is 16.1GB. [2025-03-17 03:50:29,938 INFO L158 Benchmark]: CDTParser took 0.55ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:50:29,938 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.42ms. Allocated memory is still 142.6MB. Free memory was 103.0MB in the beginning and 89.6MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 03:50:29,938 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.14ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 86.7MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:50:29,939 INFO L158 Benchmark]: Boogie Preprocessor took 27.41ms. Allocated memory is still 142.6MB. Free memory was 86.7MB in the beginning and 84.1MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:50:29,939 INFO L158 Benchmark]: IcfgBuilder took 355.82ms. Allocated memory is still 142.6MB. Free memory was 84.1MB in the beginning and 62.5MB in the end (delta: 21.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 03:50:29,939 INFO L158 Benchmark]: TraceAbstraction took 1494.54ms. Allocated memory is still 142.6MB. Free memory was 61.5MB in the beginning and 35.2MB in the end (delta: 26.3MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. [2025-03-17 03:50:29,939 INFO L158 Benchmark]: Witness Printer took 2.85ms. Allocated memory is still 142.6MB. Free memory was 35.2MB in the beginning and 35.2MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:50:29,940 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.55ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 247.42ms. Allocated memory is still 142.6MB. Free memory was 103.0MB in the beginning and 89.6MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.14ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 86.7MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.41ms. Allocated memory is still 142.6MB. Free memory was 86.7MB in the beginning and 84.1MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 355.82ms. Allocated memory is still 142.6MB. Free memory was 84.1MB in the beginning and 62.5MB in the end (delta: 21.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1494.54ms. Allocated memory is still 142.6MB. Free memory was 61.5MB in the beginning and 35.2MB in the end (delta: 26.3MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. * Witness Printer took 2.85ms. Allocated memory is still 142.6MB. Free memory was 35.2MB in the beginning and 35.2MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 69, overapproximation of someBinaryFLOATComparisonOperation at line 114, overapproximation of someBinaryFLOATComparisonOperation at line 110, overapproximation of someBinaryFLOATComparisonOperation at line 112, overapproximation of someBinaryFLOATComparisonOperation at line 126, overapproximation of someBinaryFLOATComparisonOperation at line 108, overapproximation of someBinaryArithmeticFLOAToperation at line 69. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -1; [L23] unsigned char var_1_6 = 0; [L24] signed short int var_1_7 = 8; [L25] signed short int var_1_8 = 4; [L26] unsigned long int var_1_9 = 256; [L27] unsigned long int var_1_10 = 10; [L28] unsigned long int var_1_11 = 3084274888; [L29] unsigned long int var_1_13 = 50; [L30] signed long int var_1_14 = -10; [L31] unsigned char var_1_16 = 0; [L32] float var_1_19 = 4.5; [L33] float var_1_20 = 15.375; [L34] float var_1_21 = 32.725; [L35] float var_1_22 = 63.5; [L36] float var_1_23 = 16.375; [L37] signed char var_1_24 = -32; [L38] signed char var_1_25 = 0; [L39] unsigned short int var_1_26 = 64; [L40] unsigned long int last_1_var_1_9 = 256; [L41] unsigned long int last_1_var_1_10 = 10; [L42] signed long int last_1_var_1_14 = -10; [L43] signed char last_1_var_1_24 = -32; [L130] isInitial = 1 [L131] FCALL initially() [L132] int k_loop; [L133] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=0, var_1_7=8, var_1_8=4, var_1_9=256] [L133] COND TRUE k_loop < 1 [L134] CALL updateLastVariables() [L120] last_1_var_1_9 = var_1_9 [L121] last_1_var_1_10 = var_1_10 [L122] last_1_var_1_14 = var_1_14 [L123] last_1_var_1_24 = var_1_24 [L134] RET updateLastVariables() [L135] CALL updateVariables() [L92] var_1_6 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_7=8, var_1_8=4, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_7=8, var_1_8=4, var_1_9=256] [L93] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_7=8, var_1_8=4, var_1_9=256] [L94] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=8, var_1_8=4, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=8, var_1_8=4, var_1_9=256] [L94] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=8, var_1_8=4, var_1_9=256] [L95] var_1_7 = __VERIFIER_nondet_short() [L96] CALL assume_abort_if_not(var_1_7 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=4, var_1_8=4, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=4, var_1_8=4, var_1_9=256] [L96] RET assume_abort_if_not(var_1_7 >= -1) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=4, var_1_8=4, var_1_9=256] [L97] CALL assume_abort_if_not(var_1_7 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=4, var_1_8=4, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=4, var_1_8=4, var_1_9=256] [L97] RET assume_abort_if_not(var_1_7 <= 32766) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=4, var_1_8=4, var_1_9=256] [L98] var_1_8 = __VERIFIER_nondet_short() [L99] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=4, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=4, var_1_8=0, var_1_9=256] [L99] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=4, var_1_8=0, var_1_9=256] [L100] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=4, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=4, var_1_8=0, var_1_9=256] [L100] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=4, var_1_8=0, var_1_9=256] [L101] var_1_11 = __VERIFIER_nondet_ulong() [L102] CALL assume_abort_if_not(var_1_11 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=4, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=4, var_1_8=0, var_1_9=256] [L102] RET assume_abort_if_not(var_1_11 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=4, var_1_8=0, var_1_9=256] [L103] CALL assume_abort_if_not(var_1_11 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=4, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=4, var_1_8=0, var_1_9=256] [L103] RET assume_abort_if_not(var_1_11 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=4, var_1_8=0, var_1_9=256] [L104] var_1_16 = __VERIFIER_nondet_uchar() [L105] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=4, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=4, var_1_8=0, var_1_9=256] [L105] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=4, var_1_8=0, var_1_9=256] [L106] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=4, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=4, var_1_8=0, var_1_9=256] [L106] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=4, var_1_8=0, var_1_9=256] [L107] var_1_20 = __VERIFIER_nondet_float() [L108] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=4, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=4, var_1_8=0, var_1_9=256] [L108] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=4, var_1_8=0, var_1_9=256] [L109] var_1_21 = __VERIFIER_nondet_float() [L110] CALL assume_abort_if_not((var_1_21 >= -461168.6018427382800e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=4, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=4, var_1_8=0, var_1_9=256] [L110] RET assume_abort_if_not((var_1_21 >= -461168.6018427382800e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=4, var_1_8=0, var_1_9=256] [L111] var_1_22 = __VERIFIER_nondet_float() [L112] CALL assume_abort_if_not((var_1_22 >= -461168.6018427382800e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=4, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=4, var_1_8=0, var_1_9=256] [L112] RET assume_abort_if_not((var_1_22 >= -461168.6018427382800e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=4, var_1_8=0, var_1_9=256] [L113] var_1_23 = __VERIFIER_nondet_float() [L114] CALL assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=4, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=4, var_1_8=0, var_1_9=256] [L114] RET assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=4, var_1_8=0, var_1_9=256] [L115] var_1_25 = __VERIFIER_nondet_char() [L116] CALL assume_abort_if_not(var_1_25 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_24=-32, var_1_25=-1, var_1_26=64, var_1_6=1, var_1_7=4, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_24=-32, var_1_25=-1, var_1_26=64, var_1_6=1, var_1_7=4, var_1_8=0, var_1_9=256] [L116] RET assume_abort_if_not(var_1_25 >= -127) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_24=-32, var_1_25=-1, var_1_26=64, var_1_6=1, var_1_7=4, var_1_8=0, var_1_9=256] [L117] CALL assume_abort_if_not(var_1_25 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_24=-32, var_1_25=-1, var_1_26=64, var_1_6=1, var_1_7=4, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_24=-32, var_1_25=-1, var_1_26=64, var_1_6=1, var_1_7=4, var_1_8=0, var_1_9=256] [L117] RET assume_abort_if_not(var_1_25 <= 126) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_24=-32, var_1_25=-1, var_1_26=64, var_1_6=1, var_1_7=4, var_1_8=0, var_1_9=256] [L135] RET updateVariables() [L136] CALL step() [L47] EXPR (last_1_var_1_10 + last_1_var_1_14) ^ last_1_var_1_10 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_24=-32, var_1_25=-1, var_1_26=64, var_1_6=1, var_1_7=4, var_1_8=0, var_1_9=256] [L47] unsigned long int stepLocal_0 = (last_1_var_1_10 + last_1_var_1_14) ^ last_1_var_1_10; [L48] COND TRUE stepLocal_0 < (last_1_var_1_24 | -4) [L49] var_1_1 = (var_1_7 - var_1_8) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=4, var_1_24=-32, var_1_25=-1, var_1_26=64, var_1_6=1, var_1_7=4, var_1_8=0, var_1_9=256] [L53] var_1_24 = var_1_25 [L54] var_1_26 = var_1_8 [L55] var_1_10 = ((((((((var_1_11 - var_1_8) < 0 ) ? -(var_1_11 - var_1_8) : (var_1_11 - var_1_8)))) < (((((0u) > (var_1_26)) ? (0u) : (var_1_26))))) ? (((((var_1_11 - var_1_8) < 0 ) ? -(var_1_11 - var_1_8) : (var_1_11 - var_1_8)))) : (((((0u) > (var_1_26)) ? (0u) : (var_1_26)))))) [L56] unsigned long int stepLocal_3 = var_1_8 / (1u + 16u); [L57] unsigned long int stepLocal_2 = var_1_11; VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, stepLocal_2=2147483647, stepLocal_3=0, var_1_10=0, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=4, var_1_24=-1, var_1_25=-1, var_1_26=0, var_1_6=1, var_1_7=4, var_1_8=0, var_1_9=256] [L58] COND FALSE !(var_1_26 < stepLocal_3) [L65] var_1_13 = var_1_8 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, stepLocal_2=2147483647, var_1_10=0, var_1_11=2147483647, var_1_13=0, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=4, var_1_24=-1, var_1_25=-1, var_1_26=0, var_1_6=1, var_1_7=4, var_1_8=0, var_1_9=256] [L67] signed short int stepLocal_4 = var_1_8; VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, stepLocal_2=2147483647, stepLocal_4=0, var_1_10=0, var_1_11=2147483647, var_1_13=0, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=4, var_1_24=-1, var_1_25=-1, var_1_26=0, var_1_6=1, var_1_7=4, var_1_8=0, var_1_9=256] [L68] COND TRUE stepLocal_4 <= var_1_13 [L69] var_1_19 = (((((((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21))) + var_1_22)) > (var_1_23)) ? ((((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21))) + var_1_22)) : (var_1_23))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, stepLocal_2=2147483647, var_1_10=0, var_1_11=2147483647, var_1_13=0, var_1_14=-10, var_1_16=1, var_1_19=3084274893, var_1_1=4, var_1_23=3084274893, var_1_24=-1, var_1_25=-1, var_1_26=0, var_1_6=1, var_1_7=4, var_1_8=0, var_1_9=256] [L73] unsigned long int stepLocal_1 = var_1_10; VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, stepLocal_1=0, stepLocal_2=2147483647, var_1_10=0, var_1_11=2147483647, var_1_13=0, var_1_14=-10, var_1_16=1, var_1_19=3084274893, var_1_1=4, var_1_23=3084274893, var_1_24=-1, var_1_25=-1, var_1_26=0, var_1_6=1, var_1_7=4, var_1_8=0, var_1_9=256] [L74] COND FALSE !(stepLocal_1 >= ((((var_1_1) < (last_1_var_1_9)) ? (var_1_1) : (last_1_var_1_9)))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, stepLocal_2=2147483647, var_1_10=0, var_1_11=2147483647, var_1_13=0, var_1_14=-10, var_1_16=1, var_1_19=3084274893, var_1_1=4, var_1_23=3084274893, var_1_24=-1, var_1_25=-1, var_1_26=0, var_1_6=1, var_1_7=4, var_1_8=0, var_1_9=256] [L79] COND FALSE !(var_1_26 >= var_1_7) [L88] var_1_14 = var_1_24 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, stepLocal_2=2147483647, var_1_10=0, var_1_11=2147483647, var_1_13=0, var_1_14=-1, var_1_16=1, var_1_19=3084274893, var_1_1=4, var_1_23=3084274893, var_1_24=-1, var_1_25=-1, var_1_26=0, var_1_6=1, var_1_7=4, var_1_8=0, var_1_9=256] [L136] RET step() [L137] CALL, EXPR property() [L126] EXPR (last_1_var_1_10 + last_1_var_1_14) ^ last_1_var_1_10 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=0, var_1_11=2147483647, var_1_13=0, var_1_14=-1, var_1_16=1, var_1_19=3084274893, var_1_1=4, var_1_23=3084274893, var_1_24=-1, var_1_25=-1, var_1_26=0, var_1_6=1, var_1_7=4, var_1_8=0, var_1_9=256] [L126-L127] return ((((((((((last_1_var_1_10 + last_1_var_1_14) ^ last_1_var_1_10) < (last_1_var_1_24 | -4)) ? (var_1_1 == ((signed short int) (var_1_7 - var_1_8))) : (var_1_1 == ((signed short int) (last_1_var_1_10 + -16)))) && ((var_1_10 >= ((((var_1_1) < (last_1_var_1_9)) ? (var_1_1) : (last_1_var_1_9)))) ? (var_1_6 ? (var_1_9 == ((unsigned long int) var_1_8)) : 1) : 1)) && (var_1_10 == ((unsigned long int) ((((((((var_1_11 - var_1_8) < 0 ) ? -(var_1_11 - var_1_8) : (var_1_11 - var_1_8)))) < (((((0u) > (var_1_26)) ? (0u) : (var_1_26))))) ? (((((var_1_11 - var_1_8) < 0 ) ? -(var_1_11 - var_1_8) : (var_1_11 - var_1_8)))) : (((((0u) > (var_1_26)) ? (0u) : (var_1_26))))))))) && ((var_1_26 < (var_1_8 / (1u + 16u))) ? ((var_1_11 > (var_1_26 + 5u)) ? (var_1_13 == ((unsigned long int) ((((var_1_26) > (var_1_11)) ? (var_1_26) : (var_1_11))))) : (var_1_13 == ((unsigned long int) 5u))) : (var_1_13 == ((unsigned long int) var_1_8)))) && ((var_1_26 >= var_1_7) ? ((var_1_1 > var_1_11) ? ((var_1_6 && var_1_16) ? (var_1_14 == ((signed long int) (var_1_7 - (var_1_26 + var_1_8)))) : (var_1_14 == ((signed long int) var_1_26))) : 1) : (var_1_14 == ((signed long int) var_1_24)))) && ((var_1_8 <= var_1_13) ? (var_1_19 == ((float) (((((((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21))) + var_1_22)) > (var_1_23)) ? ((((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21))) + var_1_22)) : (var_1_23))))) : (var_1_19 == ((float) var_1_22)))) && (var_1_24 == ((signed char) var_1_25))) && (var_1_26 == ((unsigned short int) var_1_8)) ; [L137] RET, EXPR property() [L137] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=0, var_1_11=2147483647, var_1_13=0, var_1_14=-1, var_1_16=1, var_1_19=3084274893, var_1_1=4, var_1_23=3084274893, var_1_24=-1, var_1_25=-1, var_1_26=0, var_1_6=1, var_1_7=4, var_1_8=0, var_1_9=256] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=0, var_1_11=2147483647, var_1_13=0, var_1_14=-1, var_1_16=1, var_1_19=3084274893, var_1_1=4, var_1_23=3084274893, var_1_24=-1, var_1_25=-1, var_1_26=0, var_1_6=1, var_1_7=4, var_1_8=0, var_1_9=256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 62 locations, 110 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 2, TraceHistogramMax: 16, 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, 90 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2 IncrementalHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 90 mSDtfsCounter, 2 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred 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.5s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 324 NumberOfCodeBlocks, 324 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 214 ConstructedInterpolants, 0 QuantifiedInterpolants, 214 SizeOfPredicates, 0 NumberOfNonLiveVariables, 286 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 930/960 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 03:50:29,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-39.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 78bf3ce40ded3ae0bef00a22026555953d3817587ab73904ce26421056be8ea6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:50:31,719 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:50:31,796 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 03:50:31,803 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:50:31,805 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:50:31,828 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:50:31,828 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:50:31,829 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:50:31,829 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:50:31,829 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:50:31,829 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:50:31,829 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:50:31,829 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:50:31,829 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:50:31,829 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:50:31,829 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:50:31,830 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:50:31,830 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:50:31,831 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:50:31,831 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:50:31,831 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:50:31,831 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:50:31,831 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:50:31,831 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 03:50:31,831 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 03:50:31,832 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 03:50:31,832 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:50:31,832 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:50:31,832 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:50:31,832 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:50:31,832 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:50:31,833 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:50:31,833 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:50:31,833 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:50:31,833 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:50:31,833 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:50:31,833 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:50:31,833 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:50:31,833 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:50:31,833 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 03:50:31,833 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 03:50:31,833 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:50:31,833 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:50:31,833 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:50:31,833 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:50:31,833 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 78bf3ce40ded3ae0bef00a22026555953d3817587ab73904ce26421056be8ea6 [2025-03-17 03:50:32,056 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:50:32,064 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:50:32,066 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:50:32,066 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:50:32,068 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:50:32,070 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-39.i [2025-03-17 03:50:33,236 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/126f9c4b3/de7783714eb74cb6b3cacae1f24e99ac/FLAGd912a2371 [2025-03-17 03:50:33,461 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:50:33,461 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-39.i [2025-03-17 03:50:33,468 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/126f9c4b3/de7783714eb74cb6b3cacae1f24e99ac/FLAGd912a2371 [2025-03-17 03:50:33,815 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/126f9c4b3/de7783714eb74cb6b3cacae1f24e99ac [2025-03-17 03:50:33,817 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:50:33,818 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:50:33,819 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:50:33,819 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:50:33,822 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:50:33,822 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:50:33" (1/1) ... [2025-03-17 03:50:33,823 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cd46de2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:50:33, skipping insertion in model container [2025-03-17 03:50:33,823 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:50:33" (1/1) ... [2025-03-17 03:50:33,840 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:50:33,943 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-39.i[915,928] [2025-03-17 03:50:33,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:50:34,001 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:50:34,008 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-39.i[915,928] [2025-03-17 03:50:34,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:50:34,036 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:50:34,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:50:34 WrapperNode [2025-03-17 03:50:34,037 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:50:34,037 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:50:34,037 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:50:34,038 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:50:34,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:50:34" (1/1) ... [2025-03-17 03:50:34,047 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:50:34" (1/1) ... [2025-03-17 03:50:34,060 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 136 [2025-03-17 03:50:34,060 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:50:34,061 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:50:34,061 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:50:34,061 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:50:34,068 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:50:34" (1/1) ... [2025-03-17 03:50:34,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:50:34" (1/1) ... [2025-03-17 03:50:34,071 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:50:34" (1/1) ... [2025-03-17 03:50:34,081 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 03:50:34,081 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:50:34" (1/1) ... [2025-03-17 03:50:34,081 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:50:34" (1/1) ... [2025-03-17 03:50:34,087 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:50:34" (1/1) ... [2025-03-17 03:50:34,087 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:50:34" (1/1) ... [2025-03-17 03:50:34,088 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:50:34" (1/1) ... [2025-03-17 03:50:34,089 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:50:34" (1/1) ... [2025-03-17 03:50:34,093 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:50:34,094 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:50:34,094 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:50:34,094 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:50:34,094 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:50:34" (1/1) ... [2025-03-17 03:50:34,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:50:34,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:50:34,116 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 03:50:34,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 03:50:34,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:50:34,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 03:50:34,133 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:50:34,133 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:50:34,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:50:34,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:50:34,184 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:50:34,186 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:50:34,549 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-17 03:50:34,550 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:50:34,556 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:50:34,556 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:50:34,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:50:34 BoogieIcfgContainer [2025-03-17 03:50:34,556 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:50:34,558 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:50:34,558 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:50:34,572 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:50:34,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:50:33" (1/3) ... [2025-03-17 03:50:34,573 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b9f7113 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:50:34, skipping insertion in model container [2025-03-17 03:50:34,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:50:34" (2/3) ... [2025-03-17 03:50:34,573 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b9f7113 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:50:34, skipping insertion in model container [2025-03-17 03:50:34,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:50:34" (3/3) ... [2025-03-17 03:50:34,574 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-39.i [2025-03-17 03:50:34,583 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:50:34,584 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-39.i that has 2 procedures, 51 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:50:34,620 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:50:34,630 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;@fca2529, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:50:34,630 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:50:34,634 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 32 states have (on average 1.40625) internal successors, (45), 33 states have internal predecessors, (45), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 03:50:34,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-17 03:50:34,639 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:50:34,639 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:50:34,640 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:50:34,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:50:34,643 INFO L85 PathProgramCache]: Analyzing trace with hash -790737924, now seen corresponding path program 1 times [2025-03-17 03:50:34,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:50:34,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [605337606] [2025-03-17 03:50:34,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:50:34,649 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:50:34,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:50:34,651 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 03:50:34,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 03:50:34,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-17 03:50:34,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-17 03:50:34,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:50:34,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:50:34,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:50:34,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:50:34,855 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2025-03-17 03:50:34,855 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:50:34,856 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:50:34,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [605337606] [2025-03-17 03:50:34,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [605337606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:50:34,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:50:34,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 03:50:34,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299706749] [2025-03-17 03:50:34,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:50:34,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:50:34,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:50:34,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:50:34,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:50:34,875 INFO L87 Difference]: Start difference. First operand has 51 states, 32 states have (on average 1.40625) internal successors, (45), 33 states have internal predecessors, (45), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 03:50:34,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:50:34,889 INFO L93 Difference]: Finished difference Result 101 states and 169 transitions. [2025-03-17 03:50:34,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:50:34,891 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 103 [2025-03-17 03:50:34,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:50:34,897 INFO L225 Difference]: With dead ends: 101 [2025-03-17 03:50:34,897 INFO L226 Difference]: Without dead ends: 49 [2025-03-17 03:50:34,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:50:34,902 INFO L435 NwaCegarLoop]: 75 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, 75 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:50:34,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:50:34,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-17 03:50:34,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-17 03:50:34,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 03:50:34,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 73 transitions. [2025-03-17 03:50:34,936 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 73 transitions. Word has length 103 [2025-03-17 03:50:34,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:50:34,936 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 73 transitions. [2025-03-17 03:50:34,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 03:50:34,936 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 73 transitions. [2025-03-17 03:50:34,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-17 03:50:34,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:50:34,940 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:50:34,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 03:50:35,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:50:35,141 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:50:35,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:50:35,142 INFO L85 PathProgramCache]: Analyzing trace with hash 2075252984, now seen corresponding path program 1 times [2025-03-17 03:50:35,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:50:35,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1478838760] [2025-03-17 03:50:35,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:50:35,142 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:50:35,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:50:35,144 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 03:50:35,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 03:50:35,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-17 03:50:35,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-17 03:50:35,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:50:35,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:50:35,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-17 03:50:35,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:51:03,644 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-17 03:51:27,434 WARN L286 SmtUtils]: Spent 20.51s on a formula simplification that was a NOOP. DAG size: 89 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-17 03:51:48,455 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)