./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-48.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05bf9e10-6be9-4cc4-b542-2ae8294ab418/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05bf9e10-6be9-4cc4-b542-2ae8294ab418/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05bf9e10-6be9-4cc4-b542-2ae8294ab418/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05bf9e10-6be9-4cc4-b542-2ae8294ab418/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-48.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05bf9e10-6be9-4cc4-b542-2ae8294ab418/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05bf9e10-6be9-4cc4-b542-2ae8294ab418/bin/uautomizer-verify-BQ2R08f2Ya --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 c6d412f41e33ad776ddd1099cb1079697e2761edfdecb4fbe189cb4f98c9e06c --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:06:24,380 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:06:24,447 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05bf9e10-6be9-4cc4-b542-2ae8294ab418/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 05:06:24,451 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:06:24,452 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:06:24,474 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:06:24,474 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:06:24,475 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:06:24,475 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:06:24,476 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:06:24,477 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:06:24,477 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:06:24,478 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:06:24,478 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:06:24,479 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:06:24,479 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:06:24,480 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 05:06:24,480 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:06:24,481 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:06:24,481 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:06:24,482 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:06:24,483 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 05:06:24,483 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:06:24,484 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 05:06:24,484 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:06:24,485 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 05:06:24,485 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:06:24,486 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:06:24,486 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:06:24,486 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:06:24,487 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:06:24,487 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:06:24,487 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:06:24,488 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:06:24,488 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 05:06:24,488 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 05:06:24,488 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 05:06:24,489 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:06:24,489 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:06:24,489 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 05:06:24,489 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:06:24,489 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:06:24,490 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05bf9e10-6be9-4cc4-b542-2ae8294ab418/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_05bf9e10-6be9-4cc4-b542-2ae8294ab418/bin/uautomizer-verify-BQ2R08f2Ya 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 -> c6d412f41e33ad776ddd1099cb1079697e2761edfdecb4fbe189cb4f98c9e06c [2023-11-29 05:06:24,702 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:06:24,742 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:06:24,745 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:06:24,746 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:06:24,747 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:06:24,748 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05bf9e10-6be9-4cc4-b542-2ae8294ab418/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-48.i [2023-11-29 05:06:27,683 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:06:27,860 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:06:27,860 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05bf9e10-6be9-4cc4-b542-2ae8294ab418/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-48.i [2023-11-29 05:06:27,868 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05bf9e10-6be9-4cc4-b542-2ae8294ab418/bin/uautomizer-verify-BQ2R08f2Ya/data/469fd720a/be708ec21c944307a96ab8309c44cb0c/FLAGa9c34d9f5 [2023-11-29 05:06:27,881 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05bf9e10-6be9-4cc4-b542-2ae8294ab418/bin/uautomizer-verify-BQ2R08f2Ya/data/469fd720a/be708ec21c944307a96ab8309c44cb0c [2023-11-29 05:06:27,883 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:06:27,884 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:06:27,885 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:06:27,885 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:06:27,889 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:06:27,890 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:06:27" (1/1) ... [2023-11-29 05:06:27,891 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c5c64a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:06:27, skipping insertion in model container [2023-11-29 05:06:27,891 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:06:27" (1/1) ... [2023-11-29 05:06:27,915 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:06:28,035 WARN L240 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_05bf9e10-6be9-4cc4-b542-2ae8294ab418/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-48.i[917,930] [2023-11-29 05:06:28,080 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:06:28,092 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:06:28,105 WARN L240 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_05bf9e10-6be9-4cc4-b542-2ae8294ab418/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-48.i[917,930] [2023-11-29 05:06:28,130 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:06:28,147 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:06:28,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:06:28 WrapperNode [2023-11-29 05:06:28,147 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:06:28,148 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:06:28,148 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:06:28,148 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:06:28,156 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:06:28" (1/1) ... [2023-11-29 05:06:28,165 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:06:28" (1/1) ... [2023-11-29 05:06:28,197 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 131 [2023-11-29 05:06:28,198 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:06:28,198 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:06:28,199 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:06:28,199 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:06:28,210 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:06:28" (1/1) ... [2023-11-29 05:06:28,211 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:06:28" (1/1) ... [2023-11-29 05:06:28,213 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:06:28" (1/1) ... [2023-11-29 05:06:28,229 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]. [2023-11-29 05:06:28,229 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:06:28" (1/1) ... [2023-11-29 05:06:28,229 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:06:28" (1/1) ... [2023-11-29 05:06:28,238 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:06:28" (1/1) ... [2023-11-29 05:06:28,243 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:06:28" (1/1) ... [2023-11-29 05:06:28,245 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:06:28" (1/1) ... [2023-11-29 05:06:28,247 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:06:28" (1/1) ... [2023-11-29 05:06:28,251 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:06:28,252 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:06:28,252 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:06:28,252 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:06:28,253 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:06:28" (1/1) ... [2023-11-29 05:06:28,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:06:28,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05bf9e10-6be9-4cc4-b542-2ae8294ab418/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:06:28,284 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05bf9e10-6be9-4cc4-b542-2ae8294ab418/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:06:28,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05bf9e10-6be9-4cc4-b542-2ae8294ab418/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:06:28,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:06:28,313 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 05:06:28,313 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 05:06:28,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 05:06:28,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:06:28,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:06:28,390 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:06:28,392 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:06:28,646 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:06:28,690 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:06:28,690 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 05:06:28,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:06:28 BoogieIcfgContainer [2023-11-29 05:06:28,691 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:06:28,693 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:06:28,694 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:06:28,697 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:06:28,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:06:27" (1/3) ... [2023-11-29 05:06:28,698 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@201a234a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:06:28, skipping insertion in model container [2023-11-29 05:06:28,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:06:28" (2/3) ... [2023-11-29 05:06:28,699 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@201a234a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:06:28, skipping insertion in model container [2023-11-29 05:06:28,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:06:28" (3/3) ... [2023-11-29 05:06:28,700 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-48.i [2023-11-29 05:06:28,716 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:06:28,716 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 05:06:28,761 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:06:28,766 INFO L357 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, mHoare=true, 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;@4e35fbcd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:06:28,767 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 05:06:28,770 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-29 05:06:28,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-11-29 05:06:28,784 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:06:28,785 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:06:28,785 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:06:28,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:06:28,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1515844644, now seen corresponding path program 1 times [2023-11-29 05:06:28,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:06:28,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139337375] [2023-11-29 05:06:28,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:06:28,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:06:28,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:29,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:06:29,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:29,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:06:29,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:29,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:06:29,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:29,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:06:29,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:29,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:06:29,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:29,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:06:29,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:29,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:06:29,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:29,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 05:06:29,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:29,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:06:29,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:29,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-29 05:06:29,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:29,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 05:06:29,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:29,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 05:06:29,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:29,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 05:06:29,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:29,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 05:06:29,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:29,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 05:06:29,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:29,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 05:06:29,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:29,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:06:29,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:29,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:06:29,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:29,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-29 05:06:29,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:29,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 05:06:29,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:29,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-11-29 05:06:29,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:29,172 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-11-29 05:06:29,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:06:29,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139337375] [2023-11-29 05:06:29,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139337375] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:06:29,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:06:29,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:06:29,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982693702] [2023-11-29 05:06:29,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:06:29,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 05:06:29,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:06:29,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 05:06:29,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 05:06:29,216 INFO L87 Difference]: Start difference. First operand has 53 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-29 05:06:29,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:06:29,259 INFO L93 Difference]: Finished difference Result 103 states and 181 transitions. [2023-11-29 05:06:29,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 05:06:29,262 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 127 [2023-11-29 05:06:29,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:06:29,270 INFO L225 Difference]: With dead ends: 103 [2023-11-29 05:06:29,270 INFO L226 Difference]: Without dead ends: 51 [2023-11-29 05:06:29,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 05:06:29,278 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:06:29,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:06:29,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-11-29 05:06:29,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-11-29 05:06:29,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-29 05:06:29,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 75 transitions. [2023-11-29 05:06:29,324 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 75 transitions. Word has length 127 [2023-11-29 05:06:29,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:06:29,325 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 75 transitions. [2023-11-29 05:06:29,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-29 05:06:29,325 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 75 transitions. [2023-11-29 05:06:29,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-11-29 05:06:29,329 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:06:29,330 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:06:29,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 05:06:29,330 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:06:29,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:06:29,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1581866322, now seen corresponding path program 1 times [2023-11-29 05:06:29,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:06:29,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768574018] [2023-11-29 05:06:29,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:06:29,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:06:29,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:29,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:06:29,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:29,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:06:29,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:29,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:06:29,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:29,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:06:29,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:29,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:06:29,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:29,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:06:29,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:29,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:06:29,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:29,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 05:06:29,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:29,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:06:29,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:29,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-29 05:06:29,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:29,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 05:06:29,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:29,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 05:06:29,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:29,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 05:06:29,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:29,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 05:06:29,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:29,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 05:06:29,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:29,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 05:06:29,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:29,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:06:29,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:29,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:06:29,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:29,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-29 05:06:29,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:29,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 05:06:29,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:29,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-11-29 05:06:29,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:29,757 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-11-29 05:06:29,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:06:29,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768574018] [2023-11-29 05:06:29,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768574018] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:06:29,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:06:29,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:06:29,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201743960] [2023-11-29 05:06:29,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:06:29,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:06:29,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:06:29,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:06:29,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:06:29,762 INFO L87 Difference]: Start difference. First operand 51 states and 75 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-29 05:06:29,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:06:29,796 INFO L93 Difference]: Finished difference Result 101 states and 149 transitions. [2023-11-29 05:06:29,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:06:29,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 127 [2023-11-29 05:06:29,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:06:29,799 INFO L225 Difference]: With dead ends: 101 [2023-11-29 05:06:29,799 INFO L226 Difference]: Without dead ends: 51 [2023-11-29 05:06:29,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:06:29,802 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 4 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:06:29,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 133 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:06:29,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-11-29 05:06:29,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-11-29 05:06:29,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-29 05:06:29,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 74 transitions. [2023-11-29 05:06:29,815 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 74 transitions. Word has length 127 [2023-11-29 05:06:29,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:06:29,817 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 74 transitions. [2023-11-29 05:06:29,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-29 05:06:29,817 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 74 transitions. [2023-11-29 05:06:29,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-11-29 05:06:29,820 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:06:29,820 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:06:29,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 05:06:29,821 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:06:29,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:06:29,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1580019280, now seen corresponding path program 1 times [2023-11-29 05:06:29,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:06:29,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822944267] [2023-11-29 05:06:29,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:06:29,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:06:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:06:29,902 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:06:29,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:06:30,001 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:06:30,001 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 05:06:30,002 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 05:06:30,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 05:06:30,008 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-29 05:06:30,012 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 05:06:30,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 05:06:30 BoogieIcfgContainer [2023-11-29 05:06:30,088 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 05:06:30,088 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 05:06:30,089 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 05:06:30,089 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 05:06:30,089 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:06:28" (3/4) ... [2023-11-29 05:06:30,092 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 05:06:30,093 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 05:06:30,094 INFO L158 Benchmark]: Toolchain (without parser) took 2209.20ms. Allocated memory was 157.3MB in the beginning and 203.4MB in the end (delta: 46.1MB). Free memory was 118.5MB in the beginning and 159.8MB in the end (delta: -41.3MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. [2023-11-29 05:06:30,094 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 157.3MB. Free memory was 128.0MB in the beginning and 128.0MB in the end (delta: 29.1kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:06:30,095 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.65ms. Allocated memory is still 157.3MB. Free memory was 117.8MB in the beginning and 105.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 05:06:30,095 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.70ms. Allocated memory is still 157.3MB. Free memory was 105.2MB in the beginning and 102.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 05:06:30,096 INFO L158 Benchmark]: Boogie Preprocessor took 52.69ms. Allocated memory is still 157.3MB. Free memory was 102.3MB in the beginning and 97.5MB in the end (delta: 4.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-29 05:06:30,096 INFO L158 Benchmark]: RCFGBuilder took 438.90ms. Allocated memory is still 157.3MB. Free memory was 97.5MB in the beginning and 77.3MB in the end (delta: 20.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-29 05:06:30,097 INFO L158 Benchmark]: TraceAbstraction took 1394.54ms. Allocated memory was 157.3MB in the beginning and 203.4MB in the end (delta: 46.1MB). Free memory was 76.5MB in the beginning and 159.8MB in the end (delta: -83.2MB). Peak memory consumption was 36.9MB. Max. memory is 16.1GB. [2023-11-29 05:06:30,097 INFO L158 Benchmark]: Witness Printer took 4.32ms. Allocated memory is still 203.4MB. Free memory is still 159.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:06:30,100 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 157.3MB. Free memory was 128.0MB in the beginning and 128.0MB in the end (delta: 29.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 262.65ms. Allocated memory is still 157.3MB. Free memory was 117.8MB in the beginning and 105.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.70ms. Allocated memory is still 157.3MB. Free memory was 105.2MB in the beginning and 102.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.69ms. Allocated memory is still 157.3MB. Free memory was 102.3MB in the beginning and 97.5MB in the end (delta: 4.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 438.90ms. Allocated memory is still 157.3MB. Free memory was 97.5MB in the beginning and 77.3MB in the end (delta: 20.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1394.54ms. Allocated memory was 157.3MB in the beginning and 203.4MB in the end (delta: 46.1MB). Free memory was 76.5MB in the beginning and 159.8MB in the end (delta: -83.2MB). Peak memory consumption was 36.9MB. Max. memory is 16.1GB. * Witness Printer took 4.32ms. Allocated memory is still 203.4MB. Free memory is still 159.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 111. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 32.8; [L23] float var_1_2 = 255.675; [L24] float var_1_3 = 5.5; [L25] float var_1_4 = 128.75; [L26] float var_1_5 = 4.5; [L27] float var_1_6 = 9.25; [L28] unsigned char var_1_7 = 5; [L29] unsigned char var_1_11 = 200; [L30] unsigned char var_1_12 = 8; [L31] unsigned char var_1_13 = 4; [L32] unsigned char var_1_14 = 100; [L33] unsigned char var_1_15 = 64; [L34] unsigned char var_1_16 = 1; [L35] unsigned char var_1_17 = 200; [L36] unsigned char var_1_18 = 2; [L37] unsigned char var_1_19 = 0; [L38] unsigned long int var_1_20 = 1; [L39] signed long int var_1_21 = 64; [L40] unsigned char var_1_22 = 100; [L41] unsigned char last_1_var_1_7 = 5; [L115] isInitial = 1 [L116] FCALL initially() [L117] COND TRUE 1 [L118] CALL updateLastVariables() [L108] last_1_var_1_7 = var_1_7 [L118] RET updateLastVariables() [L119] CALL updateVariables() [L72] var_1_2 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=11/2, var_1_4=515/4, var_1_5=9/2, var_1_6=37/4, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=11/2, var_1_4=515/4, var_1_5=9/2, var_1_6=37/4, var_1_7=5] [L73] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=11/2, var_1_4=515/4, var_1_5=9/2, var_1_6=37/4, var_1_7=5] [L74] var_1_3 = __VERIFIER_nondet_float() [L75] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_4=515/4, var_1_5=9/2, var_1_6=37/4, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_4=515/4, var_1_5=9/2, var_1_6=37/4, var_1_7=5] [L75] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_4=515/4, var_1_5=9/2, var_1_6=37/4, var_1_7=5] [L76] var_1_4 = __VERIFIER_nondet_float() [L77] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_5=9/2, var_1_6=37/4, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_5=9/2, var_1_6=37/4, var_1_7=5] [L77] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_5=9/2, var_1_6=37/4, var_1_7=5] [L78] var_1_5 = __VERIFIER_nondet_float() [L79] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_6=37/4, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_6=37/4, var_1_7=5] [L79] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_6=37/4, var_1_7=5] [L80] var_1_6 = __VERIFIER_nondet_float() [L81] CALL assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L81] RET assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L82] var_1_11 = __VERIFIER_nondet_uchar() [L83] CALL assume_abort_if_not(var_1_11 >= 190) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=190, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=5, var_1_11=190, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L83] RET assume_abort_if_not(var_1_11 >= 190) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=190, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L84] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=190, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=5, var_1_11=190, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L84] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=190, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L85] var_1_12 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=190, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=5, var_1_11=190, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L86] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=190, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L87] CALL assume_abort_if_not(var_1_12 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=190, var_1_12=63, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=5, var_1_11=190, var_1_12=63, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L87] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=190, var_1_12=63, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L88] var_1_13 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=190, var_1_12=63, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=5, var_1_11=190, var_1_12=63, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L89] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=190, var_1_12=63, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L90] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=190, var_1_12=63, var_1_13=127, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=5, var_1_11=190, var_1_12=63, var_1_13=127, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L90] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=190, var_1_12=63, var_1_13=127, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L91] var_1_14 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_14 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=190, var_1_12=63, var_1_13=127, var_1_14=127, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=5, var_1_11=190, var_1_12=63, var_1_13=127, var_1_14=127, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L92] RET assume_abort_if_not(var_1_14 >= 63) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=190, var_1_12=63, var_1_13=127, var_1_14=127, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L93] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=190, var_1_12=63, var_1_13=127, var_1_14=127, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=5, var_1_11=190, var_1_12=63, var_1_13=127, var_1_14=127, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L93] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=190, var_1_12=63, var_1_13=127, var_1_14=127, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L94] var_1_15 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_15 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=190, var_1_12=63, var_1_13=127, var_1_14=127, var_1_15=126, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=5, var_1_11=190, var_1_12=63, var_1_13=127, var_1_14=127, var_1_15=126, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L95] RET assume_abort_if_not(var_1_15 >= 63) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=190, var_1_12=63, var_1_13=127, var_1_14=127, var_1_15=126, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L96] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=190, var_1_12=63, var_1_13=127, var_1_14=127, var_1_15=126, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=5, var_1_11=190, var_1_12=63, var_1_13=127, var_1_14=127, var_1_15=126, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L96] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=190, var_1_12=63, var_1_13=127, var_1_14=127, var_1_15=126, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L97] var_1_17 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_17 >= 191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=190, var_1_12=63, var_1_13=127, var_1_14=127, var_1_15=126, var_1_16=1, var_1_17=191, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=5, var_1_11=190, var_1_12=63, var_1_13=127, var_1_14=127, var_1_15=126, var_1_16=1, var_1_17=191, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L98] RET assume_abort_if_not(var_1_17 >= 191) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=190, var_1_12=63, var_1_13=127, var_1_14=127, var_1_15=126, var_1_16=1, var_1_17=191, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L99] CALL assume_abort_if_not(var_1_17 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=190, var_1_12=63, var_1_13=127, var_1_14=127, var_1_15=126, var_1_16=1, var_1_17=191, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=5, var_1_11=190, var_1_12=63, var_1_13=127, var_1_14=127, var_1_15=126, var_1_16=1, var_1_17=191, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L99] RET assume_abort_if_not(var_1_17 <= 255) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=190, var_1_12=63, var_1_13=127, var_1_14=127, var_1_15=126, var_1_16=1, var_1_17=191, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L100] var_1_18 = __VERIFIER_nondet_uchar() [L101] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=190, var_1_12=63, var_1_13=127, var_1_14=127, var_1_15=126, var_1_16=1, var_1_17=191, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=5, var_1_11=190, var_1_12=63, var_1_13=127, var_1_14=127, var_1_15=126, var_1_16=1, var_1_17=191, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L101] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=190, var_1_12=63, var_1_13=127, var_1_14=127, var_1_15=126, var_1_16=1, var_1_17=191, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L102] CALL assume_abort_if_not(var_1_18 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=190, var_1_12=63, var_1_13=127, var_1_14=127, var_1_15=126, var_1_16=1, var_1_17=191, var_1_18=63, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=5, var_1_11=190, var_1_12=63, var_1_13=127, var_1_14=127, var_1_15=126, var_1_16=1, var_1_17=191, var_1_18=63, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L102] RET assume_abort_if_not(var_1_18 <= 63) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=190, var_1_12=63, var_1_13=127, var_1_14=127, var_1_15=126, var_1_16=1, var_1_17=191, var_1_18=63, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L103] var_1_19 = __VERIFIER_nondet_uchar() [L104] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=190, var_1_12=63, var_1_13=127, var_1_14=127, var_1_15=126, var_1_16=1, var_1_17=191, var_1_18=63, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=5, var_1_11=190, var_1_12=63, var_1_13=127, var_1_14=127, var_1_15=126, var_1_16=1, var_1_17=191, var_1_18=63, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L104] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=190, var_1_12=63, var_1_13=127, var_1_14=127, var_1_15=126, var_1_16=1, var_1_17=191, var_1_18=63, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L105] CALL assume_abort_if_not(var_1_19 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=190, var_1_12=63, var_1_13=127, var_1_14=127, var_1_15=126, var_1_16=1, var_1_17=191, var_1_18=63, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=5, var_1_11=190, var_1_12=63, var_1_13=127, var_1_14=127, var_1_15=126, var_1_16=1, var_1_17=191, var_1_18=63, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L105] RET assume_abort_if_not(var_1_19 <= 0) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=190, var_1_12=63, var_1_13=127, var_1_14=127, var_1_15=126, var_1_16=1, var_1_17=191, var_1_18=63, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L119] RET updateVariables() [L120] CALL step() [L45] COND FALSE !(var_1_2 <= var_1_3) [L52] var_1_1 = var_1_6 VAL [isInitial=1, last_1_var_1_7=5, var_1_11=190, var_1_12=63, var_1_13=127, var_1_14=127, var_1_15=126, var_1_16=1, var_1_17=191, var_1_18=63, var_1_19=0, var_1_1=260, var_1_20=1, var_1_21=64, var_1_22=100, var_1_6=260, var_1_7=5] [L54] var_1_20 = var_1_14 [L55] var_1_21 = var_1_17 [L56] var_1_22 = 4 [L57] signed long int stepLocal_0 = var_1_21; VAL [isInitial=1, last_1_var_1_7=5, stepLocal_0=191, var_1_11=190, var_1_12=63, var_1_13=127, var_1_14=127, var_1_15=126, var_1_16=1, var_1_17=191, var_1_18=63, var_1_19=0, var_1_1=260, var_1_20=127, var_1_21=191, var_1_22=4, var_1_6=260, var_1_7=5] [L58] COND FALSE !(((var_1_17 - var_1_12) - (8 + var_1_18)) > stepLocal_0) [L61] var_1_16 = var_1_19 VAL [isInitial=1, last_1_var_1_7=5, stepLocal_0=191, var_1_11=190, var_1_12=63, var_1_13=127, var_1_14=127, var_1_15=126, var_1_16=0, var_1_17=191, var_1_18=63, var_1_19=0, var_1_1=260, var_1_20=127, var_1_21=191, var_1_22=4, var_1_6=260, var_1_7=5] [L63] COND FALSE !(\read(var_1_16)) VAL [isInitial=1, last_1_var_1_7=5, stepLocal_0=191, var_1_11=190, var_1_12=63, var_1_13=127, var_1_14=127, var_1_15=126, var_1_16=0, var_1_17=191, var_1_18=63, var_1_19=0, var_1_1=260, var_1_20=127, var_1_21=191, var_1_22=4, var_1_6=260, var_1_7=5] [L120] RET step() [L121] CALL, EXPR property() [L111-L112] return ((((((var_1_2 <= var_1_3) ? ((var_1_3 < ((var_1_4 - var_1_5) + 1.395f)) ? (var_1_1 == ((float) var_1_6)) : (var_1_1 == ((float) var_1_6))) : (var_1_1 == ((float) var_1_6))) && (var_1_16 ? ((last_1_var_1_7 != last_1_var_1_7) ? (var_1_7 == ((unsigned char) ((var_1_11 - var_1_12) - var_1_13))) : (var_1_7 == ((unsigned char) (var_1_11 - (((((var_1_14) > (var_1_15)) ? (var_1_14) : (var_1_15))) - var_1_12))))) : 1)) && ((((var_1_17 - var_1_12) - (8 + var_1_18)) > var_1_21) ? (var_1_16 == ((unsigned char) (! var_1_19))) : (var_1_16 == ((unsigned char) var_1_19)))) && (var_1_20 == ((unsigned long int) var_1_14))) && (var_1_21 == ((signed long int) var_1_17))) && (var_1_22 == ((unsigned char) 4)) ; [L121] RET, EXPR property() [L121] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_7=5, var_1_11=190, var_1_12=63, var_1_13=127, var_1_14=127, var_1_15=126, var_1_16=0, var_1_17=191, var_1_18=63, var_1_19=0, var_1_1=260, var_1_20=127, var_1_21=191, var_1_22=4, var_1_6=260, var_1_7=5] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_7=5, var_1_11=190, var_1_12=63, var_1_13=127, var_1_14=127, var_1_15=126, var_1_16=0, var_1_17=191, var_1_18=63, var_1_19=0, var_1_1=260, var_1_20=127, var_1_21=191, var_1_22=4, var_1_6=260, var_1_7=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 53 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 3, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4 mSDsluCounter, 205 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 63 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13 IncrementalHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 142 mSDtfsCounter, 13 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 381 NumberOfCodeBlocks, 381 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 252 ConstructedInterpolants, 0 QuantifiedInterpolants, 264 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 1680/1680 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 [2023-11-29 05:06:30,124 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05bf9e10-6be9-4cc4-b542-2ae8294ab418/bin/uautomizer-verify-BQ2R08f2Ya/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/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05bf9e10-6be9-4cc4-b542-2ae8294ab418/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05bf9e10-6be9-4cc4-b542-2ae8294ab418/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05bf9e10-6be9-4cc4-b542-2ae8294ab418/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05bf9e10-6be9-4cc4-b542-2ae8294ab418/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-48.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05bf9e10-6be9-4cc4-b542-2ae8294ab418/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05bf9e10-6be9-4cc4-b542-2ae8294ab418/bin/uautomizer-verify-BQ2R08f2Ya --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 c6d412f41e33ad776ddd1099cb1079697e2761edfdecb4fbe189cb4f98c9e06c --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:06:32,054 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:06:32,121 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05bf9e10-6be9-4cc4-b542-2ae8294ab418/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 05:06:32,137 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:06:32,138 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:06:32,166 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:06:32,167 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:06:32,167 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:06:32,168 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:06:32,168 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:06:32,169 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:06:32,169 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:06:32,170 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:06:32,171 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:06:32,171 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:06:32,172 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:06:32,173 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 05:06:32,173 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:06:32,174 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:06:32,174 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:06:32,174 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 05:06:32,175 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:06:32,175 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 05:06:32,176 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 05:06:32,176 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 05:06:32,177 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 05:06:32,177 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:06:32,178 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 05:06:32,178 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:06:32,178 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:06:32,179 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:06:32,179 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:06:32,179 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:06:32,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:06:32,180 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:06:32,180 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:06:32,180 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 05:06:32,180 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 05:06:32,181 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 05:06:32,181 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:06:32,181 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:06:32,181 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 05:06:32,182 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:06:32,182 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:06:32,182 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 05:06:32,182 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05bf9e10-6be9-4cc4-b542-2ae8294ab418/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_05bf9e10-6be9-4cc4-b542-2ae8294ab418/bin/uautomizer-verify-BQ2R08f2Ya 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 -> c6d412f41e33ad776ddd1099cb1079697e2761edfdecb4fbe189cb4f98c9e06c [2023-11-29 05:06:32,459 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:06:32,479 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:06:32,482 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:06:32,483 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:06:32,484 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:06:32,485 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05bf9e10-6be9-4cc4-b542-2ae8294ab418/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-48.i [2023-11-29 05:06:35,286 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:06:35,492 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:06:35,492 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05bf9e10-6be9-4cc4-b542-2ae8294ab418/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-48.i [2023-11-29 05:06:35,501 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05bf9e10-6be9-4cc4-b542-2ae8294ab418/bin/uautomizer-verify-BQ2R08f2Ya/data/69b41a67e/b526db5f1f0240c1ad405a90d3eeeb26/FLAG789702752 [2023-11-29 05:06:35,513 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05bf9e10-6be9-4cc4-b542-2ae8294ab418/bin/uautomizer-verify-BQ2R08f2Ya/data/69b41a67e/b526db5f1f0240c1ad405a90d3eeeb26 [2023-11-29 05:06:35,515 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:06:35,517 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:06:35,518 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:06:35,518 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:06:35,522 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:06:35,523 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:06:35" (1/1) ... [2023-11-29 05:06:35,524 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e9e9be2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:06:35, skipping insertion in model container [2023-11-29 05:06:35,524 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:06:35" (1/1) ... [2023-11-29 05:06:35,549 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:06:35,677 WARN L240 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_05bf9e10-6be9-4cc4-b542-2ae8294ab418/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-48.i[917,930] [2023-11-29 05:06:35,722 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:06:35,739 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:06:35,750 WARN L240 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_05bf9e10-6be9-4cc4-b542-2ae8294ab418/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-48.i[917,930] [2023-11-29 05:06:35,775 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:06:35,793 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:06:35,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:06:35 WrapperNode [2023-11-29 05:06:35,794 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:06:35,795 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:06:35,795 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:06:35,795 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:06:35,801 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:06:35" (1/1) ... [2023-11-29 05:06:35,813 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:06:35" (1/1) ... [2023-11-29 05:06:35,839 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 131 [2023-11-29 05:06:35,840 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:06:35,841 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:06:35,841 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:06:35,841 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:06:35,850 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:06:35" (1/1) ... [2023-11-29 05:06:35,850 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:06:35" (1/1) ... [2023-11-29 05:06:35,855 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:06:35" (1/1) ... [2023-11-29 05:06:35,870 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]. [2023-11-29 05:06:35,870 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:06:35" (1/1) ... [2023-11-29 05:06:35,871 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:06:35" (1/1) ... [2023-11-29 05:06:35,881 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:06:35" (1/1) ... [2023-11-29 05:06:35,885 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:06:35" (1/1) ... [2023-11-29 05:06:35,888 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:06:35" (1/1) ... [2023-11-29 05:06:35,890 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:06:35" (1/1) ... [2023-11-29 05:06:35,894 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:06:35,895 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:06:35,895 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:06:35,895 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:06:35,896 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:06:35" (1/1) ... [2023-11-29 05:06:35,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:06:35,911 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05bf9e10-6be9-4cc4-b542-2ae8294ab418/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:06:35,922 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05bf9e10-6be9-4cc4-b542-2ae8294ab418/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:06:35,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05bf9e10-6be9-4cc4-b542-2ae8294ab418/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:06:35,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:06:35,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 05:06:35,991 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 05:06:35,991 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 05:06:35,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:06:35,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:06:36,085 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:06:36,088 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:06:36,867 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:06:36,918 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:06:36,919 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 05:06:36,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:06:36 BoogieIcfgContainer [2023-11-29 05:06:36,919 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:06:36,922 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:06:36,922 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:06:36,925 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:06:36,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:06:35" (1/3) ... [2023-11-29 05:06:36,926 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8493349 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:06:36, skipping insertion in model container [2023-11-29 05:06:36,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:06:35" (2/3) ... [2023-11-29 05:06:36,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8493349 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:06:36, skipping insertion in model container [2023-11-29 05:06:36,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:06:36" (3/3) ... [2023-11-29 05:06:36,928 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-48.i [2023-11-29 05:06:36,946 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:06:36,947 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 05:06:36,992 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:06:36,998 INFO L357 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, mHoare=true, 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;@6f1722c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:06:36,998 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 05:06:37,002 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-29 05:06:37,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-11-29 05:06:37,017 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:06:37,017 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:06:37,018 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:06:37,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:06:37,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1515844644, now seen corresponding path program 1 times [2023-11-29 05:06:37,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:06:37,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [721732167] [2023-11-29 05:06:37,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:06:37,039 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 [2023-11-29 05:06:37,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05bf9e10-6be9-4cc4-b542-2ae8294ab418/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:06:37,041 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05bf9e10-6be9-4cc4-b542-2ae8294ab418/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 05:06:37,042 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05bf9e10-6be9-4cc4-b542-2ae8294ab418/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 05:06:37,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:37,272 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 05:06:37,283 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:06:37,325 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 440 proven. 0 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2023-11-29 05:06:37,326 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:06:37,326 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:06:37,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [721732167] [2023-11-29 05:06:37,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [721732167] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:06:37,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:06:37,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:06:37,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627524998] [2023-11-29 05:06:37,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:06:37,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 05:06:37,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:06:37,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 05:06:37,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 05:06:37,363 INFO L87 Difference]: Start difference. First operand has 53 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-29 05:06:37,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:06:37,407 INFO L93 Difference]: Finished difference Result 103 states and 181 transitions. [2023-11-29 05:06:37,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 05:06:37,410 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 127 [2023-11-29 05:06:37,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:06:37,416 INFO L225 Difference]: With dead ends: 103 [2023-11-29 05:06:37,417 INFO L226 Difference]: Without dead ends: 51 [2023-11-29 05:06:37,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 05:06:37,423 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:06:37,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:06:37,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-11-29 05:06:37,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-11-29 05:06:37,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-29 05:06:37,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 75 transitions. [2023-11-29 05:06:37,466 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 75 transitions. Word has length 127 [2023-11-29 05:06:37,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:06:37,467 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 75 transitions. [2023-11-29 05:06:37,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-29 05:06:37,467 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 75 transitions. [2023-11-29 05:06:37,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-11-29 05:06:37,471 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:06:37,471 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:06:37,479 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05bf9e10-6be9-4cc4-b542-2ae8294ab418/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 05:06:37,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05bf9e10-6be9-4cc4-b542-2ae8294ab418/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 05:06:37,675 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:06:37,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:06:37,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1581866322, now seen corresponding path program 1 times [2023-11-29 05:06:37,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:06:37,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [151712555] [2023-11-29 05:06:37,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:06:37,677 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 [2023-11-29 05:06:37,677 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05bf9e10-6be9-4cc4-b542-2ae8294ab418/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:06:37,679 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05bf9e10-6be9-4cc4-b542-2ae8294ab418/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 05:06:37,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05bf9e10-6be9-4cc4-b542-2ae8294ab418/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 05:06:37,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:37,879 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 05:06:37,892 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:06:38,031 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2023-11-29 05:06:38,031 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:06:38,031 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:06:38,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [151712555] [2023-11-29 05:06:38,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [151712555] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:06:38,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:06:38,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:06:38,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899213188] [2023-11-29 05:06:38,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:06:38,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:06:38,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:06:38,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:06:38,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:06:38,036 INFO L87 Difference]: Start difference. First operand 51 states and 75 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-29 05:06:38,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:06:38,699 INFO L93 Difference]: Finished difference Result 167 states and 237 transitions. [2023-11-29 05:06:38,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 05:06:38,701 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) Word has length 127 [2023-11-29 05:06:38,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:06:38,704 INFO L225 Difference]: With dead ends: 167 [2023-11-29 05:06:38,705 INFO L226 Difference]: Without dead ends: 117 [2023-11-29 05:06:38,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2023-11-29 05:06:38,707 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 119 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:06:38,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 154 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 05:06:38,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-11-29 05:06:38,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 56. [2023-11-29 05:06:38,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-29 05:06:38,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 79 transitions. [2023-11-29 05:06:38,731 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 79 transitions. Word has length 127 [2023-11-29 05:06:38,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:06:38,732 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 79 transitions. [2023-11-29 05:06:38,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-29 05:06:38,732 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 79 transitions. [2023-11-29 05:06:38,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-11-29 05:06:38,735 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:06:38,735 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:06:38,741 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05bf9e10-6be9-4cc4-b542-2ae8294ab418/bin/uautomizer-verify-BQ2R08f2Ya/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)] Forceful destruction successful, exit code 0 [2023-11-29 05:06:38,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05bf9e10-6be9-4cc4-b542-2ae8294ab418/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 05:06:38,939 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:06:38,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:06:38,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1580019280, now seen corresponding path program 1 times [2023-11-29 05:06:38,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:06:38,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1578549595] [2023-11-29 05:06:38,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:06:38,941 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 [2023-11-29 05:06:38,941 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05bf9e10-6be9-4cc4-b542-2ae8294ab418/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:06:38,942 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05bf9e10-6be9-4cc4-b542-2ae8294ab418/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 05:06:38,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05bf9e10-6be9-4cc4-b542-2ae8294ab418/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 05:06:39,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:39,161 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-29 05:06:39,170 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:07:10,953 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 365 proven. 359 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2023-11-29 05:07:10,953 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:07:46,249 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 69 proven. 48 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2023-11-29 05:07:46,249 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:07:46,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1578549595] [2023-11-29 05:07:46,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1578549595] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:07:46,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:07:46,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12] total 32 [2023-11-29 05:07:46,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210164662] [2023-11-29 05:07:46,250 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:07:46,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-11-29 05:07:46,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:07:46,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-11-29 05:07:46,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=762, Unknown=0, NotChecked=0, Total=992 [2023-11-29 05:07:46,254 INFO L87 Difference]: Start difference. First operand 56 states and 79 transitions. Second operand has 32 states, 32 states have (on average 2.5625) internal successors, (82), 32 states have internal predecessors, (82), 7 states have call successors, (42), 6 states have call predecessors, (42), 13 states have return successors, (42), 9 states have call predecessors, (42), 7 states have call successors, (42) [2023-11-29 05:07:54,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:07:54,701 INFO L93 Difference]: Finished difference Result 144 states and 190 transitions. [2023-11-29 05:07:54,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-11-29 05:07:54,702 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.5625) internal successors, (82), 32 states have internal predecessors, (82), 7 states have call successors, (42), 6 states have call predecessors, (42), 13 states have return successors, (42), 9 states have call predecessors, (42), 7 states have call successors, (42) Word has length 127 [2023-11-29 05:07:54,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:07:54,703 INFO L225 Difference]: With dead ends: 144 [2023-11-29 05:07:54,703 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 05:07:54,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1011 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=979, Invalid=3053, Unknown=0, NotChecked=0, Total=4032 [2023-11-29 05:07:54,707 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 141 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:07:54,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 212 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2023-11-29 05:07:54,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 05:07:54,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 05:07:54,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:54,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 05:07:54,709 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 127 [2023-11-29 05:07:54,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:07:54,709 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 05:07:54,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.5625) internal successors, (82), 32 states have internal predecessors, (82), 7 states have call successors, (42), 6 states have call predecessors, (42), 13 states have return successors, (42), 9 states have call predecessors, (42), 7 states have call successors, (42) [2023-11-29 05:07:54,709 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 05:07:54,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 05:07:54,711 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 05:07:54,718 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05bf9e10-6be9-4cc4-b542-2ae8294ab418/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 05:07:54,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05bf9e10-6be9-4cc4-b542-2ae8294ab418/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 05:07:54,914 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 05:07:56,969 INFO L899 garLoopResultBuilder]: For program point L64(lines 64 68) no Hoare annotation was computed. [2023-11-29 05:07:56,970 INFO L899 garLoopResultBuilder]: For program point L93(line 93) no Hoare annotation was computed. [2023-11-29 05:07:56,970 INFO L895 garLoopResultBuilder]: At program point L89(line 89) the Hoare annotation is: (and (bvsle ((_ zero_extend 24) ~var_1_19~0) (_ bv0 32)) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_6~0 .cse0) (fp.geq ~var_1_6~0 .cse1)) (and (fp.geq ~var_1_6~0 (fp.neg .cse0)) (fp.leq ~var_1_6~0 (fp.neg .cse1))))) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv63 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-29 05:07:56,970 INFO L895 garLoopResultBuilder]: At program point L89-1(line 89) the Hoare annotation is: (and (bvsle ((_ zero_extend 24) ~var_1_19~0) (_ bv0 32)) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_6~0 .cse0) (fp.geq ~var_1_6~0 .cse1)) (and (fp.geq ~var_1_6~0 (fp.neg .cse0)) (fp.leq ~var_1_6~0 (fp.neg .cse1))))) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv63 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-29 05:07:56,970 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-29 05:07:56,970 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-29 05:07:56,972 INFO L895 garLoopResultBuilder]: At program point L81(line 81) the Hoare annotation is: (and (bvsle ((_ zero_extend 24) ~var_1_19~0) (_ bv0 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-29 05:07:56,972 INFO L899 garLoopResultBuilder]: For program point L81-1(line 81) no Hoare annotation was computed. [2023-11-29 05:07:56,972 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-11-29 05:07:56,972 INFO L895 garLoopResultBuilder]: At program point L77(line 77) the Hoare annotation is: (and (bvsle ((_ zero_extend 24) ~var_1_19~0) (_ bv0 32)) (bvsge ((_ zero_extend 24) ~var_1_17~0) (_ bv191 32)) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_6~0 .cse0) (fp.geq ~var_1_6~0 .cse1)) (and (fp.geq ~var_1_6~0 (fp.neg .cse0)) (fp.leq ~var_1_6~0 (fp.neg .cse1))))) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv63 32)) (bvsle ((_ zero_extend 24) ~var_1_18~0) (_ bv63 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-29 05:07:56,973 INFO L899 garLoopResultBuilder]: For program point L77-1(line 77) no Hoare annotation was computed. [2023-11-29 05:07:56,973 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 70) no Hoare annotation was computed. [2023-11-29 05:07:56,973 INFO L895 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (and (bvsle ((_ zero_extend 24) ~var_1_19~0) (_ bv0 32)) (bvsge ((_ zero_extend 24) ~var_1_17~0) (_ bv191 32)) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_6~0 .cse0) (fp.geq ~var_1_6~0 .cse1)) (and (fp.geq ~var_1_6~0 (fp.neg .cse0)) (fp.leq ~var_1_6~0 (fp.neg .cse1))))) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv63 32)) (bvsle ((_ zero_extend 24) ~var_1_18~0) (_ bv63 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-29 05:07:56,973 INFO L899 garLoopResultBuilder]: For program point L73-1(line 73) no Hoare annotation was computed. [2023-11-29 05:07:56,973 INFO L899 garLoopResultBuilder]: For program point L102(line 102) no Hoare annotation was computed. [2023-11-29 05:07:56,973 INFO L895 garLoopResultBuilder]: At program point L98(line 98) the Hoare annotation is: (and (bvsle ((_ zero_extend 24) ~var_1_19~0) (_ bv0 32)) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_6~0 .cse0) (fp.geq ~var_1_6~0 .cse1)) (and (fp.geq ~var_1_6~0 (fp.neg .cse0)) (fp.leq ~var_1_6~0 (fp.neg .cse1))))) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv63 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-29 05:07:56,974 INFO L895 garLoopResultBuilder]: At program point L98-1(line 98) the Hoare annotation is: (and (bvsle ((_ zero_extend 24) ~var_1_19~0) (_ bv0 32)) (bvsge ((_ zero_extend 24) ~var_1_17~0) (_ bv191 32)) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_6~0 .cse0) (fp.geq ~var_1_6~0 .cse1)) (and (fp.geq ~var_1_6~0 (fp.neg .cse0)) (fp.leq ~var_1_6~0 (fp.neg .cse1))))) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv63 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-29 05:07:56,974 INFO L899 garLoopResultBuilder]: For program point L90(line 90) no Hoare annotation was computed. [2023-11-29 05:07:56,974 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-29 05:07:56,974 INFO L895 garLoopResultBuilder]: At program point L86(line 86) the Hoare annotation is: (and (bvsle ((_ zero_extend 24) ~var_1_19~0) (_ bv0 32)) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_6~0 .cse0) (fp.geq ~var_1_6~0 .cse1)) (and (fp.geq ~var_1_6~0 (fp.neg .cse0)) (fp.leq ~var_1_6~0 (fp.neg .cse1))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-29 05:07:56,974 INFO L895 garLoopResultBuilder]: At program point L86-1(line 86) the Hoare annotation is: (and (bvsle ((_ zero_extend 24) ~var_1_19~0) (_ bv0 32)) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_6~0 .cse0) (fp.geq ~var_1_6~0 .cse1)) (and (fp.geq ~var_1_6~0 (fp.neg .cse0)) (fp.leq ~var_1_6~0 (fp.neg .cse1))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-29 05:07:56,974 INFO L899 garLoopResultBuilder]: For program point L45(lines 45 53) no Hoare annotation was computed. [2023-11-29 05:07:56,975 INFO L899 garLoopResultBuilder]: For program point L45-1(lines 45 53) no Hoare annotation was computed. [2023-11-29 05:07:56,975 INFO L899 garLoopResultBuilder]: For program point L99(line 99) no Hoare annotation was computed. [2023-11-29 05:07:56,975 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 05:07:56,975 INFO L895 garLoopResultBuilder]: At program point L95(line 95) the Hoare annotation is: (and (bvsle ((_ zero_extend 24) ~var_1_19~0) (_ bv0 32)) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_6~0 .cse0) (fp.geq ~var_1_6~0 .cse1)) (and (fp.geq ~var_1_6~0 (fp.neg .cse0)) (fp.leq ~var_1_6~0 (fp.neg .cse1))))) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv63 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-29 05:07:56,975 INFO L895 garLoopResultBuilder]: At program point L95-1(line 95) the Hoare annotation is: (and (bvsle ((_ zero_extend 24) ~var_1_19~0) (_ bv0 32)) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_6~0 .cse0) (fp.geq ~var_1_6~0 .cse1)) (and (fp.geq ~var_1_6~0 (fp.neg .cse0)) (fp.leq ~var_1_6~0 (fp.neg .cse1))))) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv63 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-29 05:07:56,975 INFO L899 garLoopResultBuilder]: For program point L58(lines 58 62) no Hoare annotation was computed. [2023-11-29 05:07:56,975 INFO L899 garLoopResultBuilder]: For program point L58-2(lines 44 70) no Hoare annotation was computed. [2023-11-29 05:07:56,976 INFO L899 garLoopResultBuilder]: For program point L87(line 87) no Hoare annotation was computed. [2023-11-29 05:07:56,976 INFO L895 garLoopResultBuilder]: At program point L83(line 83) the Hoare annotation is: (and (bvsle ((_ zero_extend 24) ~var_1_19~0) (_ bv0 32)) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_6~0 .cse0) (fp.geq ~var_1_6~0 .cse1)) (and (fp.geq ~var_1_6~0 (fp.neg .cse0)) (fp.leq ~var_1_6~0 (fp.neg .cse1))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-29 05:07:56,976 INFO L895 garLoopResultBuilder]: At program point L83-1(line 83) the Hoare annotation is: (and (bvsle ((_ zero_extend 24) ~var_1_19~0) (_ bv0 32)) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_6~0 .cse0) (fp.geq ~var_1_6~0 .cse1)) (and (fp.geq ~var_1_6~0 (fp.neg .cse0)) (fp.leq ~var_1_6~0 (fp.neg .cse1))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-29 05:07:56,976 INFO L895 garLoopResultBuilder]: At program point L79(line 79) the Hoare annotation is: (and (bvsle ((_ zero_extend 24) ~var_1_19~0) (_ bv0 32)) (bvsge ((_ zero_extend 24) ~var_1_17~0) (_ bv191 32)) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_6~0 .cse0) (fp.geq ~var_1_6~0 .cse1)) (and (fp.geq ~var_1_6~0 (fp.neg .cse0)) (fp.leq ~var_1_6~0 (fp.neg .cse1))))) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv63 32)) (bvsle ((_ zero_extend 24) ~var_1_18~0) (_ bv63 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-29 05:07:56,976 INFO L899 garLoopResultBuilder]: For program point L79-1(line 79) no Hoare annotation was computed. [2023-11-29 05:07:56,976 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 50) no Hoare annotation was computed. [2023-11-29 05:07:56,977 INFO L895 garLoopResultBuilder]: At program point L75(line 75) the Hoare annotation is: (and (bvsle ((_ zero_extend 24) ~var_1_19~0) (_ bv0 32)) (bvsge ((_ zero_extend 24) ~var_1_17~0) (_ bv191 32)) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_6~0 .cse0) (fp.geq ~var_1_6~0 .cse1)) (and (fp.geq ~var_1_6~0 (fp.neg .cse0)) (fp.leq ~var_1_6~0 (fp.neg .cse1))))) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv63 32)) (bvsle ((_ zero_extend 24) ~var_1_18~0) (_ bv63 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-29 05:07:56,977 INFO L899 garLoopResultBuilder]: For program point L75-1(line 75) no Hoare annotation was computed. [2023-11-29 05:07:56,977 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 05:07:56,977 INFO L895 garLoopResultBuilder]: At program point L104(line 104) the Hoare annotation is: (and (bvsge ((_ zero_extend 24) ~var_1_17~0) (_ bv191 32)) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_6~0 .cse0) (fp.geq ~var_1_6~0 .cse1)) (and (fp.geq ~var_1_6~0 (fp.neg .cse0)) (fp.leq ~var_1_6~0 (fp.neg .cse1))))) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv63 32)) (bvsle ((_ zero_extend 24) ~var_1_18~0) (_ bv63 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-29 05:07:56,977 INFO L895 garLoopResultBuilder]: At program point L104-1(line 104) the Hoare annotation is: (and (bvsge ((_ zero_extend 24) ~var_1_17~0) (_ bv191 32)) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_6~0 .cse0) (fp.geq ~var_1_6~0 .cse1)) (and (fp.geq ~var_1_6~0 (fp.neg .cse0)) (fp.leq ~var_1_6~0 (fp.neg .cse1))))) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv63 32)) (bvsle ((_ zero_extend 24) ~var_1_18~0) (_ bv63 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-29 05:07:56,977 INFO L899 garLoopResultBuilder]: For program point L96(line 96) no Hoare annotation was computed. [2023-11-29 05:07:56,977 INFO L895 garLoopResultBuilder]: At program point L92(line 92) the Hoare annotation is: (and (bvsle ((_ zero_extend 24) ~var_1_19~0) (_ bv0 32)) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_6~0 .cse0) (fp.geq ~var_1_6~0 .cse1)) (and (fp.geq ~var_1_6~0 (fp.neg .cse0)) (fp.leq ~var_1_6~0 (fp.neg .cse1))))) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv63 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-29 05:07:56,978 INFO L895 garLoopResultBuilder]: At program point L92-1(line 92) the Hoare annotation is: (and (bvsle ((_ zero_extend 24) ~var_1_19~0) (_ bv0 32)) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_6~0 .cse0) (fp.geq ~var_1_6~0 .cse1)) (and (fp.geq ~var_1_6~0 (fp.neg .cse0)) (fp.leq ~var_1_6~0 (fp.neg .cse1))))) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv63 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-29 05:07:56,978 INFO L899 garLoopResultBuilder]: For program point L84(line 84) no Hoare annotation was computed. [2023-11-29 05:07:56,978 INFO L895 garLoopResultBuilder]: At program point L117-2(lines 117 123) the Hoare annotation is: (and (bvsle ((_ zero_extend 24) ~var_1_19~0) (_ bv0 32)) (bvsge ((_ zero_extend 24) ~var_1_17~0) (_ bv191 32)) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_6~0 .cse0) (fp.geq ~var_1_6~0 .cse1)) (and (fp.geq ~var_1_6~0 (fp.neg .cse0)) (fp.leq ~var_1_6~0 (fp.neg .cse1))))) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv63 32)) (bvsle ((_ zero_extend 24) ~var_1_18~0) (_ bv63 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-29 05:07:56,978 INFO L899 garLoopResultBuilder]: For program point L117-3(lines 117 123) no Hoare annotation was computed. [2023-11-29 05:07:56,978 INFO L899 garLoopResultBuilder]: For program point L105(lines 71 106) no Hoare annotation was computed. [2023-11-29 05:07:56,978 INFO L895 garLoopResultBuilder]: At program point L101(line 101) the Hoare annotation is: (and (bvsle ((_ zero_extend 24) ~var_1_19~0) (_ bv0 32)) (bvsge ((_ zero_extend 24) ~var_1_17~0) (_ bv191 32)) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_6~0 .cse0) (fp.geq ~var_1_6~0 .cse1)) (and (fp.geq ~var_1_6~0 (fp.neg .cse0)) (fp.leq ~var_1_6~0 (fp.neg .cse1))))) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv63 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-29 05:07:56,978 INFO L895 garLoopResultBuilder]: At program point L101-1(line 101) the Hoare annotation is: (and (bvsle ((_ zero_extend 24) ~var_1_19~0) (_ bv0 32)) (bvsge ((_ zero_extend 24) ~var_1_17~0) (_ bv191 32)) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_6~0 .cse0) (fp.geq ~var_1_6~0 .cse1)) (and (fp.geq ~var_1_6~0 (fp.neg .cse0)) (fp.leq ~var_1_6~0 (fp.neg .cse1))))) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv63 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-29 05:07:56,979 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-29 05:07:56,979 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-29 05:07:56,979 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-29 05:07:56,979 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-29 05:07:56,982 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-29 05:07:56,983 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 05:07:56,992 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-29 05:07:56,993 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-29 05:07:56,993 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-29 05:07:56,993 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-29 05:07:56,994 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-29 05:07:56,994 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 05:07:56 BoogieIcfgContainer [2023-11-29 05:07:56,994 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 05:07:56,995 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 05:07:56,995 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 05:07:56,995 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 05:07:56,995 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:06:36" (3/4) ... [2023-11-29 05:07:56,997 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 05:07:57,000 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-29 05:07:57,005 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2023-11-29 05:07:57,006 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2023-11-29 05:07:57,006 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 05:07:57,007 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 05:07:57,104 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05bf9e10-6be9-4cc4-b542-2ae8294ab418/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 05:07:57,105 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05bf9e10-6be9-4cc4-b542-2ae8294ab418/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 05:07:57,105 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 05:07:57,106 INFO L158 Benchmark]: Toolchain (without parser) took 81588.75ms. Allocated memory was 98.6MB in the beginning and 799.0MB in the end (delta: 700.4MB). Free memory was 74.9MB in the beginning and 758.2MB in the end (delta: -683.3MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. [2023-11-29 05:07:57,106 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 67.1MB. Free memory is still 43.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:07:57,107 INFO L158 Benchmark]: CACSL2BoogieTranslator took 276.16ms. Allocated memory is still 98.6MB. Free memory was 74.7MB in the beginning and 61.2MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 05:07:57,107 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.21ms. Allocated memory is still 98.6MB. Free memory was 61.2MB in the beginning and 59.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 05:07:57,107 INFO L158 Benchmark]: Boogie Preprocessor took 53.57ms. Allocated memory is still 98.6MB. Free memory was 59.1MB in the beginning and 56.3MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 05:07:57,108 INFO L158 Benchmark]: RCFGBuilder took 1024.42ms. Allocated memory is still 98.6MB. Free memory was 56.3MB in the beginning and 59.6MB in the end (delta: -3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 05:07:57,108 INFO L158 Benchmark]: TraceAbstraction took 80072.34ms. Allocated memory was 98.6MB in the beginning and 799.0MB in the end (delta: 700.4MB). Free memory was 58.9MB in the beginning and 764.4MB in the end (delta: -705.6MB). Peak memory consumption was 465.0MB. Max. memory is 16.1GB. [2023-11-29 05:07:57,109 INFO L158 Benchmark]: Witness Printer took 110.31ms. Allocated memory is still 799.0MB. Free memory was 764.4MB in the beginning and 758.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-29 05:07:57,111 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 67.1MB. Free memory is still 43.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 276.16ms. Allocated memory is still 98.6MB. Free memory was 74.7MB in the beginning and 61.2MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.21ms. Allocated memory is still 98.6MB. Free memory was 61.2MB in the beginning and 59.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.57ms. Allocated memory is still 98.6MB. Free memory was 59.1MB in the beginning and 56.3MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1024.42ms. Allocated memory is still 98.6MB. Free memory was 56.3MB in the beginning and 59.6MB in the end (delta: -3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * TraceAbstraction took 80072.34ms. Allocated memory was 98.6MB in the beginning and 799.0MB in the end (delta: 700.4MB). Free memory was 58.9MB in the beginning and 764.4MB in the end (delta: -705.6MB). Peak memory consumption was 465.0MB. Max. memory is 16.1GB. * Witness Printer took 110.31ms. Allocated memory is still 799.0MB. Free memory was 764.4MB in the beginning and 758.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated * 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 53 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 80.0s, OverallIterations: 3, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 281 SdHoareTripleChecker+Valid, 4.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 260 mSDsluCounter, 438 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 267 mSDsCounter, 265 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 826 IncrementalHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 265 mSolverCounterUnsat, 171 mSDtfsCounter, 826 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 551 GetRequests, 474 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1062 ImplicationChecksByTransitivity, 10.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=2, InterpolantAutomatonStates: 55, 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, 3 MinimizatonAttempts, 61 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 110 PreInvPairs, 137 NumberOfFragments, 830 HoareAnnotationTreeSize, 110 FomulaSimplifications, 987 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 23 FomulaSimplificationsInter, 3840 FormulaSimplificationTreeSizeReductionInter, 2.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 67.3s InterpolantComputationTime, 381 NumberOfCodeBlocks, 381 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 504 ConstructedInterpolants, 9 QuantifiedInterpolants, 8417 SizeOfPredicates, 35 NumberOfNonLiveVariables, 630 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 2953/3360 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: ((((var_1_19 <= 0) && (var_1_17 >= 191)) && (var_1_12 <= 63)) && (var_1_18 <= 63)) RESULT: Ultimate proved your program to be correct! [2023-11-29 05:07:57,159 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05bf9e10-6be9-4cc4-b542-2ae8294ab418/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE