./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/interpolation.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 47ea0209 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf485446-ceaa-45b8-b76c-ddc7f0305212/bin/uautomizer-AkOaLMaTGY/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf485446-ceaa-45b8-b76c-ddc7f0305212/bin/uautomizer-AkOaLMaTGY/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf485446-ceaa-45b8-b76c-ddc7f0305212/bin/uautomizer-AkOaLMaTGY/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf485446-ceaa-45b8-b76c-ddc7f0305212/bin/uautomizer-AkOaLMaTGY/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf485446-ceaa-45b8-b76c-ddc7f0305212/bin/uautomizer-AkOaLMaTGY/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf485446-ceaa-45b8-b76c-ddc7f0305212/bin/uautomizer-AkOaLMaTGY --witnessprinter.witness.filename witness.graphml --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 30f6a485d859f7eee00a1696279d966456b3a38851c6233a0367f621da73d6bd --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 08:34:17,820 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 08:34:17,823 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 08:34:17,884 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 08:34:17,885 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 08:34:17,889 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 08:34:17,891 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 08:34:17,895 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 08:34:17,898 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 08:34:17,904 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 08:34:17,905 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 08:34:17,907 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 08:34:17,908 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 08:34:17,910 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 08:34:17,913 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 08:34:17,917 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 08:34:17,919 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 08:34:17,924 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 08:34:17,927 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 08:34:17,937 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 08:34:17,941 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 08:34:17,946 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 08:34:17,947 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 08:34:17,948 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 08:34:17,952 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 08:34:17,953 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 08:34:17,953 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 08:34:17,954 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 08:34:17,955 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 08:34:17,956 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 08:34:17,956 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 08:34:17,957 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 08:34:17,958 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 08:34:17,959 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 08:34:17,960 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 08:34:17,960 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 08:34:17,961 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 08:34:17,961 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 08:34:17,962 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 08:34:17,963 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 08:34:17,963 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 08:34:17,964 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf485446-ceaa-45b8-b76c-ddc7f0305212/bin/uautomizer-AkOaLMaTGY/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-07 08:34:17,990 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 08:34:17,990 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 08:34:17,991 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-07 08:34:17,991 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-07 08:34:17,992 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-07 08:34:17,992 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-07 08:34:17,993 INFO L138 SettingsManager]: * Use SBE=true [2021-11-07 08:34:17,993 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 08:34:17,993 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 08:34:17,993 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 08:34:17,994 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 08:34:17,994 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 08:34:17,994 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 08:34:17,994 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 08:34:17,994 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 08:34:17,995 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 08:34:17,995 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 08:34:17,995 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 08:34:17,995 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 08:34:17,996 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 08:34:17,996 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-07 08:34:17,996 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 08:34:17,996 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 08:34:17,997 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 08:34:17,997 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 08:34:17,997 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 08:34:17,997 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-07 08:34:17,997 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 08:34:17,998 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-07 08:34:17,998 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-07 08:34:17,998 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 08:34:17,998 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 08:34:17,999 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_bf485446-ceaa-45b8-b76c-ddc7f0305212/bin/uautomizer-AkOaLMaTGY/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_bf485446-ceaa-45b8-b76c-ddc7f0305212/bin/uautomizer-AkOaLMaTGY Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 30f6a485d859f7eee00a1696279d966456b3a38851c6233a0367f621da73d6bd [2021-11-07 08:34:18,302 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 08:34:18,324 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 08:34:18,327 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 08:34:18,328 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 08:34:18,329 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 08:34:18,330 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf485446-ceaa-45b8-b76c-ddc7f0305212/bin/uautomizer-AkOaLMaTGY/../../sv-benchmarks/c/float-benchs/interpolation.c [2021-11-07 08:34:18,407 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf485446-ceaa-45b8-b76c-ddc7f0305212/bin/uautomizer-AkOaLMaTGY/data/4b5bd2053/7445dd4537e74c109d90762d5827f54a/FLAGb93d9dcca [2021-11-07 08:34:18,891 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 08:34:18,891 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf485446-ceaa-45b8-b76c-ddc7f0305212/sv-benchmarks/c/float-benchs/interpolation.c [2021-11-07 08:34:18,898 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf485446-ceaa-45b8-b76c-ddc7f0305212/bin/uautomizer-AkOaLMaTGY/data/4b5bd2053/7445dd4537e74c109d90762d5827f54a/FLAGb93d9dcca [2021-11-07 08:34:19,251 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf485446-ceaa-45b8-b76c-ddc7f0305212/bin/uautomizer-AkOaLMaTGY/data/4b5bd2053/7445dd4537e74c109d90762d5827f54a [2021-11-07 08:34:19,254 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 08:34:19,256 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 08:34:19,266 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 08:34:19,266 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 08:34:19,269 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 08:34:19,269 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:34:19" (1/1) ... [2021-11-07 08:34:19,270 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bdb8725 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:19, skipping insertion in model container [2021-11-07 08:34:19,270 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:34:19" (1/1) ... [2021-11-07 08:34:19,277 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 08:34:19,294 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 08:34:19,469 WARN L228 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_bf485446-ceaa-45b8-b76c-ddc7f0305212/sv-benchmarks/c/float-benchs/interpolation.c[449,462] [2021-11-07 08:34:19,498 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 08:34:19,507 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 08:34:19,522 WARN L228 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_bf485446-ceaa-45b8-b76c-ddc7f0305212/sv-benchmarks/c/float-benchs/interpolation.c[449,462] [2021-11-07 08:34:19,533 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 08:34:19,548 INFO L208 MainTranslator]: Completed translation [2021-11-07 08:34:19,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:19 WrapperNode [2021-11-07 08:34:19,549 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 08:34:19,550 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 08:34:19,550 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 08:34:19,551 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 08:34:19,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:19" (1/1) ... [2021-11-07 08:34:19,566 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:19" (1/1) ... [2021-11-07 08:34:19,590 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 08:34:19,591 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 08:34:19,592 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 08:34:19,592 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 08:34:19,604 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:19" (1/1) ... [2021-11-07 08:34:19,604 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:19" (1/1) ... [2021-11-07 08:34:19,607 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:19" (1/1) ... [2021-11-07 08:34:19,607 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:19" (1/1) ... [2021-11-07 08:34:19,617 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:19" (1/1) ... [2021-11-07 08:34:19,621 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:19" (1/1) ... [2021-11-07 08:34:19,623 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:19" (1/1) ... [2021-11-07 08:34:19,626 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 08:34:19,627 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 08:34:19,627 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 08:34:19,627 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 08:34:19,628 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:19" (1/1) ... [2021-11-07 08:34:19,637 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 08:34:19,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf485446-ceaa-45b8-b76c-ddc7f0305212/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:34:19,670 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf485446-ceaa-45b8-b76c-ddc7f0305212/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 08:34:19,672 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf485446-ceaa-45b8-b76c-ddc7f0305212/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 08:34:19,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 08:34:19,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 08:34:19,720 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2021-11-07 08:34:19,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 08:34:19,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 08:34:19,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2021-11-07 08:34:19,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-07 08:34:19,965 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 08:34:19,965 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2021-11-07 08:34:19,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:34:19 BoogieIcfgContainer [2021-11-07 08:34:19,968 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 08:34:19,970 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 08:34:19,970 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 08:34:19,992 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 08:34:19,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:34:19" (1/3) ... [2021-11-07 08:34:19,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e26c9e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:34:19, skipping insertion in model container [2021-11-07 08:34:19,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:19" (2/3) ... [2021-11-07 08:34:19,994 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e26c9e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:34:19, skipping insertion in model container [2021-11-07 08:34:19,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:34:19" (3/3) ... [2021-11-07 08:34:19,995 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation.c [2021-11-07 08:34:20,001 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 08:34:20,001 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-07 08:34:20,060 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 08:34:20,068 INFO L339 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=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-07 08:34:20,069 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-07 08:34:20,085 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 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) [2021-11-07 08:34:20,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-07 08:34:20,092 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:34:20,093 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:34:20,094 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:34:20,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:34:20,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1235833265, now seen corresponding path program 1 times [2021-11-07 08:34:20,111 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:34:20,112 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839120066] [2021-11-07 08:34:20,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:34:20,114 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:34:20,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:34:20,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:34:20,359 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:34:20,359 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839120066] [2021-11-07 08:34:20,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839120066] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:34:20,360 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:34:20,361 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 08:34:20,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46699152] [2021-11-07 08:34:20,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-07 08:34:20,369 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:34:20,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-07 08:34:20,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-07 08:34:20,416 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 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) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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) [2021-11-07 08:34:20,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:34:20,429 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2021-11-07 08:34:20,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-07 08:34:20,431 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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) Word has length 10 [2021-11-07 08:34:20,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:34:20,438 INFO L225 Difference]: With dead ends: 29 [2021-11-07 08:34:20,439 INFO L226 Difference]: Without dead ends: 13 [2021-11-07 08:34:20,441 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-07 08:34:20,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2021-11-07 08:34:20,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2021-11-07 08:34:20,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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) [2021-11-07 08:34:20,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2021-11-07 08:34:20,482 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 10 [2021-11-07 08:34:20,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:34:20,483 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2021-11-07 08:34:20,483 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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) [2021-11-07 08:34:20,484 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2021-11-07 08:34:20,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-07 08:34:20,485 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:34:20,485 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:34:20,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 08:34:20,486 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:34:20,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:34:20,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1178902664, now seen corresponding path program 1 times [2021-11-07 08:34:20,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:34:20,488 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405360341] [2021-11-07 08:34:20,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:34:20,489 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:34:20,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:34:20,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:34:20,580 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:34:20,580 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405360341] [2021-11-07 08:34:20,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405360341] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:34:20,581 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:34:20,581 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 08:34:20,582 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894469385] [2021-11-07 08:34:20,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 08:34:20,584 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:34:20,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 08:34:20,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 08:34:20,587 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) [2021-11-07 08:34:20,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:34:20,606 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2021-11-07 08:34:20,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 08:34:20,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) Word has length 10 [2021-11-07 08:34:20,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:34:20,609 INFO L225 Difference]: With dead ends: 24 [2021-11-07 08:34:20,609 INFO L226 Difference]: Without dead ends: 20 [2021-11-07 08:34:20,610 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 08:34:20,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-11-07 08:34:20,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2021-11-07 08:34:20,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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) [2021-11-07 08:34:20,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2021-11-07 08:34:20,615 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 10 [2021-11-07 08:34:20,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:34:20,616 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2021-11-07 08:34:20,616 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) [2021-11-07 08:34:20,617 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2021-11-07 08:34:20,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-07 08:34:20,617 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:34:20,618 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:34:20,618 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 08:34:20,618 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:34:20,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:34:20,620 INFO L85 PathProgramCache]: Analyzing trace with hash 2110328889, now seen corresponding path program 1 times [2021-11-07 08:34:20,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:34:20,620 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270363212] [2021-11-07 08:34:20,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:34:20,621 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:34:20,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:34:20,695 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:34:20,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:34:20,772 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:34:20,773 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-07 08:34:20,774 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 08:34:20,777 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-07 08:34:20,781 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2021-11-07 08:34:20,785 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-07 08:34:20,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:34:20 BoogieIcfgContainer [2021-11-07 08:34:20,832 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-07 08:34:20,834 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-07 08:34:20,834 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-07 08:34:20,834 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-07 08:34:20,835 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:34:19" (3/4) ... [2021-11-07 08:34:20,840 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-07 08:34:20,841 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-07 08:34:20,845 INFO L168 Benchmark]: Toolchain (without parser) took 1586.03 ms. Allocated memory was 94.4 MB in the beginning and 119.5 MB in the end (delta: 25.2 MB). Free memory was 59.8 MB in the beginning and 85.5 MB in the end (delta: -25.7 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 08:34:20,847 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 94.4 MB. Free memory was 64.5 MB in the beginning and 64.5 MB in the end (delta: 27.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 08:34:20,855 INFO L168 Benchmark]: CACSL2BoogieTranslator took 283.84 ms. Allocated memory is still 94.4 MB. Free memory was 59.6 MB in the beginning and 70.2 MB in the end (delta: -10.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-11-07 08:34:20,857 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.39 ms. Allocated memory is still 94.4 MB. Free memory was 70.2 MB in the beginning and 68.7 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 08:34:20,859 INFO L168 Benchmark]: Boogie Preprocessor took 34.49 ms. Allocated memory is still 94.4 MB. Free memory was 68.7 MB in the beginning and 67.1 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-07 08:34:20,859 INFO L168 Benchmark]: RCFGBuilder took 341.18 ms. Allocated memory is still 94.4 MB. Free memory was 67.1 MB in the beginning and 57.0 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-11-07 08:34:20,861 INFO L168 Benchmark]: TraceAbstraction took 862.83 ms. Allocated memory was 94.4 MB in the beginning and 119.5 MB in the end (delta: 25.2 MB). Free memory was 56.2 MB in the beginning and 85.5 MB in the end (delta: -29.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 08:34:20,862 INFO L168 Benchmark]: Witness Printer took 7.08 ms. Allocated memory is still 119.5 MB. Free memory is still 85.5 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 08:34:20,867 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 94.4 MB. Free memory was 64.5 MB in the beginning and 64.5 MB in the end (delta: 27.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 283.84 ms. Allocated memory is still 94.4 MB. Free memory was 59.6 MB in the beginning and 70.2 MB in the end (delta: -10.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 40.39 ms. Allocated memory is still 94.4 MB. Free memory was 70.2 MB in the beginning and 68.7 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 34.49 ms. Allocated memory is still 94.4 MB. Free memory was 68.7 MB in the beginning and 67.1 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 341.18 ms. Allocated memory is still 94.4 MB. Free memory was 67.1 MB in the beginning and 57.0 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 862.83 ms. Allocated memory was 94.4 MB in the beginning and 119.5 MB in the end (delta: 25.2 MB). Free memory was 56.2 MB in the beginning and 85.5 MB in the end (delta: -29.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * Witness Printer took 7.08 ms. Allocated memory is still 119.5 MB. Free memory is still 85.5 MB. There was no memory consumed. Max. memory is 16.1 GB. * 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: 9]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 26, overapproximation of to_real at line 15, overapproximation of someBinaryArithmeticFLOAToperation at line 24. Possible FailurePath: [L13] int i; [L14] float z, t; [L15] float min[] = { 5, 10, 12, 30, 150 }; [L16] float max[] = { 10, 12, 30, 150, 300 }; [L18] t = __VERIFIER_nondet_float() [L19] EXPR min[0] [L19] t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1] [L19] EXPR max[sizeof(max) / sizeof(max[0]) - 1] [L19] t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1] [L7] COND FALSE !(!cond) [L21] i = 0 [L21] COND TRUE i < sizeof(min) / sizeof(min[0]) [L22] EXPR max[i] [L22] COND TRUE t <= max[i] [L24] EXPR min[i] [L24] EXPR max[i] [L24] EXPR min[i] [L24] z = (t - min[i]) / (max[i] - min[i]) [L9] COND TRUE !(cond) [L9] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 32 SDtfs, 6 SDslu, 10 SDs, 0 SdLazy, 6 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred 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, 6 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 31 NumberOfCodeBlocks, 31 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 18 ConstructedInterpolants, 0 QuantifiedInterpolants, 20 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 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 [2021-11-07 08:34:20,924 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf485446-ceaa-45b8-b76c-ddc7f0305212/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf485446-ceaa-45b8-b76c-ddc7f0305212/bin/uautomizer-AkOaLMaTGY/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf485446-ceaa-45b8-b76c-ddc7f0305212/bin/uautomizer-AkOaLMaTGY/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf485446-ceaa-45b8-b76c-ddc7f0305212/bin/uautomizer-AkOaLMaTGY/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf485446-ceaa-45b8-b76c-ddc7f0305212/bin/uautomizer-AkOaLMaTGY/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf485446-ceaa-45b8-b76c-ddc7f0305212/bin/uautomizer-AkOaLMaTGY/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf485446-ceaa-45b8-b76c-ddc7f0305212/bin/uautomizer-AkOaLMaTGY --witnessprinter.witness.filename witness.graphml --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 30f6a485d859f7eee00a1696279d966456b3a38851c6233a0367f621da73d6bd --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 08:34:23,879 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 08:34:23,883 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 08:34:23,952 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 08:34:23,953 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 08:34:23,960 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 08:34:23,963 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 08:34:23,972 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 08:34:23,976 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 08:34:23,986 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 08:34:23,987 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 08:34:23,990 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 08:34:23,991 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 08:34:23,994 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 08:34:23,997 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 08:34:24,004 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 08:34:24,006 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 08:34:24,008 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 08:34:24,010 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 08:34:24,020 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 08:34:24,022 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 08:34:24,024 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 08:34:24,027 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 08:34:24,030 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 08:34:24,035 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 08:34:24,036 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 08:34:24,036 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 08:34:24,039 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 08:34:24,040 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 08:34:24,041 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 08:34:24,042 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 08:34:24,043 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 08:34:24,046 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 08:34:24,047 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 08:34:24,049 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 08:34:24,049 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 08:34:24,050 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 08:34:24,051 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 08:34:24,051 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 08:34:24,053 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 08:34:24,054 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 08:34:24,055 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf485446-ceaa-45b8-b76c-ddc7f0305212/bin/uautomizer-AkOaLMaTGY/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-11-07 08:34:24,107 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 08:34:24,108 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 08:34:24,108 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-07 08:34:24,109 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-07 08:34:24,111 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-07 08:34:24,112 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-07 08:34:24,112 INFO L138 SettingsManager]: * Use SBE=true [2021-11-07 08:34:24,112 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 08:34:24,113 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 08:34:24,113 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 08:34:24,114 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 08:34:24,115 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 08:34:24,115 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 08:34:24,115 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 08:34:24,115 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-07 08:34:24,116 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-07 08:34:24,116 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 08:34:24,116 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 08:34:24,117 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 08:34:24,117 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 08:34:24,117 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 08:34:24,118 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-07 08:34:24,118 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 08:34:24,118 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 08:34:24,118 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 08:34:24,119 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 08:34:24,119 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 08:34:24,119 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-07 08:34:24,120 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-07 08:34:24,120 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-07 08:34:24,120 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-07 08:34:24,120 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 08:34:24,121 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 08:34:24,121 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 08:34:24,122 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_bf485446-ceaa-45b8-b76c-ddc7f0305212/bin/uautomizer-AkOaLMaTGY/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_bf485446-ceaa-45b8-b76c-ddc7f0305212/bin/uautomizer-AkOaLMaTGY Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 30f6a485d859f7eee00a1696279d966456b3a38851c6233a0367f621da73d6bd [2021-11-07 08:34:24,555 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 08:34:24,594 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 08:34:24,597 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 08:34:24,598 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 08:34:24,599 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 08:34:24,600 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf485446-ceaa-45b8-b76c-ddc7f0305212/bin/uautomizer-AkOaLMaTGY/../../sv-benchmarks/c/float-benchs/interpolation.c [2021-11-07 08:34:24,679 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf485446-ceaa-45b8-b76c-ddc7f0305212/bin/uautomizer-AkOaLMaTGY/data/0d69264f4/b62dbbe52aca4a7fb91d76ef9c9b8cac/FLAG4a516d605 [2021-11-07 08:34:25,319 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 08:34:25,321 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf485446-ceaa-45b8-b76c-ddc7f0305212/sv-benchmarks/c/float-benchs/interpolation.c [2021-11-07 08:34:25,328 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf485446-ceaa-45b8-b76c-ddc7f0305212/bin/uautomizer-AkOaLMaTGY/data/0d69264f4/b62dbbe52aca4a7fb91d76ef9c9b8cac/FLAG4a516d605 [2021-11-07 08:34:25,593 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf485446-ceaa-45b8-b76c-ddc7f0305212/bin/uautomizer-AkOaLMaTGY/data/0d69264f4/b62dbbe52aca4a7fb91d76ef9c9b8cac [2021-11-07 08:34:25,596 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 08:34:25,598 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 08:34:25,600 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 08:34:25,600 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 08:34:25,604 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 08:34:25,605 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:34:25" (1/1) ... [2021-11-07 08:34:25,607 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3de976a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:25, skipping insertion in model container [2021-11-07 08:34:25,607 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:34:25" (1/1) ... [2021-11-07 08:34:25,617 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 08:34:25,633 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 08:34:25,799 WARN L228 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_bf485446-ceaa-45b8-b76c-ddc7f0305212/sv-benchmarks/c/float-benchs/interpolation.c[449,462] [2021-11-07 08:34:25,826 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 08:34:25,841 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 08:34:25,856 WARN L228 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_bf485446-ceaa-45b8-b76c-ddc7f0305212/sv-benchmarks/c/float-benchs/interpolation.c[449,462] [2021-11-07 08:34:25,872 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 08:34:25,900 INFO L208 MainTranslator]: Completed translation [2021-11-07 08:34:25,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:25 WrapperNode [2021-11-07 08:34:25,901 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 08:34:25,902 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 08:34:25,902 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 08:34:25,902 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 08:34:25,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:25" (1/1) ... [2021-11-07 08:34:25,936 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:25" (1/1) ... [2021-11-07 08:34:25,978 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 08:34:25,980 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 08:34:25,980 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 08:34:25,981 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 08:34:25,990 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:25" (1/1) ... [2021-11-07 08:34:25,990 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:25" (1/1) ... [2021-11-07 08:34:26,003 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:25" (1/1) ... [2021-11-07 08:34:26,004 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:25" (1/1) ... [2021-11-07 08:34:26,048 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:25" (1/1) ... [2021-11-07 08:34:26,057 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:25" (1/1) ... [2021-11-07 08:34:26,066 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:25" (1/1) ... [2021-11-07 08:34:26,075 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 08:34:26,076 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 08:34:26,077 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 08:34:26,077 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 08:34:26,078 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:25" (1/1) ... [2021-11-07 08:34:26,086 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 08:34:26,099 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf485446-ceaa-45b8-b76c-ddc7f0305212/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:34:26,112 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf485446-ceaa-45b8-b76c-ddc7f0305212/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 08:34:26,132 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf485446-ceaa-45b8-b76c-ddc7f0305212/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 08:34:26,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2021-11-07 08:34:26,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-07 08:34:26,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 08:34:26,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2021-11-07 08:34:26,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 08:34:26,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 08:34:26,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-07 08:34:28,561 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 08:34:28,561 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2021-11-07 08:34:28,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:34:28 BoogieIcfgContainer [2021-11-07 08:34:28,564 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 08:34:28,566 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 08:34:28,566 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 08:34:28,570 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 08:34:28,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:34:25" (1/3) ... [2021-11-07 08:34:28,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@101b9f48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:34:28, skipping insertion in model container [2021-11-07 08:34:28,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:25" (2/3) ... [2021-11-07 08:34:28,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@101b9f48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:34:28, skipping insertion in model container [2021-11-07 08:34:28,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:34:28" (3/3) ... [2021-11-07 08:34:28,573 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation.c [2021-11-07 08:34:28,580 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 08:34:28,580 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-07 08:34:28,636 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 08:34:28,644 INFO L339 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=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-07 08:34:28,644 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-07 08:34:28,661 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 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) [2021-11-07 08:34:28,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-07 08:34:28,667 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:34:28,668 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:34:28,669 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:34:28,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:34:28,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1235833265, now seen corresponding path program 1 times [2021-11-07 08:34:28,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 08:34:28,713 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [786274125] [2021-11-07 08:34:28,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:34:28,715 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 08:34:28,715 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf485446-ceaa-45b8-b76c-ddc7f0305212/bin/uautomizer-AkOaLMaTGY/mathsat [2021-11-07 08:34:28,743 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf485446-ceaa-45b8-b76c-ddc7f0305212/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 08:34:28,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf485446-ceaa-45b8-b76c-ddc7f0305212/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-07 08:34:29,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:34:29,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-07 08:34:29,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:34:29,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:34:29,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 08:34:29,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:34:29,387 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 08:34:29,388 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [786274125] [2021-11-07 08:34:29,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [786274125] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 08:34:29,389 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:34:29,389 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-07 08:34:29,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073628050] [2021-11-07 08:34:29,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-07 08:34:29,399 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 08:34:29,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-07 08:34:29,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-07 08:34:29,419 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 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) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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) [2021-11-07 08:34:29,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:34:29,436 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2021-11-07 08:34:29,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-07 08:34:29,438 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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) Word has length 10 [2021-11-07 08:34:29,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:34:29,448 INFO L225 Difference]: With dead ends: 29 [2021-11-07 08:34:29,449 INFO L226 Difference]: Without dead ends: 13 [2021-11-07 08:34:29,452 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-07 08:34:29,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2021-11-07 08:34:29,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2021-11-07 08:34:29,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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) [2021-11-07 08:34:29,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2021-11-07 08:34:29,490 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 10 [2021-11-07 08:34:29,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:34:29,491 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2021-11-07 08:34:29,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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) [2021-11-07 08:34:29,492 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2021-11-07 08:34:29,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-07 08:34:29,493 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:34:29,493 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:34:29,520 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf485446-ceaa-45b8-b76c-ddc7f0305212/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-07 08:34:29,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf485446-ceaa-45b8-b76c-ddc7f0305212/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 [2021-11-07 08:34:29,709 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:34:29,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:34:29,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1178902664, now seen corresponding path program 1 times [2021-11-07 08:34:29,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 08:34:29,713 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [616928710] [2021-11-07 08:34:29,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:34:29,714 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 08:34:29,714 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf485446-ceaa-45b8-b76c-ddc7f0305212/bin/uautomizer-AkOaLMaTGY/mathsat [2021-11-07 08:34:29,716 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf485446-ceaa-45b8-b76c-ddc7f0305212/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 08:34:29,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf485446-ceaa-45b8-b76c-ddc7f0305212/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-07 08:34:30,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:34:30,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-07 08:34:30,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:34:30,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:34:30,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 08:34:30,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:34:30,303 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 08:34:30,304 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [616928710] [2021-11-07 08:34:30,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [616928710] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 08:34:30,305 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:34:30,305 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-07 08:34:30,305 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215272519] [2021-11-07 08:34:30,307 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:34:30,307 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 08:34:30,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:34:30,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:34:30,313 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) [2021-11-07 08:34:32,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:34:32,542 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2021-11-07 08:34:32,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:34:32,543 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) Word has length 10 [2021-11-07 08:34:32,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:34:32,544 INFO L225 Difference]: With dead ends: 23 [2021-11-07 08:34:32,545 INFO L226 Difference]: Without dead ends: 19 [2021-11-07 08:34:32,546 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:34:32,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-11-07 08:34:32,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2021-11-07 08:34:32,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 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) [2021-11-07 08:34:32,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2021-11-07 08:34:32,552 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 10 [2021-11-07 08:34:32,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:34:32,552 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2021-11-07 08:34:32,552 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) [2021-11-07 08:34:32,553 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2021-11-07 08:34:32,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-07 08:34:32,553 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:34:32,553 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:34:32,583 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf485446-ceaa-45b8-b76c-ddc7f0305212/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-07 08:34:32,754 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf485446-ceaa-45b8-b76c-ddc7f0305212/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 [2021-11-07 08:34:32,754 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:34:32,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:34:32,756 INFO L85 PathProgramCache]: Analyzing trace with hash 2110328889, now seen corresponding path program 1 times [2021-11-07 08:34:32,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 08:34:32,757 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [914648840] [2021-11-07 08:34:32,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:34:32,757 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 08:34:32,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf485446-ceaa-45b8-b76c-ddc7f0305212/bin/uautomizer-AkOaLMaTGY/mathsat [2021-11-07 08:34:32,759 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf485446-ceaa-45b8-b76c-ddc7f0305212/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 08:34:32,761 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf485446-ceaa-45b8-b76c-ddc7f0305212/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-07 08:34:33,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:34:33,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-07 08:34:33,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:34:36,703 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-07 08:34:36,704 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 392 treesize of output 192 [2021-11-07 08:37:45,316 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse0) (fp.geq ULTIMATE.start_main_~t~0 .cse0) (let ((.cse1 (fp.leq (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~t~0 .cse0) (fp.sub roundNearestTiesToEven .cse2 .cse0)) ((_ to_fp 8 24) roundNearestTiesToEven 1.0)))) (or (and .cse1 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))) (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)) (not .cse1)))) (fp.leq ULTIMATE.start_main_~t~0 .cse2) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse2)))) is different from false [2021-11-07 08:37:47,335 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse0) (fp.geq ULTIMATE.start_main_~t~0 .cse0) (let ((.cse1 (fp.leq (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~t~0 .cse0) (fp.sub roundNearestTiesToEven .cse2 .cse0)) ((_ to_fp 8 24) roundNearestTiesToEven 1.0)))) (or (and .cse1 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))) (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)) (not .cse1)))) (fp.leq ULTIMATE.start_main_~t~0 .cse2) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse2)))) is different from true [2021-11-07 08:38:40,041 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse0) (fp.geq ULTIMATE.start_main_~t~0 .cse0) (not (fp.leq (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~t~0 .cse0) (fp.sub roundNearestTiesToEven .cse1 .cse0)) ((_ to_fp 8 24) roundNearestTiesToEven 1.0))) (fp.leq ULTIMATE.start_main_~t~0 .cse1) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse1)))) is different from false [2021-11-07 08:38:42,061 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse0) (fp.geq ULTIMATE.start_main_~t~0 .cse0) (not (fp.leq (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~t~0 .cse0) (fp.sub roundNearestTiesToEven .cse1 .cse0)) ((_ to_fp 8 24) roundNearestTiesToEven 1.0))) (fp.leq ULTIMATE.start_main_~t~0 .cse1) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse1)))) is different from true [2021-11-07 08:38:42,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:38:42,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 08:38:52,547 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse3 (bvmul c_ULTIMATE.start_main_~i~0 (_ bv4 32)))) (let ((.cse1 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|) (bvadd |c_ULTIMATE.start_main_~#min~0.offset| .cse3)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~t~0 .cse1) (fp.sub c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|) (bvadd |c_ULTIMATE.start_main_~#max~0.offset| .cse3)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) .cse1)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) is different from false [2021-11-07 08:38:54,591 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse3 (bvmul c_ULTIMATE.start_main_~i~0 (_ bv4 32)))) (let ((.cse1 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|) (bvadd |c_ULTIMATE.start_main_~#min~0.offset| .cse3)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~t~0 .cse1) (fp.sub c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|) (bvadd |c_ULTIMATE.start_main_~#max~0.offset| .cse3)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) .cse1)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) is different from true [2021-11-07 08:39:07,642 WARN L838 $PredicateComparison]: unable to prove that (or (not (fp.leq c_ULTIMATE.start_main_~t~0 |c_ULTIMATE.start_main_#t~mem12|)) (let ((.cse0 (let ((.cse3 (bvmul c_ULTIMATE.start_main_~i~0 (_ bv4 32)))) (let ((.cse1 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|) (bvadd |c_ULTIMATE.start_main_~#min~0.offset| .cse3)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~t~0 .cse1) (fp.sub c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|) (bvadd |c_ULTIMATE.start_main_~#max~0.offset| .cse3)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) .cse1)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))))) is different from false [2021-11-07 08:39:09,686 WARN L860 $PredicateComparison]: unable to prove that (or (not (fp.leq c_ULTIMATE.start_main_~t~0 |c_ULTIMATE.start_main_#t~mem12|)) (let ((.cse0 (let ((.cse3 (bvmul c_ULTIMATE.start_main_~i~0 (_ bv4 32)))) (let ((.cse1 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|) (bvadd |c_ULTIMATE.start_main_~#min~0.offset| .cse3)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~t~0 .cse1) (fp.sub c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|) (bvadd |c_ULTIMATE.start_main_~#max~0.offset| .cse3)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) .cse1)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))))) is different from true [2021-11-07 08:39:24,267 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (bvmul c_ULTIMATE.start_main_~i~0 (_ bv4 32)))) (let ((.cse0 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|) (bvadd |c_ULTIMATE.start_main_~#max~0.offset| .cse4)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (not (fp.leq c_ULTIMATE.start_main_~t~0 .cse0)) (let ((.cse1 (let ((.cse2 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|) (bvadd |c_ULTIMATE.start_main_~#min~0.offset| .cse4)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~t~0 .cse2) (fp.sub c_currentRoundingMode .cse0 .cse2))))) (and (fp.geq .cse1 (_ +zero 8 24)) (fp.leq .cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))))))) is different from false [2021-11-07 08:39:40,395 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|) |c_ULTIMATE.start_main_~#max~0.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (or (let ((.cse0 (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|) |c_ULTIMATE.start_main_~#min~0.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~t~0 .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)) (fp.geq .cse0 (_ +zero 8 24)))) (not (fp.leq c_ULTIMATE.start_main_~t~0 .cse2)))) is different from true [2021-11-07 08:39:57,774 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|) |c_ULTIMATE.start_main_~#max~0.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (or (let ((.cse0 (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|) |c_ULTIMATE.start_main_~#min~0.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~t~0 .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)) (fp.geq .cse0 (_ +zero 8 24)))) (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)) (not (fp.leq c_ULTIMATE.start_main_~t~0 .cse2)))) is different from false [2021-11-07 08:39:59,819 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|) |c_ULTIMATE.start_main_~#max~0.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (or (let ((.cse0 (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|) |c_ULTIMATE.start_main_~#min~0.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~t~0 .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)) (fp.geq .cse0 (_ +zero 8 24)))) (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)) (not (fp.leq c_ULTIMATE.start_main_~t~0 .cse2)))) is different from true [2021-11-07 08:40:14,520 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|) |c_ULTIMATE.start_main_~#max~0.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (or (let ((.cse0 (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|) |c_ULTIMATE.start_main_~#min~0.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~t~0 .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)) (fp.geq .cse0 (_ +zero 8 24)))) (not |c_ULTIMATE.start_main_#t~short10|) (not (fp.leq c_ULTIMATE.start_main_~t~0 .cse2)))) is different from false [2021-11-07 08:40:16,569 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|) |c_ULTIMATE.start_main_~#max~0.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (or (let ((.cse0 (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|) |c_ULTIMATE.start_main_~#min~0.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~t~0 .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)) (fp.geq .cse0 (_ +zero 8 24)))) (not |c_ULTIMATE.start_main_#t~short10|) (not (fp.leq c_ULTIMATE.start_main_~t~0 .cse2)))) is different from true [2021-11-07 08:40:37,012 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|))) (let ((.cse4 (let ((.cse6 (select .cse1 |c_ULTIMATE.start_main_~#max~0.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (not (fp.leq c_ULTIMATE.start_main_~t~0 (let ((.cse0 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#max~0.offset| (_ bv16 32))))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))))) (let ((.cse2 (let ((.cse3 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|) |c_ULTIMATE.start_main_~#min~0.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~t~0 .cse3) (fp.sub c_currentRoundingMode .cse4 .cse3))))) (and (fp.leq .cse2 ((_ to_fp 8 24) c_currentRoundingMode 1.0)) (fp.geq .cse2 (_ +zero 8 24)))) (not |c_ULTIMATE.start_main_#t~short10|) (not (fp.leq c_ULTIMATE.start_main_~t~0 .cse4))))) is different from false [2021-11-07 08:40:39,060 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|))) (let ((.cse4 (let ((.cse6 (select .cse1 |c_ULTIMATE.start_main_~#max~0.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (not (fp.leq c_ULTIMATE.start_main_~t~0 (let ((.cse0 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#max~0.offset| (_ bv16 32))))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))))) (let ((.cse2 (let ((.cse3 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|) |c_ULTIMATE.start_main_~#min~0.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~t~0 .cse3) (fp.sub c_currentRoundingMode .cse4 .cse3))))) (and (fp.leq .cse2 ((_ to_fp 8 24) c_currentRoundingMode 1.0)) (fp.geq .cse2 (_ +zero 8 24)))) (not |c_ULTIMATE.start_main_#t~short10|) (not (fp.leq c_ULTIMATE.start_main_~t~0 .cse4))))) is different from true [2021-11-07 08:40:53,233 WARN L207 SmtUtils]: Spent 14.13 s on a formula simplification. DAG size of input: 8 DAG size of output: 3 [2021-11-07 08:40:53,233 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-11-07 08:40:53,234 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 274 treesize of output 133 [2021-11-07 08:42:17,773 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((v_arrayElimCell_4 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))))) (forall ((v_arrayElimCell_6 (_ BitVec 32)) (v_ULTIMATE.start_main_~t~0_10 (_ FloatingPoint 8 24)) (v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (or (fp.leq (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~t~0_10 .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0)) ((_ to_fp 8 24) c_currentRoundingMode 1.0)) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse0)) (not (fp.geq v_ULTIMATE.start_main_~t~0_10 .cse0)) (not (fp.leq v_ULTIMATE.start_main_~t~0_10 .cse1)) (not (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))))))) is different from true [2021-11-07 08:42:17,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:42:17,774 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 08:42:17,774 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [914648840] [2021-11-07 08:42:17,775 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [914648840] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 08:42:17,775 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:42:17,775 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 20 [2021-11-07 08:42:17,775 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523196993] [2021-11-07 08:42:17,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-07 08:42:17,776 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 08:42:17,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-07 08:42:17,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=82, Unknown=17, NotChecked=270, Total=420 [2021-11-07 08:42:17,779 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 21 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 20 states have internal predecessors, (22), 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) [2021-11-07 08:42:19,857 WARN L838 $PredicateComparison]: unable to prove that (and (or (forall ((v_arrayElimCell_4 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))))) (forall ((v_arrayElimCell_6 (_ BitVec 32)) (v_ULTIMATE.start_main_~t~0_10 (_ FloatingPoint 8 24)) (v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (or (fp.leq (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~t~0_10 .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0)) ((_ to_fp 8 24) c_currentRoundingMode 1.0)) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse0)) (not (fp.geq v_ULTIMATE.start_main_~t~0_10 .cse0)) (not (fp.leq v_ULTIMATE.start_main_~t~0_10 .cse1)) (not (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-07 08:42:21,904 WARN L860 $PredicateComparison]: unable to prove that (and (or (forall ((v_arrayElimCell_4 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))))) (forall ((v_arrayElimCell_6 (_ BitVec 32)) (v_ULTIMATE.start_main_~t~0_10 (_ FloatingPoint 8 24)) (v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (or (fp.leq (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~t~0_10 .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0)) ((_ to_fp 8 24) c_currentRoundingMode 1.0)) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse0)) (not (fp.geq v_ULTIMATE.start_main_~t~0_10 .cse0)) (not (fp.leq v_ULTIMATE.start_main_~t~0_10 .cse1)) (not (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-07 08:42:24,372 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|))) (let ((.cse3 (let ((.cse9 (select .cse7 |c_ULTIMATE.start_main_~#max~0.offset|))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9)))) (.cse4 (not |c_ULTIMATE.start_main_#t~short10|)) (.cse2 (let ((.cse8 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|) |c_ULTIMATE.start_main_~#min~0.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))) (.cse0 (let ((.cse6 (select .cse7 (bvadd |c_ULTIMATE.start_main_~#max~0.offset| (_ bv16 32))))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (and (or (not (fp.leq c_ULTIMATE.start_main_~t~0 .cse0)) (let ((.cse1 (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~t~0 .cse2) (fp.sub c_currentRoundingMode .cse3 .cse2)))) (and (fp.leq .cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0)) (fp.geq .cse1 (_ +zero 8 24)))) .cse4 (not (fp.leq c_ULTIMATE.start_main_~t~0 .cse3))) (= |c_ULTIMATE.start_main_~#min~0.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#max~0.offset| (_ bv0 32)) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (let ((.cse5 (fp.geq c_ULTIMATE.start_main_~t~0 .cse2))) (or (and |c_ULTIMATE.start_main_#t~short10| .cse5) (and (not .cse5) .cse4))) (= c_currentRoundingMode roundNearestTiesToEven) (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))))) is different from true [2021-11-07 08:42:27,309 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|))) (let ((.cse1 (not |c_ULTIMATE.start_main_#t~short10|)) (.cse5 (let ((.cse9 (select .cse7 |c_ULTIMATE.start_main_~#max~0.offset|))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9)))) (.cse4 (let ((.cse8 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|) |c_ULTIMATE.start_main_~#min~0.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))) (.cse2 (let ((.cse6 (select .cse7 (bvadd |c_ULTIMATE.start_main_~#max~0.offset| (_ bv16 32))))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (and (let ((.cse0 (fp.leq c_ULTIMATE.start_main_~t~0 .cse2))) (or (and (not .cse0) .cse1) (and |c_ULTIMATE.start_main_#t~short10| .cse0))) (= |c_ULTIMATE.start_main_~#min~0.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#max~0.offset| (_ bv0 32)) (or (let ((.cse3 (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~t~0 .cse4) (fp.sub c_currentRoundingMode .cse5 .cse4)))) (and (fp.leq .cse3 ((_ to_fp 8 24) c_currentRoundingMode 1.0)) (fp.geq .cse3 (_ +zero 8 24)))) .cse1 (not (fp.leq c_ULTIMATE.start_main_~t~0 .cse5))) (= .cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= .cse5 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq c_ULTIMATE.start_main_~t~0 .cse4) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))))) is different from true [2021-11-07 08:43:32,175 WARN L207 SmtUtils]: Spent 55.40 s on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2021-11-07 08:44:36,456 WARN L207 SmtUtils]: Spent 54.42 s on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2021-11-07 08:46:01,282 WARN L207 SmtUtils]: Spent 1.22 m on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2021-11-07 08:46:07,868 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|))) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|)) (.cse10 (let ((.cse13 (select .cse9 (bvadd |c_ULTIMATE.start_main_~#max~0.offset| (_ bv16 32))))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13)))) (.cse7 (bvmul c_ULTIMATE.start_main_~i~0 (_ bv4 32)))) (let ((.cse0 (let ((.cse12 (select .cse9 (bvadd |c_ULTIMATE.start_main_~#max~0.offset| .cse7)))) (fp ((_ extract 31 31) .cse12) ((_ extract 30 23) .cse12) ((_ extract 22 0) .cse12)))) (.cse1 (fp.leq c_ULTIMATE.start_main_~t~0 .cse10)) (.cse2 (let ((.cse11 (select .cse6 |c_ULTIMATE.start_main_~#min~0.offset|))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11))))) (and (= c_ULTIMATE.start_main_~i~0 (_ bv0 32)) (= |c_ULTIMATE.start_main_#t~mem12| .cse0) (= |c_ULTIMATE.start_main_~#min~0.offset| (_ bv0 32)) (or (and (not .cse1) (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))) (and (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) .cse1)) (= |c_ULTIMATE.start_main_~#max~0.offset| (_ bv0 32)) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (or (not (fp.leq c_ULTIMATE.start_main_~t~0 |c_ULTIMATE.start_main_#t~mem12|)) (let ((.cse3 (let ((.cse4 (let ((.cse5 (select .cse6 (bvadd |c_ULTIMATE.start_main_~#min~0.offset| .cse7)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~t~0 .cse4) (fp.sub c_currentRoundingMode .cse0 .cse4))))) (and (fp.geq .cse3 (_ +zero 8 24)) (fp.leq .cse3 ((_ to_fp 8 24) c_currentRoundingMode 1.0))))) (= (let ((.cse8 (select .cse9 |c_ULTIMATE.start_main_~#max~0.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= c_currentRoundingMode roundNearestTiesToEven) .cse1 (fp.geq c_ULTIMATE.start_main_~t~0 .cse2) (= .cse10 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))))))) is different from true [2021-11-07 08:46:09,933 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|)) (.cse9 (bvmul c_ULTIMATE.start_main_~i~0 (_ bv4 32)))) (let ((.cse1 (let ((.cse11 (select .cse4 (bvadd |c_ULTIMATE.start_main_~#max~0.offset| .cse9)))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11)))) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|))) (let ((.cse2 (let ((.cse10 (select .cse8 |c_ULTIMATE.start_main_~#min~0.offset|))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10)))) (.cse0 (let ((.cse6 (let ((.cse7 (select .cse8 (bvadd |c_ULTIMATE.start_main_~#min~0.offset| .cse9)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~t~0 .cse6) (fp.sub c_currentRoundingMode .cse1 .cse6))))) (and (= c_ULTIMATE.start_main_~i~0 (_ bv0 32)) (fp.geq .cse0 (_ +zero 8 24)) (= |c_ULTIMATE.start_main_~#min~0.offset| (_ bv0 32)) (fp.leq c_ULTIMATE.start_main_~t~0 .cse1) (= |c_ULTIMATE.start_main_~#max~0.offset| (_ bv0 32)) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#max~0.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq c_ULTIMATE.start_main_~t~0 .cse2) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)) (= (let ((.cse5 (select .cse4 (bvadd |c_ULTIMATE.start_main_~#max~0.offset| (_ bv16 32))))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))))))) is different from false [2021-11-07 08:46:11,987 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|)) (.cse9 (bvmul c_ULTIMATE.start_main_~i~0 (_ bv4 32)))) (let ((.cse1 (let ((.cse11 (select .cse4 (bvadd |c_ULTIMATE.start_main_~#max~0.offset| .cse9)))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11)))) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|))) (let ((.cse2 (let ((.cse10 (select .cse8 |c_ULTIMATE.start_main_~#min~0.offset|))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10)))) (.cse0 (let ((.cse6 (let ((.cse7 (select .cse8 (bvadd |c_ULTIMATE.start_main_~#min~0.offset| .cse9)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~t~0 .cse6) (fp.sub c_currentRoundingMode .cse1 .cse6))))) (and (= c_ULTIMATE.start_main_~i~0 (_ bv0 32)) (fp.geq .cse0 (_ +zero 8 24)) (= |c_ULTIMATE.start_main_~#min~0.offset| (_ bv0 32)) (fp.leq c_ULTIMATE.start_main_~t~0 .cse1) (= |c_ULTIMATE.start_main_~#max~0.offset| (_ bv0 32)) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#max~0.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq c_ULTIMATE.start_main_~t~0 .cse2) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)) (= (let ((.cse5 (select .cse4 (bvadd |c_ULTIMATE.start_main_~#max~0.offset| (_ bv16 32))))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))))))) is different from true [2021-11-07 08:46:21,757 WARN L207 SmtUtils]: Spent 7.76 s on a formula simplification that was a NOOP. DAG size: 39 [2021-11-07 08:46:24,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:46:24,444 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2021-11-07 08:46:24,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 08:46:24,446 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 20 states have internal predecessors, (22), 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) Word has length 11 [2021-11-07 08:46:24,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:46:24,447 INFO L225 Difference]: With dead ends: 26 [2021-11-07 08:46:24,447 INFO L226 Difference]: Without dead ends: 22 [2021-11-07 08:46:24,449 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 278.5s TimeCoverageRelationStatistics Valid=82, Invalid=159, Unknown=29, NotChecked=600, Total=870 [2021-11-07 08:46:24,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2021-11-07 08:46:24,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-11-07 08:46:24,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 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) [2021-11-07 08:46:24,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2021-11-07 08:46:24,455 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 11 [2021-11-07 08:46:24,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:46:24,455 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2021-11-07 08:46:24,455 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 20 states have internal predecessors, (22), 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) [2021-11-07 08:46:24,456 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2021-11-07 08:46:24,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-07 08:46:24,457 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:46:24,457 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:46:24,471 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf485446-ceaa-45b8-b76c-ddc7f0305212/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-07 08:46:24,661 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf485446-ceaa-45b8-b76c-ddc7f0305212/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 [2021-11-07 08:46:24,662 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:46:24,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:46:24,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1504580037, now seen corresponding path program 1 times [2021-11-07 08:46:24,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 08:46:24,667 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1865077244] [2021-11-07 08:46:24,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:46:24,668 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 08:46:24,676 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf485446-ceaa-45b8-b76c-ddc7f0305212/bin/uautomizer-AkOaLMaTGY/mathsat [2021-11-07 08:46:24,680 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf485446-ceaa-45b8-b76c-ddc7f0305212/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 08:46:24,683 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf485446-ceaa-45b8-b76c-ddc7f0305212/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-07 08:46:25,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:46:25,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-07 08:46:25,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:46:25,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:46:25,095 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 08:46:25,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:46:25,154 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 08:46:25,154 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1865077244] [2021-11-07 08:46:25,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1865077244] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 08:46:25,154 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:46:25,154 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-07 08:46:25,154 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868172457] [2021-11-07 08:46:25,154 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:46:25,155 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 08:46:25,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:46:25,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:46:25,155 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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) [2021-11-07 08:46:25,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:46:25,208 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2021-11-07 08:46:25,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:46:25,209 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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) Word has length 11 [2021-11-07 08:46:25,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:46:25,209 INFO L225 Difference]: With dead ends: 31 [2021-11-07 08:46:25,209 INFO L226 Difference]: Without dead ends: 17 [2021-11-07 08:46:25,210 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:46:25,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-11-07 08:46:25,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-11-07 08:46:25,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 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) [2021-11-07 08:46:25,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2021-11-07 08:46:25,213 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 11 [2021-11-07 08:46:25,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:46:25,214 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2021-11-07 08:46:25,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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) [2021-11-07 08:46:25,214 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2021-11-07 08:46:25,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-07 08:46:25,215 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:46:25,215 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:46:25,233 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf485446-ceaa-45b8-b76c-ddc7f0305212/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-07 08:46:25,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf485446-ceaa-45b8-b76c-ddc7f0305212/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 [2021-11-07 08:46:25,417 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:46:25,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:46:25,418 INFO L85 PathProgramCache]: Analyzing trace with hash 723862385, now seen corresponding path program 1 times [2021-11-07 08:46:25,419 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 08:46:25,420 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2061624560] [2021-11-07 08:46:25,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:46:25,421 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 08:46:25,422 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf485446-ceaa-45b8-b76c-ddc7f0305212/bin/uautomizer-AkOaLMaTGY/mathsat [2021-11-07 08:46:25,424 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf485446-ceaa-45b8-b76c-ddc7f0305212/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 08:46:25,428 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf485446-ceaa-45b8-b76c-ddc7f0305212/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-07 08:46:25,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:46:26,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 31 conjunts are in the unsatisfiable core [2021-11-07 08:46:26,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:46:29,987 INFO L354 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2021-11-07 08:46:29,987 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 439 treesize of output 215 [2021-11-07 08:47:09,217 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_11 (_ BitVec 32)) (v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_11) ((_ extract 30 23) v_arrayElimCell_11) ((_ extract 22 0) v_arrayElimCell_11))) (.cse4 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8)))) (and (= .cse0 .cse1) (= .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv12 32))) (let ((.cse3 (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~t~0 .cse4) (fp.sub roundNearestTiesToEven .cse2 .cse4)))) (or (and (fp.geq .cse3 (_ +zero 8 24)) (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))) (not (fp.leq .cse3 ((_ to_fp 8 24) roundNearestTiesToEven 1.0))))) (not (fp.leq ULTIMATE.start_main_~t~0 .cse0)) (= .cse4 .cse1) (fp.leq ULTIMATE.start_main_~t~0 .cse2)))) is different from false [2021-11-07 08:47:12,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:47:12,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 08:47:22,785 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse3 (bvmul c_ULTIMATE.start_main_~i~0 (_ bv4 32)))) (let ((.cse1 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|) (bvadd |c_ULTIMATE.start_main_~#min~0.offset| .cse3)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~t~0 .cse1) (fp.sub c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|) (bvadd |c_ULTIMATE.start_main_~#max~0.offset| .cse3)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) .cse1)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) is different from false [2021-11-07 08:47:24,841 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse3 (bvmul c_ULTIMATE.start_main_~i~0 (_ bv4 32)))) (let ((.cse1 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|) (bvadd |c_ULTIMATE.start_main_~#min~0.offset| .cse3)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~t~0 .cse1) (fp.sub c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|) (bvadd |c_ULTIMATE.start_main_~#max~0.offset| .cse3)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) .cse1)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) is different from true [2021-11-07 08:47:39,608 WARN L860 $PredicateComparison]: unable to prove that (or (not (fp.leq c_ULTIMATE.start_main_~t~0 |c_ULTIMATE.start_main_#t~mem12|)) (let ((.cse0 (let ((.cse3 (bvmul c_ULTIMATE.start_main_~i~0 (_ bv4 32)))) (let ((.cse1 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|) (bvadd |c_ULTIMATE.start_main_~#min~0.offset| .cse3)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~t~0 .cse1) (fp.sub c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|) (bvadd |c_ULTIMATE.start_main_~#max~0.offset| .cse3)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) .cse1)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))))) is different from true [2021-11-07 08:47:51,439 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (bvmul c_ULTIMATE.start_main_~i~0 (_ bv4 32)))) (let ((.cse0 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|) (bvadd |c_ULTIMATE.start_main_~#max~0.offset| .cse4)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (not (fp.leq c_ULTIMATE.start_main_~t~0 .cse0)) (let ((.cse1 (let ((.cse2 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|) (bvadd |c_ULTIMATE.start_main_~#min~0.offset| .cse4)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~t~0 .cse2) (fp.sub c_currentRoundingMode .cse0 .cse2))))) (and (fp.geq .cse1 (_ +zero 8 24)) (fp.leq .cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))))))) is different from false [2021-11-07 08:48:06,516 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (bvmul c_ULTIMATE.start_main_~i~0 (_ bv4 32)))) (let ((.cse2 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|) (bvadd |c_ULTIMATE.start_main_~#max~0.offset| (_ bv4 32) .cse4)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (let ((.cse0 (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0.offset| .cse4)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~t~0 .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)) (fp.geq .cse0 (_ +zero 8 24)))) (not (fp.leq c_ULTIMATE.start_main_~t~0 .cse2))))) is different from false [2021-11-07 08:48:25,807 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (bvmul c_ULTIMATE.start_main_~i~0 (_ bv4 32)))) (let ((.cse2 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|) (bvadd |c_ULTIMATE.start_main_~#max~0.offset| (_ bv4 32) .cse4)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (let ((.cse0 (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0.offset| .cse4)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~t~0 .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)) (fp.geq .cse0 (_ +zero 8 24)))) (not (fp.leq c_ULTIMATE.start_main_~t~0 .cse2)) (fp.leq c_ULTIMATE.start_main_~t~0 |c_ULTIMATE.start_main_#t~mem12|)))) is different from false [2021-11-07 08:48:27,862 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 (bvmul c_ULTIMATE.start_main_~i~0 (_ bv4 32)))) (let ((.cse2 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|) (bvadd |c_ULTIMATE.start_main_~#max~0.offset| (_ bv4 32) .cse4)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (let ((.cse0 (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0.offset| .cse4)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~t~0 .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)) (fp.geq .cse0 (_ +zero 8 24)))) (not (fp.leq c_ULTIMATE.start_main_~t~0 .cse2)) (fp.leq c_ULTIMATE.start_main_~t~0 |c_ULTIMATE.start_main_#t~mem12|)))) is different from true [2021-11-07 08:48:42,826 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|)) (.cse4 (bvmul c_ULTIMATE.start_main_~i~0 (_ bv4 32)))) (let ((.cse2 (let ((.cse7 (select .cse6 (bvadd |c_ULTIMATE.start_main_~#max~0.offset| (_ bv4 32) .cse4)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (or (let ((.cse0 (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0.offset| .cse4)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~t~0 .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)) (fp.geq .cse0 (_ +zero 8 24)))) (not (fp.leq c_ULTIMATE.start_main_~t~0 .cse2)) (fp.leq c_ULTIMATE.start_main_~t~0 (let ((.cse5 (select .cse6 (bvadd |c_ULTIMATE.start_main_~#max~0.offset| .cse4)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))))) is different from false [2021-11-07 08:48:44,884 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|)) (.cse4 (bvmul c_ULTIMATE.start_main_~i~0 (_ bv4 32)))) (let ((.cse2 (let ((.cse7 (select .cse6 (bvadd |c_ULTIMATE.start_main_~#max~0.offset| (_ bv4 32) .cse4)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (or (let ((.cse0 (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0.offset| .cse4)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~t~0 .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)) (fp.geq .cse0 (_ +zero 8 24)))) (not (fp.leq c_ULTIMATE.start_main_~t~0 .cse2)) (fp.leq c_ULTIMATE.start_main_~t~0 (let ((.cse5 (select .cse6 (bvadd |c_ULTIMATE.start_main_~#max~0.offset| .cse4)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))))) is different from true