./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-62.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c262302e-7c4c-4113-9053-b970051f3d4c/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c262302e-7c4c-4113-9053-b970051f3d4c/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c262302e-7c4c-4113-9053-b970051f3d4c/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c262302e-7c4c-4113-9053-b970051f3d4c/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-62.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c262302e-7c4c-4113-9053-b970051f3d4c/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c262302e-7c4c-4113-9053-b970051f3d4c/bin/uautomizer-verify-qhAvR1uOyd --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 272045d3d9c0142355d0f6ae800bad14dcc77630ed1a32e095636ad733b8b62e --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 16:04:07,801 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 16:04:07,909 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c262302e-7c4c-4113-9053-b970051f3d4c/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 16:04:07,915 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 16:04:07,915 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 16:04:07,948 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 16:04:07,948 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 16:04:07,948 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 16:04:07,949 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 16:04:07,949 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 16:04:07,949 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 16:04:07,949 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 16:04:07,951 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 16:04:07,952 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 16:04:07,953 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 16:04:07,954 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 16:04:07,954 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 16:04:07,954 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 16:04:07,954 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 16:04:07,954 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 16:04:07,954 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 16:04:07,954 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 16:04:07,955 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 16:04:07,955 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 16:04:07,955 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 16:04:07,955 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 16:04:07,955 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 16:04:07,955 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 16:04:07,955 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 16:04:07,955 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 16:04:07,955 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 16:04:07,955 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 16:04:07,955 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 16:04:07,956 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 16:04:07,956 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 16:04:07,956 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 16:04:07,956 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 16:04:07,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 16:04:07,956 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 16:04:07,956 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 16:04:07,958 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 16:04:07,958 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 16:04:07,958 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c262302e-7c4c-4113-9053-b970051f3d4c/bin/uautomizer-verify-qhAvR1uOyd 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 -> 272045d3d9c0142355d0f6ae800bad14dcc77630ed1a32e095636ad733b8b62e [2024-11-13 16:04:08,341 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 16:04:08,356 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 16:04:08,359 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 16:04:08,364 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 16:04:08,365 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 16:04:08,368 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c262302e-7c4c-4113-9053-b970051f3d4c/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-62.i Unable to find full path for "g++" [2024-11-13 16:04:10,807 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 16:04:11,200 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 16:04:11,203 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c262302e-7c4c-4113-9053-b970051f3d4c/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-62.i [2024-11-13 16:04:11,216 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c262302e-7c4c-4113-9053-b970051f3d4c/bin/uautomizer-verify-qhAvR1uOyd/data/9c3f9f949/3d8360f9cbfa40cfa6882988b3899ffa/FLAG9495bed74 [2024-11-13 16:04:11,246 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c262302e-7c4c-4113-9053-b970051f3d4c/bin/uautomizer-verify-qhAvR1uOyd/data/9c3f9f949/3d8360f9cbfa40cfa6882988b3899ffa [2024-11-13 16:04:11,250 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 16:04:11,253 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 16:04:11,255 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 16:04:11,255 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 16:04:11,261 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 16:04:11,262 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:04:11" (1/1) ... [2024-11-13 16:04:11,266 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d84824a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:04:11, skipping insertion in model container [2024-11-13 16:04:11,266 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:04:11" (1/1) ... [2024-11-13 16:04:11,301 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 16:04:11,480 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c262302e-7c4c-4113-9053-b970051f3d4c/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-62.i[915,928] [2024-11-13 16:04:11,561 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:04:11,575 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 16:04:11,589 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c262302e-7c4c-4113-9053-b970051f3d4c/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-62.i[915,928] [2024-11-13 16:04:11,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:04:11,646 INFO L204 MainTranslator]: Completed translation [2024-11-13 16:04:11,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:04:11 WrapperNode [2024-11-13 16:04:11,648 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 16:04:11,649 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 16:04:11,649 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 16:04:11,649 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 16:04:11,658 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:04:11" (1/1) ... [2024-11-13 16:04:11,680 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:04:11" (1/1) ... [2024-11-13 16:04:11,750 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 154 [2024-11-13 16:04:11,750 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 16:04:11,751 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 16:04:11,751 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 16:04:11,751 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 16:04:11,772 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:04:11" (1/1) ... [2024-11-13 16:04:11,772 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:04:11" (1/1) ... [2024-11-13 16:04:11,777 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:04:11" (1/1) ... [2024-11-13 16:04:11,806 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]. [2024-11-13 16:04:11,806 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:04:11" (1/1) ... [2024-11-13 16:04:11,806 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:04:11" (1/1) ... [2024-11-13 16:04:11,827 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:04:11" (1/1) ... [2024-11-13 16:04:11,832 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:04:11" (1/1) ... [2024-11-13 16:04:11,834 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:04:11" (1/1) ... [2024-11-13 16:04:11,836 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:04:11" (1/1) ... [2024-11-13 16:04:11,840 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 16:04:11,841 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 16:04:11,841 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 16:04:11,841 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 16:04:11,843 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:04:11" (1/1) ... [2024-11-13 16:04:11,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 16:04:11,869 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c262302e-7c4c-4113-9053-b970051f3d4c/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:04:11,886 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c262302e-7c4c-4113-9053-b970051f3d4c/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 16:04:11,890 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c262302e-7c4c-4113-9053-b970051f3d4c/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 16:04:11,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 16:04:11,924 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 16:04:11,926 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 16:04:11,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 16:04:11,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 16:04:11,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 16:04:12,066 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 16:04:12,068 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 16:04:12,570 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-13 16:04:12,570 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 16:04:12,584 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 16:04:12,584 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 16:04:12,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:04:12 BoogieIcfgContainer [2024-11-13 16:04:12,585 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 16:04:12,589 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 16:04:12,589 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 16:04:12,595 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 16:04:12,596 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 04:04:11" (1/3) ... [2024-11-13 16:04:12,596 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bdb311b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 04:04:12, skipping insertion in model container [2024-11-13 16:04:12,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:04:11" (2/3) ... [2024-11-13 16:04:12,597 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bdb311b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 04:04:12, skipping insertion in model container [2024-11-13 16:04:12,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:04:12" (3/3) ... [2024-11-13 16:04:12,599 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-62.i [2024-11-13 16:04:12,619 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 16:04:12,620 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-while_file-62.i that has 2 procedures, 70 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 16:04:12,695 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 16:04:12,710 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;@a881f57, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 16:04:12,710 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 16:04:12,715 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 49 states have internal predecessors, (68), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-13 16:04:12,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-13 16:04:12,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:04:12,732 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:04:12,733 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:04:12,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:04:12,739 INFO L85 PathProgramCache]: Analyzing trace with hash 871979289, now seen corresponding path program 1 times [2024-11-13 16:04:12,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:04:12,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506374865] [2024-11-13 16:04:12,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:04:12,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:04:12,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:13,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:04:13,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:13,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 16:04:13,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:13,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-13 16:04:13,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:13,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 16:04:13,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:13,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-13 16:04:13,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:13,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-13 16:04:13,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:13,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-13 16:04:13,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:13,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 16:04:13,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:13,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 16:04:13,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:13,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 16:04:13,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:13,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 16:04:13,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:13,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-13 16:04:13,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:13,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-13 16:04:13,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:13,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-13 16:04:13,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:13,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:04:13,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:13,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 16:04:13,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:13,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-13 16:04:13,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:13,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-13 16:04:13,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:13,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-13 16:04:13,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:13,436 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 16:04:13,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:04:13,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506374865] [2024-11-13 16:04:13,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506374865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:04:13,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:04:13,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:04:13,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293825302] [2024-11-13 16:04:13,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:04:13,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 16:04:13,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:04:13,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 16:04:13,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 16:04:13,484 INFO L87 Difference]: Start difference. First operand has 70 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 49 states have internal predecessors, (68), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-13 16:04:13,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:04:13,527 INFO L93 Difference]: Finished difference Result 129 states and 219 transitions. [2024-11-13 16:04:13,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 16:04:13,531 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 125 [2024-11-13 16:04:13,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:04:13,541 INFO L225 Difference]: With dead ends: 129 [2024-11-13 16:04:13,541 INFO L226 Difference]: Without dead ends: 62 [2024-11-13 16:04:13,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 16:04:13,552 INFO L432 NwaCegarLoop]: 91 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, 91 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 [2024-11-13 16:04:13,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:04:13,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-13 16:04:13,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-13 16:04:13,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-13 16:04:13,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 91 transitions. [2024-11-13 16:04:13,630 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 91 transitions. Word has length 125 [2024-11-13 16:04:13,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:04:13,630 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 91 transitions. [2024-11-13 16:04:13,630 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-13 16:04:13,631 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 91 transitions. [2024-11-13 16:04:13,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-13 16:04:13,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:04:13,639 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:04:13,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 16:04:13,644 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:04:13,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:04:13,644 INFO L85 PathProgramCache]: Analyzing trace with hash -501383725, now seen corresponding path program 1 times [2024-11-13 16:04:13,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:04:13,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575407794] [2024-11-13 16:04:13,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:04:13,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:04:13,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:14,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:04:14,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:14,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 16:04:14,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:14,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-13 16:04:14,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:14,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 16:04:14,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:14,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-13 16:04:14,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:14,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-13 16:04:14,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:14,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-13 16:04:14,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:14,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 16:04:14,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:14,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 16:04:14,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:14,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 16:04:14,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:14,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 16:04:14,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:14,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-13 16:04:14,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:14,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-13 16:04:14,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:14,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-13 16:04:14,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:14,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:04:14,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:14,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 16:04:14,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:14,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-13 16:04:14,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:14,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-13 16:04:14,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:14,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-13 16:04:14,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:14,499 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 16:04:14,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:04:14,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575407794] [2024-11-13 16:04:14,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575407794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:04:14,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:04:14,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 16:04:14,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498146953] [2024-11-13 16:04:14,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:04:14,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 16:04:14,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:04:14,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 16:04:14,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 16:04:14,508 INFO L87 Difference]: Start difference. First operand 62 states and 91 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 16:04:14,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:04:14,860 INFO L93 Difference]: Finished difference Result 188 states and 272 transitions. [2024-11-13 16:04:14,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 16:04:14,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 125 [2024-11-13 16:04:14,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:04:14,866 INFO L225 Difference]: With dead ends: 188 [2024-11-13 16:04:14,866 INFO L226 Difference]: Without dead ends: 129 [2024-11-13 16:04:14,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 16:04:14,870 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 104 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 16:04:14,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 209 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 16:04:14,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-13 16:04:14,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 96. [2024-11-13 16:04:14,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 66 states have internal predecessors, (82), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-13 16:04:14,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2024-11-13 16:04:14,923 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 125 [2024-11-13 16:04:14,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:04:14,924 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2024-11-13 16:04:14,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 16:04:14,924 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2024-11-13 16:04:14,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-13 16:04:14,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:04:14,931 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:04:14,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 16:04:14,931 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:04:14,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:04:14,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1273623637, now seen corresponding path program 1 times [2024-11-13 16:04:14,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:04:14,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819304046] [2024-11-13 16:04:14,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:04:14,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:04:15,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 16:04:15,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1191343492] [2024-11-13 16:04:15,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:04:15,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:04:15,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c262302e-7c4c-4113-9053-b970051f3d4c/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:04:15,159 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c262302e-7c4c-4113-9053-b970051f3d4c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:04:15,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c262302e-7c4c-4113-9053-b970051f3d4c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 16:04:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:04:15,450 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:04:15,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:04:15,646 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:04:15,647 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 16:04:15,648 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 16:04:15,677 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c262302e-7c4c-4113-9053-b970051f3d4c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 16:04:15,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c262302e-7c4c-4113-9053-b970051f3d4c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-13 16:04:15,854 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-13 16:04:15,964 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 16:04:15,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 04:04:15 BoogieIcfgContainer [2024-11-13 16:04:15,970 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 16:04:15,971 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 16:04:15,971 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 16:04:15,971 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 16:04:15,972 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:04:12" (3/4) ... [2024-11-13 16:04:15,976 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 16:04:15,978 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 16:04:15,979 INFO L158 Benchmark]: Toolchain (without parser) took 4727.00ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 39.9MB in the end (delta: 51.7MB). Peak memory consumption was 47.8MB. Max. memory is 16.1GB. [2024-11-13 16:04:15,980 INFO L158 Benchmark]: CDTParser took 1.37ms. Allocated memory is still 83.9MB. Free memory is still 41.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:04:15,980 INFO L158 Benchmark]: CACSL2BoogieTranslator took 393.46ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 77.9MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 16:04:15,980 INFO L158 Benchmark]: Boogie Procedure Inliner took 101.71ms. Allocated memory is still 117.4MB. Free memory was 77.9MB in the beginning and 75.5MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:04:15,981 INFO L158 Benchmark]: Boogie Preprocessor took 89.13ms. Allocated memory is still 117.4MB. Free memory was 75.0MB in the beginning and 72.2MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:04:15,981 INFO L158 Benchmark]: RCFGBuilder took 744.15ms. Allocated memory is still 117.4MB. Free memory was 72.2MB in the beginning and 53.2MB in the end (delta: 19.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 16:04:15,983 INFO L158 Benchmark]: TraceAbstraction took 3381.51ms. Allocated memory is still 117.4MB. Free memory was 52.7MB in the beginning and 39.9MB in the end (delta: 12.8MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. [2024-11-13 16:04:15,983 INFO L158 Benchmark]: Witness Printer took 7.65ms. Allocated memory is still 117.4MB. Free memory was 39.9MB in the beginning and 39.9MB in the end (delta: 14.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:04:15,985 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.37ms. Allocated memory is still 83.9MB. Free memory is still 41.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 393.46ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 77.9MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 101.71ms. Allocated memory is still 117.4MB. Free memory was 77.9MB in the beginning and 75.5MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 89.13ms. Allocated memory is still 117.4MB. Free memory was 75.0MB in the beginning and 72.2MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 744.15ms. Allocated memory is still 117.4MB. Free memory was 72.2MB in the beginning and 53.2MB in the end (delta: 19.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3381.51ms. Allocated memory is still 117.4MB. Free memory was 52.7MB in the beginning and 39.9MB in the end (delta: 12.8MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. * Witness Printer took 7.65ms. Allocated memory is still 117.4MB. Free memory was 39.9MB in the beginning and 39.9MB in the end (delta: 14.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 75, overapproximation of someBinaryArithmeticDOUBLEoperation at line 58, overapproximation of someBinaryFLOATComparisonOperation at line 97, overapproximation of someBinaryFLOATComparisonOperation at line 99, overapproximation of someBinaryFLOATComparisonOperation at line 113, overapproximation of someBinaryDOUBLEComparisonOperation at line 88, overapproximation of someBinaryDOUBLEComparisonOperation at line 67, overapproximation of someBinaryDOUBLEComparisonOperation at line 113, overapproximation of someBinaryDOUBLEComparisonOperation at line 92, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 43, overapproximation of someBinaryDOUBLEComparisonOperation at line 90. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.25; [L23] signed long int var_1_3 = -25; [L24] signed long int var_1_4 = -128; [L25] double var_1_6 = 2.75; [L26] double var_1_7 = 24.5; [L27] double var_1_8 = 199.5; [L28] float var_1_9 = 32.8; [L29] unsigned char var_1_10 = 1; [L30] float var_1_11 = 15.4; [L31] float var_1_12 = 0.0; [L32] unsigned long int var_1_13 = 2; [L33] float var_1_16 = 127.6; [L34] signed long int var_1_17 = 128; [L35] unsigned char var_1_19 = 10; [L36] unsigned char var_1_20 = 0; [L37] unsigned char var_1_21 = 64; [L38] double var_1_22 = 15.95; [L39] unsigned long int var_1_23 = 4127848294; VAL [isInitial=0, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=-25, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L117] isInitial = 1 [L118] FCALL initially() [L119] COND TRUE 1 [L120] FCALL updateLastVariables() [L121] CALL updateVariables() [L79] var_1_3 = __VERIFIER_nondet_long() [L80] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=-2, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=-2, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L80] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=-2, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L81] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=-2, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=-2, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L81] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=-2, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L82] CALL assume_abort_if_not(var_1_3 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=-2, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=-2, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L82] RET assume_abort_if_not(var_1_3 != 0) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=-2, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L83] var_1_4 = __VERIFIER_nondet_long() [L84] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=-2, var_1_4=3, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=-2, var_1_4=3, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L84] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=-2, var_1_4=3, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L85] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=-2, var_1_4=3, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=-2, var_1_4=3, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L85] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=-2, var_1_4=3, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L86] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=-2, var_1_4=3, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=-2, var_1_4=3, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L86] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=-2, var_1_4=3, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L87] var_1_6 = __VERIFIER_nondet_double() [L88] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=-2, var_1_4=3, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=-2, var_1_4=3, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L88] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=-2, var_1_4=3, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L89] var_1_7 = __VERIFIER_nondet_double() [L90] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=-2, var_1_4=3, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=-2, var_1_4=3, var_1_8=399/2, var_1_9=164/5] [L90] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=-2, var_1_4=3, var_1_8=399/2, var_1_9=164/5] [L91] var_1_8 = __VERIFIER_nondet_double() [L92] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=-2, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=-2, var_1_4=3, var_1_9=164/5] [L92] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=-2, var_1_4=3, var_1_9=164/5] [L93] var_1_10 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=-2, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=-2, var_1_4=3, var_1_9=164/5] [L94] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=-2, var_1_4=3, var_1_9=164/5] [L95] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=-2, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=-2, var_1_4=3, var_1_9=164/5] [L95] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=-2, var_1_4=3, var_1_9=164/5] [L96] var_1_11 = __VERIFIER_nondet_float() [L97] CALL assume_abort_if_not((var_1_11 >= -230584.3009213691390e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 2305843.009213691390e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=-2, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=-2, var_1_4=3, var_1_9=164/5] [L97] RET assume_abort_if_not((var_1_11 >= -230584.3009213691390e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 2305843.009213691390e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=-2, var_1_4=3, var_1_9=164/5] [L98] var_1_12 = __VERIFIER_nondet_float() [L99] CALL assume_abort_if_not((var_1_12 >= 4611686.018427382800e+12F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=-2, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=-2, var_1_4=3, var_1_9=164/5] [L99] RET assume_abort_if_not((var_1_12 >= 4611686.018427382800e+12F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=-2, var_1_4=3, var_1_9=164/5] [L100] var_1_20 = __VERIFIER_nondet_uchar() [L101] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=-2, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=-2, var_1_4=3, var_1_9=164/5] [L101] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=-2, var_1_4=3, var_1_9=164/5] [L102] CALL assume_abort_if_not(var_1_20 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=-2, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=-2, var_1_4=3, var_1_9=164/5] [L102] RET assume_abort_if_not(var_1_20 <= 1) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=-2, var_1_4=3, var_1_9=164/5] [L103] var_1_21 = __VERIFIER_nondet_uchar() [L104] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_22=319/20, var_1_23=4127848294, var_1_3=-2, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_22=319/20, var_1_23=4127848294, var_1_3=-2, var_1_4=3, var_1_9=164/5] [L104] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_22=319/20, var_1_23=4127848294, var_1_3=-2, var_1_4=3, var_1_9=164/5] [L105] CALL assume_abort_if_not(var_1_21 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=0, var_1_22=319/20, var_1_23=4127848294, var_1_3=-2, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=0, var_1_22=319/20, var_1_23=4127848294, var_1_3=-2, var_1_4=3, var_1_9=164/5] [L105] RET assume_abort_if_not(var_1_21 <= 254) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=0, var_1_22=319/20, var_1_23=4127848294, var_1_3=-2, var_1_4=3, var_1_9=164/5] [L106] var_1_23 = __VERIFIER_nondet_ulong() [L107] CALL assume_abort_if_not(var_1_23 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=0, var_1_22=319/20, var_1_23=2147483647, var_1_3=-2, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=0, var_1_22=319/20, var_1_23=2147483647, var_1_3=-2, var_1_4=3, var_1_9=164/5] [L107] RET assume_abort_if_not(var_1_23 >= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=0, var_1_22=319/20, var_1_23=2147483647, var_1_3=-2, var_1_4=3, var_1_9=164/5] [L108] CALL assume_abort_if_not(var_1_23 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=0, var_1_22=319/20, var_1_23=2147483647, var_1_3=-2, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=0, var_1_22=319/20, var_1_23=2147483647, var_1_3=-2, var_1_4=3, var_1_9=164/5] [L108] RET assume_abort_if_not(var_1_23 <= 4294967295) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=0, var_1_22=319/20, var_1_23=2147483647, var_1_3=-2, var_1_4=3, var_1_9=164/5] [L121] RET updateVariables() [L122] CALL step() [L43] COND TRUE var_1_12 <= (var_1_7 * 5.8f) [L44] var_1_16 = ((((((((var_1_12) > (var_1_7)) ? (var_1_12) : (var_1_7)))) < (var_1_8)) ? (((((var_1_12) > (var_1_7)) ? (var_1_12) : (var_1_7)))) : (var_1_8))) VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=2, var_1_16=2, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=0, var_1_22=319/20, var_1_23=2147483647, var_1_3=-2, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=164/5] [L48] COND TRUE var_1_10 || var_1_20 [L49] var_1_19 = ((((var_1_21) > (32)) ? (var_1_21) : (32))) VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=2, var_1_16=2, var_1_17=128, var_1_19=32, var_1_1=21/4, var_1_20=1, var_1_21=0, var_1_22=319/20, var_1_23=2147483647, var_1_3=-2, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=164/5] [L51] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=2, var_1_16=2, var_1_17=128, var_1_19=32, var_1_1=21/4, var_1_20=1, var_1_21=0, var_1_22=319/20, var_1_23=2147483647, var_1_3=-2, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=164/5] [L56] signed long int stepLocal_0 = (var_1_3 % var_1_4) * var_1_19; VAL [isInitial=1, stepLocal_0=-64, var_1_10=0, var_1_12=2, var_1_13=2, var_1_16=2, var_1_17=128, var_1_19=32, var_1_1=21/4, var_1_20=1, var_1_21=0, var_1_22=319/20, var_1_23=2147483647, var_1_3=-2, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=164/5] [L57] COND TRUE var_1_19 > stepLocal_0 [L58] var_1_1 = (var_1_6 - (var_1_7 + var_1_8)) VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=2, var_1_16=2, var_1_17=128, var_1_19=32, var_1_20=1, var_1_21=0, var_1_22=319/20, var_1_23=2147483647, var_1_3=-2, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=164/5] [L62] COND TRUE ! var_1_10 [L63] var_1_13 = (50u + var_1_19) VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=82, var_1_16=2, var_1_17=128, var_1_19=32, var_1_20=1, var_1_21=0, var_1_22=319/20, var_1_23=2147483647, var_1_3=-2, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=164/5] [L67] COND FALSE !(var_1_8 < (var_1_22 / var_1_12)) VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=82, var_1_16=2, var_1_17=128, var_1_19=32, var_1_20=1, var_1_21=0, var_1_22=319/20, var_1_23=2147483647, var_1_3=-2, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=164/5] [L72] COND FALSE !(var_1_10 || (var_1_19 == var_1_13)) [L75] var_1_9 = ((((((var_1_12 - var_1_7) - var_1_6)) < (var_1_11)) ? (((var_1_12 - var_1_7) - var_1_6)) : (var_1_11))) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=82, var_1_16=2, var_1_17=128, var_1_19=32, var_1_20=1, var_1_21=0, var_1_22=319/20, var_1_23=2147483647, var_1_3=-2, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=3] [L122] RET step() [L123] CALL, EXPR property() [L113] EXPR (((((((var_1_19 > ((var_1_3 % var_1_4) * var_1_19)) ? (var_1_1 == ((double) (var_1_6 - (var_1_7 + var_1_8)))) : (var_1_1 == ((double) (var_1_6 - (var_1_8 + var_1_7))))) && ((var_1_10 || (var_1_19 == var_1_13)) ? (var_1_9 == ((float) ((127.5f - ((((var_1_8) > (var_1_7)) ? (var_1_8) : (var_1_7)))) + (16.1f + var_1_11)))) : (var_1_9 == ((float) ((((((var_1_12 - var_1_7) - var_1_6)) < (var_1_11)) ? (((var_1_12 - var_1_7) - var_1_6)) : (var_1_11))))))) && ((! var_1_10) ? (var_1_13 == ((unsigned long int) (50u + var_1_19))) : (var_1_13 == ((unsigned long int) (var_1_19 + var_1_19))))) && ((var_1_12 <= (var_1_7 * 5.8f)) ? (var_1_16 == ((float) ((((((((var_1_12) > (var_1_7)) ? (var_1_12) : (var_1_7)))) < (var_1_8)) ? (((((var_1_12) > (var_1_7)) ? (var_1_12) : (var_1_7)))) : (var_1_8))))) : (var_1_16 == ((float) var_1_6)))) && ((var_1_8 < (var_1_22 / var_1_12)) ? ((var_1_22 > var_1_6) ? (var_1_17 == ((signed long int) var_1_19)) : 1) : 1)) && ((var_1_10 || var_1_20) ? (var_1_19 == ((unsigned char) ((((var_1_21) > (32)) ? (var_1_21) : (32))))) : 1)) && (var_1_10 ? (((var_1_19 | var_1_19) != (var_1_23 - var_1_19)) ? (var_1_22 == ((double) 4.75)) : 1) : 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=82, var_1_16=2, var_1_17=128, var_1_19=32, var_1_20=1, var_1_21=0, var_1_22=319/20, var_1_23=2147483647, var_1_3=-2, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=3] [L113-L114] return (((((((var_1_19 > ((var_1_3 % var_1_4) * var_1_19)) ? (var_1_1 == ((double) (var_1_6 - (var_1_7 + var_1_8)))) : (var_1_1 == ((double) (var_1_6 - (var_1_8 + var_1_7))))) && ((var_1_10 || (var_1_19 == var_1_13)) ? (var_1_9 == ((float) ((127.5f - ((((var_1_8) > (var_1_7)) ? (var_1_8) : (var_1_7)))) + (16.1f + var_1_11)))) : (var_1_9 == ((float) ((((((var_1_12 - var_1_7) - var_1_6)) < (var_1_11)) ? (((var_1_12 - var_1_7) - var_1_6)) : (var_1_11))))))) && ((! var_1_10) ? (var_1_13 == ((unsigned long int) (50u + var_1_19))) : (var_1_13 == ((unsigned long int) (var_1_19 + var_1_19))))) && ((var_1_12 <= (var_1_7 * 5.8f)) ? (var_1_16 == ((float) ((((((((var_1_12) > (var_1_7)) ? (var_1_12) : (var_1_7)))) < (var_1_8)) ? (((((var_1_12) > (var_1_7)) ? (var_1_12) : (var_1_7)))) : (var_1_8))))) : (var_1_16 == ((float) var_1_6)))) && ((var_1_8 < (var_1_22 / var_1_12)) ? ((var_1_22 > var_1_6) ? (var_1_17 == ((signed long int) var_1_19)) : 1) : 1)) && ((var_1_10 || var_1_20) ? (var_1_19 == ((unsigned char) ((((var_1_21) > (32)) ? (var_1_21) : (32))))) : 1)) && (var_1_10 ? (((var_1_19 | var_1_19) != (var_1_23 - var_1_19)) ? (var_1_22 == ((double) 4.75)) : 1) : 1) ; [L123] RET, EXPR property() [L123] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=82, var_1_16=2, var_1_17=128, var_1_19=32, var_1_20=1, var_1_21=0, var_1_22=319/20, var_1_23=2147483647, var_1_3=-2, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=3] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=82, var_1_16=2, var_1_17=128, var_1_19=32, var_1_20=1, var_1_21=0, var_1_22=319/20, var_1_23=2147483647, var_1_3=-2, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 70 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 3, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 104 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 104 mSDsluCounter, 300 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 95 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 44 IncrementalHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 205 mSDtfsCounter, 44 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=2, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 33 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 500 NumberOfCodeBlocks, 500 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 248 ConstructedInterpolants, 0 QuantifiedInterpolants, 294 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 1368/1368 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-13 16:04:16,026 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c262302e-7c4c-4113-9053-b970051f3d4c/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c262302e-7c4c-4113-9053-b970051f3d4c/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c262302e-7c4c-4113-9053-b970051f3d4c/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c262302e-7c4c-4113-9053-b970051f3d4c/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c262302e-7c4c-4113-9053-b970051f3d4c/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-62.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c262302e-7c4c-4113-9053-b970051f3d4c/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c262302e-7c4c-4113-9053-b970051f3d4c/bin/uautomizer-verify-qhAvR1uOyd --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 272045d3d9c0142355d0f6ae800bad14dcc77630ed1a32e095636ad733b8b62e --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 16:04:19,330 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 16:04:19,448 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c262302e-7c4c-4113-9053-b970051f3d4c/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-13 16:04:19,472 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 16:04:19,473 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 16:04:19,513 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 16:04:19,515 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 16:04:19,515 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 16:04:19,516 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 16:04:19,516 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 16:04:19,517 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 16:04:19,518 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 16:04:19,518 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 16:04:19,518 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 16:04:19,518 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 16:04:19,518 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 16:04:19,519 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 16:04:19,519 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 16:04:19,519 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 16:04:19,519 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 16:04:19,519 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 16:04:19,519 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 16:04:19,519 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 16:04:19,520 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 16:04:19,520 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 16:04:19,520 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 16:04:19,520 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 16:04:19,520 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 16:04:19,520 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 16:04:19,520 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 16:04:19,521 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 16:04:19,521 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 16:04:19,521 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 16:04:19,521 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 16:04:19,522 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 16:04:19,522 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 16:04:19,522 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 16:04:19,522 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 16:04:19,522 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 16:04:19,522 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 16:04:19,522 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 16:04:19,522 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 16:04:19,522 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 16:04:19,523 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 16:04:19,523 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c262302e-7c4c-4113-9053-b970051f3d4c/bin/uautomizer-verify-qhAvR1uOyd 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 -> 272045d3d9c0142355d0f6ae800bad14dcc77630ed1a32e095636ad733b8b62e [2024-11-13 16:04:19,960 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 16:04:19,974 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 16:04:19,977 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 16:04:19,980 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 16:04:19,980 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 16:04:19,982 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c262302e-7c4c-4113-9053-b970051f3d4c/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-62.i Unable to find full path for "g++" [2024-11-13 16:04:22,568 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 16:04:23,050 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 16:04:23,051 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c262302e-7c4c-4113-9053-b970051f3d4c/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-62.i [2024-11-13 16:04:23,067 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c262302e-7c4c-4113-9053-b970051f3d4c/bin/uautomizer-verify-qhAvR1uOyd/data/b13a6c6fc/2753afc306b342bd9c5695616e74d18f/FLAG1b458c1cd [2024-11-13 16:04:23,100 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c262302e-7c4c-4113-9053-b970051f3d4c/bin/uautomizer-verify-qhAvR1uOyd/data/b13a6c6fc/2753afc306b342bd9c5695616e74d18f [2024-11-13 16:04:23,104 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 16:04:23,107 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 16:04:23,109 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 16:04:23,111 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 16:04:23,117 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 16:04:23,118 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:04:23" (1/1) ... [2024-11-13 16:04:23,119 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3714ae71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:04:23, skipping insertion in model container [2024-11-13 16:04:23,122 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:04:23" (1/1) ... [2024-11-13 16:04:23,153 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 16:04:23,364 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c262302e-7c4c-4113-9053-b970051f3d4c/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-62.i[915,928] [2024-11-13 16:04:23,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:04:23,501 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 16:04:23,520 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c262302e-7c4c-4113-9053-b970051f3d4c/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-62.i[915,928] [2024-11-13 16:04:23,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:04:23,583 INFO L204 MainTranslator]: Completed translation [2024-11-13 16:04:23,584 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:04:23 WrapperNode [2024-11-13 16:04:23,584 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 16:04:23,586 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 16:04:23,586 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 16:04:23,586 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 16:04:23,595 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:04:23" (1/1) ... [2024-11-13 16:04:23,609 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:04:23" (1/1) ... [2024-11-13 16:04:23,641 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 124 [2024-11-13 16:04:23,641 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 16:04:23,642 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 16:04:23,642 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 16:04:23,643 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 16:04:23,654 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:04:23" (1/1) ... [2024-11-13 16:04:23,654 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:04:23" (1/1) ... [2024-11-13 16:04:23,659 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:04:23" (1/1) ... [2024-11-13 16:04:23,675 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]. [2024-11-13 16:04:23,676 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:04:23" (1/1) ... [2024-11-13 16:04:23,676 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:04:23" (1/1) ... [2024-11-13 16:04:23,693 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:04:23" (1/1) ... [2024-11-13 16:04:23,702 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:04:23" (1/1) ... [2024-11-13 16:04:23,705 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:04:23" (1/1) ... [2024-11-13 16:04:23,706 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:04:23" (1/1) ... [2024-11-13 16:04:23,710 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 16:04:23,711 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 16:04:23,712 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 16:04:23,712 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 16:04:23,713 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:04:23" (1/1) ... [2024-11-13 16:04:23,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 16:04:23,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c262302e-7c4c-4113-9053-b970051f3d4c/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:04:23,759 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c262302e-7c4c-4113-9053-b970051f3d4c/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 16:04:23,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c262302e-7c4c-4113-9053-b970051f3d4c/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 16:04:23,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 16:04:23,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 16:04:23,807 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 16:04:23,807 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 16:04:23,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 16:04:23,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 16:04:23,947 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 16:04:23,951 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 16:04:49,980 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-13 16:04:49,982 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 16:04:49,999 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 16:04:49,999 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 16:04:50,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:04:50 BoogieIcfgContainer [2024-11-13 16:04:50,000 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 16:04:50,004 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 16:04:50,004 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 16:04:50,011 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 16:04:50,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 04:04:23" (1/3) ... [2024-11-13 16:04:50,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d28d6be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 04:04:50, skipping insertion in model container [2024-11-13 16:04:50,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:04:23" (2/3) ... [2024-11-13 16:04:50,013 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d28d6be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 04:04:50, skipping insertion in model container [2024-11-13 16:04:50,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:04:50" (3/3) ... [2024-11-13 16:04:50,015 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-62.i [2024-11-13 16:04:50,035 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 16:04:50,038 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-while_file-62.i that has 2 procedures, 59 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 16:04:50,112 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 16:04:50,129 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;@5192f331, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 16:04:50,129 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 16:04:50,134 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-13 16:04:50,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-13 16:04:50,150 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:04:50,151 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:04:50,151 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:04:50,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:04:50,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1588662199, now seen corresponding path program 1 times [2024-11-13 16:04:50,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:04:50,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [276810333] [2024-11-13 16:04:50,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:04:50,174 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 [2024-11-13 16:04:50,174 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c262302e-7c4c-4113-9053-b970051f3d4c/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:04:50,179 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c262302e-7c4c-4113-9053-b970051f3d4c/bin/uautomizer-verify-qhAvR1uOyd/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) [2024-11-13 16:04:50,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c262302e-7c4c-4113-9053-b970051f3d4c/bin/uautomizer-verify-qhAvR1uOyd/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 [2024-11-13 16:04:52,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:52,313 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-13 16:04:52,324 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:04:52,421 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2024-11-13 16:04:52,421 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:04:52,422 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:04:52,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [276810333] [2024-11-13 16:04:52,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [276810333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:04:52,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:04:52,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:04:52,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438563746] [2024-11-13 16:04:52,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:04:52,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 16:04:52,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:04:52,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 16:04:52,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 16:04:52,466 INFO L87 Difference]: Start difference. First operand has 59 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 16:04:52,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:04:52,500 INFO L93 Difference]: Finished difference Result 111 states and 191 transitions. [2024-11-13 16:04:52,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 16:04:52,502 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), 1 states have call successors, (19), 1 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) Word has length 123 [2024-11-13 16:04:52,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:04:52,510 INFO L225 Difference]: With dead ends: 111 [2024-11-13 16:04:52,510 INFO L226 Difference]: Without dead ends: 55 [2024-11-13 16:04:52,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 16:04:52,518 INFO L432 NwaCegarLoop]: 82 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, 82 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 [2024-11-13 16:04:52,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:04:52,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-13 16:04:52,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-13 16:04:52,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-13 16:04:52,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 82 transitions. [2024-11-13 16:04:52,573 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 82 transitions. Word has length 123 [2024-11-13 16:04:52,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:04:52,575 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 82 transitions. [2024-11-13 16:04:52,576 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), 1 states have call successors, (19), 1 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 16:04:52,577 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 82 transitions. [2024-11-13 16:04:52,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-13 16:04:52,580 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:04:52,581 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:04:52,611 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c262302e-7c4c-4113-9053-b970051f3d4c/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-13 16:04:52,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c262302e-7c4c-4113-9053-b970051f3d4c/bin/uautomizer-verify-qhAvR1uOyd/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 [2024-11-13 16:04:52,782 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:04:52,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:04:52,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1126898417, now seen corresponding path program 1 times [2024-11-13 16:04:52,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:04:52,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1913186046] [2024-11-13 16:04:52,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:04:52,784 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 [2024-11-13 16:04:52,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c262302e-7c4c-4113-9053-b970051f3d4c/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:04:52,787 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c262302e-7c4c-4113-9053-b970051f3d4c/bin/uautomizer-verify-qhAvR1uOyd/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) [2024-11-13 16:04:52,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c262302e-7c4c-4113-9053-b970051f3d4c/bin/uautomizer-verify-qhAvR1uOyd/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 [2024-11-13 16:04:54,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:54,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 16:04:54,846 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:04:55,023 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 16:04:55,023 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:04:55,023 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:04:55,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1913186046] [2024-11-13 16:04:55,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1913186046] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:04:55,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:04:55,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:04:55,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781121946] [2024-11-13 16:04:55,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:04:55,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:04:55,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:04:55,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:04:55,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:04:55,028 INFO L87 Difference]: Start difference. First operand 55 states and 82 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 16:04:59,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 16:05:03,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 16:05:07,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.53s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 16:05:12,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 16:05:16,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.53s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 16:05:17,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:05:17,050 INFO L93 Difference]: Finished difference Result 140 states and 208 transitions. [2024-11-13 16:05:17,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:05:17,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 123 [2024-11-13 16:05:17,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:05:17,054 INFO L225 Difference]: With dead ends: 140 [2024-11-13 16:05:17,054 INFO L226 Difference]: Without dead ends: 88 [2024-11-13 16:05:17,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:05:17,056 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 41 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.0s IncrementalHoareTripleChecker+Time [2024-11-13 16:05:17,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 178 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 5 Unknown, 0 Unchecked, 22.0s Time] [2024-11-13 16:05:17,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-13 16:05:17,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2024-11-13 16:05:17,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 54 states have (on average 1.2777777777777777) internal successors, (69), 55 states have internal predecessors, (69), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-13 16:05:17,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 125 transitions. [2024-11-13 16:05:17,081 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 125 transitions. Word has length 123 [2024-11-13 16:05:17,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:05:17,082 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 125 transitions. [2024-11-13 16:05:17,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 16:05:17,083 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 125 transitions. [2024-11-13 16:05:17,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-13 16:05:17,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:05:17,088 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:05:17,118 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c262302e-7c4c-4113-9053-b970051f3d4c/bin/uautomizer-verify-qhAvR1uOyd/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)] Ended with exit code 0 [2024-11-13 16:05:17,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c262302e-7c4c-4113-9053-b970051f3d4c/bin/uautomizer-verify-qhAvR1uOyd/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 [2024-11-13 16:05:17,289 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:05:17,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:05:17,290 INFO L85 PathProgramCache]: Analyzing trace with hash -648108945, now seen corresponding path program 1 times [2024-11-13 16:05:17,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:05:17,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1470902914] [2024-11-13 16:05:17,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:05:17,290 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 [2024-11-13 16:05:17,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c262302e-7c4c-4113-9053-b970051f3d4c/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:05:17,293 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c262302e-7c4c-4113-9053-b970051f3d4c/bin/uautomizer-verify-qhAvR1uOyd/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) [2024-11-13 16:05:17,295 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c262302e-7c4c-4113-9053-b970051f3d4c/bin/uautomizer-verify-qhAvR1uOyd/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 (4)] Waiting until timeout for monitored process [2024-11-13 16:05:21,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:21,094 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-13 16:05:21,117 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:06:07,819 WARN L286 SmtUtils]: Spent 6.91s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:06:20,857 WARN L286 SmtUtils]: Spent 6.06s 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) [2024-11-13 16:06:28,922 WARN L286 SmtUtils]: Spent 8.07s 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) [2024-11-13 16:06:36,072 WARN L286 SmtUtils]: Spent 7.15s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:06:41,715 WARN L286 SmtUtils]: Spent 5.64s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:06:57,321 WARN L286 SmtUtils]: Spent 6.47s 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) [2024-11-13 16:07:14,297 WARN L286 SmtUtils]: Spent 5.01s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:07:27,798 WARN L286 SmtUtils]: Spent 6.09s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:07:45,306 WARN L286 SmtUtils]: Spent 6.53s 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) [2024-11-13 16:07:56,764 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse9 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode .cse9)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_12~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0))) (.cse7 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (and (fp.geq c_~var_1_6~0 .cse0) (fp.geq c_~var_1_8~0 .cse0) (fp.leq c_~var_1_7~0 .cse1) (fp.geq c_~var_1_7~0 .cse0) (let ((.cse3 (= c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode c_~var_1_8~0))) (.cse2 (fp.gt .cse6 c_~var_1_7~0))) (or (and (not .cse2) (let ((.cse4 (fp.lt c_~var_1_7~0 c_~var_1_8~0))) (or (and .cse3 (not .cse4)) (and .cse4 (= c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode c_~var_1_7~0)))))) (and (let ((.cse5 (fp.lt .cse6 c_~var_1_8~0))) (or (and .cse5 (= c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode .cse6))) (and .cse3 (not .cse5)))) .cse2))) (fp.leq .cse6 (fp.mul c_currentRoundingMode c_~var_1_7~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 29.0 5.0))))) (fp.leq c_~var_1_8~0 .cse1) (fp.leq c_~var_1_12~0 .cse7) (let ((.cse8 ((_ to_fp 8 24) c_currentRoundingMode 2305843009213691390.0))) (or (and (fp.leq c_~var_1_11~0 .cse8) (fp.geq c_~var_1_11~0 .cse9)) (and (fp.geq c_~var_1_11~0 (fp.neg .cse8)) (fp.leq c_~var_1_11~0 (fp.neg .cse9))))) (fp.geq c_~var_1_12~0 .cse9) (fp.leq c_~var_1_6~0 ((_ to_fp 11 53) c_currentRoundingMode .cse7)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2024-11-13 16:08:08,427 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:08:35,879 WARN L286 SmtUtils]: Spent 7.04s 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) [2024-11-13 16:08:42,493 WARN L286 SmtUtils]: Spent 6.61s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:08:52,153 WARN L286 SmtUtils]: Spent 6.25s 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) [2024-11-13 16:08:57,291 WARN L286 SmtUtils]: Spent 5.14s 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) [2024-11-13 16:09:06,591 WARN L286 SmtUtils]: Spent 7.15s 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) [2024-11-13 16:09:25,222 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:09:37,642 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:09:44,646 WARN L286 SmtUtils]: Spent 7.00s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:09:57,313 WARN L286 SmtUtils]: Spent 5.96s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:10:02,479 WARN L286 SmtUtils]: Spent 5.16s 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) [2024-11-13 16:10:10,263 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode .cse11)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_12~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0))) (.cse9 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (and (fp.geq c_~var_1_6~0 .cse0) (fp.geq c_~var_1_8~0 .cse0) (fp.leq c_~var_1_7~0 .cse1) (fp.geq c_~var_1_7~0 .cse0) (let ((.cse3 (= c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode c_~var_1_8~0))) (.cse2 (fp.gt .cse6 c_~var_1_7~0))) (or (and (not .cse2) (let ((.cse4 (fp.lt c_~var_1_7~0 c_~var_1_8~0))) (or (and .cse3 (not .cse4)) (and .cse4 (= c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode c_~var_1_7~0)))))) (and (let ((.cse5 (fp.lt .cse6 c_~var_1_8~0))) (or (and .cse5 (= c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode .cse6))) (and .cse3 (not .cse5)))) .cse2))) (fp.leq .cse6 (fp.mul c_currentRoundingMode c_~var_1_7~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 29.0 5.0))))) (let ((.cse8 ((_ zero_extend 24) c_~var_1_21~0))) (let ((.cse7 (bvsgt .cse8 (_ bv32 32)))) (or (and .cse7 (= c_~var_1_19~0 ((_ extract 7 0) .cse8))) (and (= (_ bv32 8) c_~var_1_19~0) (not .cse7))))) (fp.leq c_~var_1_8~0 .cse1) (fp.leq c_~var_1_12~0 .cse9) (let ((.cse10 ((_ to_fp 8 24) c_currentRoundingMode 2305843009213691390.0))) (or (and (fp.leq c_~var_1_11~0 .cse10) (fp.geq c_~var_1_11~0 .cse11)) (and (fp.geq c_~var_1_11~0 (fp.neg .cse10)) (fp.leq c_~var_1_11~0 (fp.neg .cse11))))) (fp.geq c_~var_1_12~0 .cse11) (fp.leq c_~var_1_6~0 ((_ to_fp 11 53) c_currentRoundingMode .cse9)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2024-11-13 16:10:14,302 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse11 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode .cse11)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_12~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0))) (.cse9 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (and (fp.geq c_~var_1_6~0 .cse0) (fp.geq c_~var_1_8~0 .cse0) (fp.leq c_~var_1_7~0 .cse1) (fp.geq c_~var_1_7~0 .cse0) (let ((.cse3 (= c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode c_~var_1_8~0))) (.cse2 (fp.gt .cse6 c_~var_1_7~0))) (or (and (not .cse2) (let ((.cse4 (fp.lt c_~var_1_7~0 c_~var_1_8~0))) (or (and .cse3 (not .cse4)) (and .cse4 (= c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode c_~var_1_7~0)))))) (and (let ((.cse5 (fp.lt .cse6 c_~var_1_8~0))) (or (and .cse5 (= c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode .cse6))) (and .cse3 (not .cse5)))) .cse2))) (fp.leq .cse6 (fp.mul c_currentRoundingMode c_~var_1_7~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 29.0 5.0))))) (let ((.cse8 ((_ zero_extend 24) c_~var_1_21~0))) (let ((.cse7 (bvsgt .cse8 (_ bv32 32)))) (or (and .cse7 (= c_~var_1_19~0 ((_ extract 7 0) .cse8))) (and (= (_ bv32 8) c_~var_1_19~0) (not .cse7))))) (fp.leq c_~var_1_8~0 .cse1) (fp.leq c_~var_1_12~0 .cse9) (let ((.cse10 ((_ to_fp 8 24) c_currentRoundingMode 2305843009213691390.0))) (or (and (fp.leq c_~var_1_11~0 .cse10) (fp.geq c_~var_1_11~0 .cse11)) (and (fp.geq c_~var_1_11~0 (fp.neg .cse10)) (fp.leq c_~var_1_11~0 (fp.neg .cse11))))) (fp.geq c_~var_1_12~0 .cse11) (fp.leq c_~var_1_6~0 ((_ to_fp 11 53) c_currentRoundingMode .cse9)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2024-11-13 16:10:25,094 WARN L286 SmtUtils]: Spent 7.58s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:10:49,754 WARN L286 SmtUtils]: Spent 5.83s 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) [2024-11-13 16:10:57,207 WARN L286 SmtUtils]: Spent 7.45s 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) [2024-11-13 16:11:04,564 WARN L286 SmtUtils]: Spent 7.36s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:11:09,971 WARN L286 SmtUtils]: Spent 5.41s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:11:46,271 WARN L286 SmtUtils]: Spent 7.35s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:12:02,601 WARN L286 SmtUtils]: Spent 7.90s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:12:25,754 WARN L286 SmtUtils]: Spent 6.42s 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) [2024-11-13 16:12:33,255 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode .cse11)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_12~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0))) (.cse9 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (and (fp.geq c_~var_1_6~0 .cse0) (= (_ bv0 8) c_~var_1_10~0) (fp.geq c_~var_1_8~0 .cse0) (fp.leq c_~var_1_7~0 .cse1) (fp.geq c_~var_1_7~0 .cse0) (let ((.cse3 (= c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode c_~var_1_8~0))) (.cse2 (fp.gt .cse6 c_~var_1_7~0))) (or (and (not .cse2) (let ((.cse4 (fp.lt c_~var_1_7~0 c_~var_1_8~0))) (or (and .cse3 (not .cse4)) (and .cse4 (= c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode c_~var_1_7~0)))))) (and (let ((.cse5 (fp.lt .cse6 c_~var_1_8~0))) (or (and .cse5 (= c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode .cse6))) (and .cse3 (not .cse5)))) .cse2))) (fp.leq .cse6 (fp.mul c_currentRoundingMode c_~var_1_7~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 29.0 5.0))))) (let ((.cse8 ((_ zero_extend 24) c_~var_1_21~0))) (let ((.cse7 (bvsgt .cse8 (_ bv32 32)))) (or (and .cse7 (= c_~var_1_19~0 ((_ extract 7 0) .cse8))) (and (= (_ bv32 8) c_~var_1_19~0) (not .cse7))))) (fp.leq c_~var_1_8~0 .cse1) (fp.leq c_~var_1_12~0 .cse9) (let ((.cse10 ((_ to_fp 8 24) c_currentRoundingMode 2305843009213691390.0))) (or (and (fp.leq c_~var_1_11~0 .cse10) (fp.geq c_~var_1_11~0 .cse11)) (and (fp.geq c_~var_1_11~0 (fp.neg .cse10)) (fp.leq c_~var_1_11~0 (fp.neg .cse11))))) (fp.geq c_~var_1_12~0 .cse11) (fp.leq c_~var_1_6~0 ((_ to_fp 11 53) c_currentRoundingMode .cse9)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2024-11-13 16:12:37,292 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse11 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode .cse11)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_12~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0))) (.cse9 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (and (fp.geq c_~var_1_6~0 .cse0) (= (_ bv0 8) c_~var_1_10~0) (fp.geq c_~var_1_8~0 .cse0) (fp.leq c_~var_1_7~0 .cse1) (fp.geq c_~var_1_7~0 .cse0) (let ((.cse3 (= c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode c_~var_1_8~0))) (.cse2 (fp.gt .cse6 c_~var_1_7~0))) (or (and (not .cse2) (let ((.cse4 (fp.lt c_~var_1_7~0 c_~var_1_8~0))) (or (and .cse3 (not .cse4)) (and .cse4 (= c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode c_~var_1_7~0)))))) (and (let ((.cse5 (fp.lt .cse6 c_~var_1_8~0))) (or (and .cse5 (= c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode .cse6))) (and .cse3 (not .cse5)))) .cse2))) (fp.leq .cse6 (fp.mul c_currentRoundingMode c_~var_1_7~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 29.0 5.0))))) (let ((.cse8 ((_ zero_extend 24) c_~var_1_21~0))) (let ((.cse7 (bvsgt .cse8 (_ bv32 32)))) (or (and .cse7 (= c_~var_1_19~0 ((_ extract 7 0) .cse8))) (and (= (_ bv32 8) c_~var_1_19~0) (not .cse7))))) (fp.leq c_~var_1_8~0 .cse1) (fp.leq c_~var_1_12~0 .cse9) (let ((.cse10 ((_ to_fp 8 24) c_currentRoundingMode 2305843009213691390.0))) (or (and (fp.leq c_~var_1_11~0 .cse10) (fp.geq c_~var_1_11~0 .cse11)) (and (fp.geq c_~var_1_11~0 (fp.neg .cse10)) (fp.leq c_~var_1_11~0 (fp.neg .cse11))))) (fp.geq c_~var_1_12~0 .cse11) (fp.leq c_~var_1_6~0 ((_ to_fp 11 53) c_currentRoundingMode .cse9)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2024-11-13 16:13:13,711 WARN L286 SmtUtils]: Spent 5.87s 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) [2024-11-13 16:13:20,504 WARN L286 SmtUtils]: Spent 6.79s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:13:39,657 WARN L286 SmtUtils]: Spent 6.20s 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) [2024-11-13 16:14:02,020 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:14:08,491 WARN L286 SmtUtils]: Spent 6.47s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:14:19,750 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:14:27,210 WARN L286 SmtUtils]: Spent 7.46s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:14:38,249 WARN L286 SmtUtils]: Spent 6.99s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:14:58,832 WARN L286 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:15:07,028 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:15:15,277 WARN L286 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:15:23,499 WARN L286 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:15:31,696 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:15:39,909 WARN L286 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:15:48,096 WARN L286 SmtUtils]: Spent 8.19s 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) [2024-11-13 16:15:56,284 WARN L286 SmtUtils]: Spent 8.19s 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) [2024-11-13 16:16:03,343 WARN L286 SmtUtils]: Spent 7.06s 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) [2024-11-13 16:16:11,570 WARN L286 SmtUtils]: Spent 8.23s 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) [2024-11-13 16:16:19,790 WARN L286 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:16:27,984 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:16:36,153 WARN L286 SmtUtils]: Spent 8.17s 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) [2024-11-13 16:16:44,370 WARN L286 SmtUtils]: Spent 8.22s 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) [2024-11-13 16:16:52,494 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:17:00,735 WARN L286 SmtUtils]: Spent 8.24s 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) [2024-11-13 16:17:07,148 WARN L286 SmtUtils]: Spent 6.41s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:17:13,739 WARN L286 SmtUtils]: Spent 6.59s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:17:21,899 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:17:30,054 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:17:38,392 WARN L286 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:17:46,546 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:17:54,751 WARN L286 SmtUtils]: Spent 8.20s 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) [2024-11-13 16:18:02,990 WARN L286 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:18:11,164 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:18:19,448 WARN L286 SmtUtils]: Spent 8.28s 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) [2024-11-13 16:18:27,695 WARN L286 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:18:35,918 WARN L286 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:18:44,146 WARN L286 SmtUtils]: Spent 8.23s 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) [2024-11-13 16:18:52,364 WARN L286 SmtUtils]: Spent 8.22s 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) [2024-11-13 16:18:56,428 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode .cse11)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_12~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0))) (.cse9 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (and (fp.geq c_~var_1_6~0 .cse0) (= (_ bv0 8) c_~var_1_10~0) (fp.geq c_~var_1_8~0 .cse0) (fp.leq c_~var_1_7~0 .cse1) (fp.geq c_~var_1_7~0 .cse0) (let ((.cse3 (= c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode c_~var_1_8~0))) (.cse2 (fp.gt .cse6 c_~var_1_7~0))) (or (and (not .cse2) (let ((.cse4 (fp.lt c_~var_1_7~0 c_~var_1_8~0))) (or (and .cse3 (not .cse4)) (and .cse4 (= c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode c_~var_1_7~0)))))) (and (let ((.cse5 (fp.lt .cse6 c_~var_1_8~0))) (or (and .cse5 (= c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode .cse6))) (and .cse3 (not .cse5)))) .cse2))) (fp.leq .cse6 (fp.mul c_currentRoundingMode c_~var_1_7~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 29.0 5.0))))) (let ((.cse8 ((_ zero_extend 24) c_~var_1_21~0))) (let ((.cse7 (bvsgt .cse8 (_ bv32 32)))) (or (and .cse7 (= c_~var_1_19~0 ((_ extract 7 0) .cse8))) (and (= (_ bv32 8) c_~var_1_19~0) (not .cse7))))) (= c_~var_1_1~0 (fp.sub c_currentRoundingMode c_~var_1_6~0 (fp.add c_currentRoundingMode c_~var_1_7~0 c_~var_1_8~0))) (fp.leq c_~var_1_8~0 .cse1) (fp.leq c_~var_1_12~0 .cse9) (let ((.cse10 ((_ to_fp 8 24) c_currentRoundingMode 2305843009213691390.0))) (or (and (fp.leq c_~var_1_11~0 .cse10) (fp.geq c_~var_1_11~0 .cse11)) (and (fp.geq c_~var_1_11~0 (fp.neg .cse10)) (fp.leq c_~var_1_11~0 (fp.neg .cse11))))) (fp.geq c_~var_1_12~0 .cse11) (fp.leq c_~var_1_6~0 ((_ to_fp 11 53) c_currentRoundingMode .cse9)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2024-11-13 16:19:00,482 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse11 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode .cse11)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_12~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0))) (.cse9 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (and (fp.geq c_~var_1_6~0 .cse0) (= (_ bv0 8) c_~var_1_10~0) (fp.geq c_~var_1_8~0 .cse0) (fp.leq c_~var_1_7~0 .cse1) (fp.geq c_~var_1_7~0 .cse0) (let ((.cse3 (= c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode c_~var_1_8~0))) (.cse2 (fp.gt .cse6 c_~var_1_7~0))) (or (and (not .cse2) (let ((.cse4 (fp.lt c_~var_1_7~0 c_~var_1_8~0))) (or (and .cse3 (not .cse4)) (and .cse4 (= c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode c_~var_1_7~0)))))) (and (let ((.cse5 (fp.lt .cse6 c_~var_1_8~0))) (or (and .cse5 (= c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode .cse6))) (and .cse3 (not .cse5)))) .cse2))) (fp.leq .cse6 (fp.mul c_currentRoundingMode c_~var_1_7~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 29.0 5.0))))) (let ((.cse8 ((_ zero_extend 24) c_~var_1_21~0))) (let ((.cse7 (bvsgt .cse8 (_ bv32 32)))) (or (and .cse7 (= c_~var_1_19~0 ((_ extract 7 0) .cse8))) (and (= (_ bv32 8) c_~var_1_19~0) (not .cse7))))) (= c_~var_1_1~0 (fp.sub c_currentRoundingMode c_~var_1_6~0 (fp.add c_currentRoundingMode c_~var_1_7~0 c_~var_1_8~0))) (fp.leq c_~var_1_8~0 .cse1) (fp.leq c_~var_1_12~0 .cse9) (let ((.cse10 ((_ to_fp 8 24) c_currentRoundingMode 2305843009213691390.0))) (or (and (fp.leq c_~var_1_11~0 .cse10) (fp.geq c_~var_1_11~0 .cse11)) (and (fp.geq c_~var_1_11~0 (fp.neg .cse10)) (fp.leq c_~var_1_11~0 (fp.neg .cse11))))) (fp.geq c_~var_1_12~0 .cse11) (fp.leq c_~var_1_6~0 ((_ to_fp 11 53) c_currentRoundingMode .cse9)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2024-11-13 16:19:08,810 WARN L286 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:19:16,975 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:19:25,173 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)