./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/float-benchs/filter1_true-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_36d39713-4714-4156-a954-2ccea157486b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_36d39713-4714-4156-a954-2ccea157486b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_36d39713-4714-4156-a954-2ccea157486b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_36d39713-4714-4156-a954-2ccea157486b/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/filter1_true-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_36d39713-4714-4156-a954-2ccea157486b/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_36d39713-4714-4156-a954-2ccea157486b/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 20183bacfea343fcbafe493366fbda56f082cdb8 ................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_36d39713-4714-4156-a954-2ccea157486b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_36d39713-4714-4156-a954-2ccea157486b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_36d39713-4714-4156-a954-2ccea157486b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_36d39713-4714-4156-a954-2ccea157486b/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/filter1_true-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_36d39713-4714-4156-a954-2ccea157486b/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_36d39713-4714-4156-a954-2ccea157486b/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 20183bacfea343fcbafe493366fbda56f082cdb8 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 09:32:29,871 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 09:32:29,872 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 09:32:29,880 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 09:32:29,880 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 09:32:29,881 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 09:32:29,882 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 09:32:29,883 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 09:32:29,884 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 09:32:29,885 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 09:32:29,886 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 09:32:29,886 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 09:32:29,887 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 09:32:29,887 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 09:32:29,888 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 09:32:29,889 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 09:32:29,890 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 09:32:29,892 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 09:32:29,893 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 09:32:29,894 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 09:32:29,895 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 09:32:29,896 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 09:32:29,897 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 09:32:29,897 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 09:32:29,898 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 09:32:29,898 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 09:32:29,899 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 09:32:29,899 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 09:32:29,900 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 09:32:29,901 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 09:32:29,901 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 09:32:29,902 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 09:32:29,902 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 09:32:29,902 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 09:32:29,903 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 09:32:29,904 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 09:32:29,904 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_36d39713-4714-4156-a954-2ccea157486b/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-18 09:32:29,915 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 09:32:29,915 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 09:32:29,916 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 09:32:29,916 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 09:32:29,917 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 09:32:29,917 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 09:32:29,917 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 09:32:29,917 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 09:32:29,918 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 09:32:29,918 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 09:32:29,918 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 09:32:29,918 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 09:32:29,918 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 09:32:29,918 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 09:32:29,918 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 09:32:29,918 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 09:32:29,919 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 09:32:29,919 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 09:32:29,919 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 09:32:29,919 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 09:32:29,919 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 09:32:29,919 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 09:32:29,919 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 09:32:29,919 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 09:32:29,920 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 09:32:29,920 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 09:32:29,920 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 09:32:29,920 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 09:32:29,920 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 09:32:29,920 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 09:32:29,923 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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-vcloud-master/worker/working_dir_36d39713-4714-4156-a954-2ccea157486b/bin-2019/uautomizer 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(__VERIFIER_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 -> 20183bacfea343fcbafe493366fbda56f082cdb8 [2018-11-18 09:32:29,949 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 09:32:29,958 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 09:32:29,961 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 09:32:29,963 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 09:32:29,963 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 09:32:29,963 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_36d39713-4714-4156-a954-2ccea157486b/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/filter1_true-unreach-call_true-termination.c [2018-11-18 09:32:30,009 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_36d39713-4714-4156-a954-2ccea157486b/bin-2019/uautomizer/data/31d0d541f/8bb58f2e27d041e79c3aedba69f661df/FLAGff500de50 [2018-11-18 09:32:30,352 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 09:32:30,353 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_36d39713-4714-4156-a954-2ccea157486b/sv-benchmarks/c/float-benchs/filter1_true-unreach-call_true-termination.c [2018-11-18 09:32:30,358 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_36d39713-4714-4156-a954-2ccea157486b/bin-2019/uautomizer/data/31d0d541f/8bb58f2e27d041e79c3aedba69f661df/FLAGff500de50 [2018-11-18 09:32:30,369 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_36d39713-4714-4156-a954-2ccea157486b/bin-2019/uautomizer/data/31d0d541f/8bb58f2e27d041e79c3aedba69f661df [2018-11-18 09:32:30,372 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 09:32:30,373 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 09:32:30,374 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 09:32:30,374 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 09:32:30,377 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 09:32:30,377 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:32:30" (1/1) ... [2018-11-18 09:32:30,380 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27f427c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:30, skipping insertion in model container [2018-11-18 09:32:30,380 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:32:30" (1/1) ... [2018-11-18 09:32:30,388 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 09:32:30,405 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 09:32:30,515 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:32:30,517 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 09:32:30,528 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:32:30,536 INFO L195 MainTranslator]: Completed translation [2018-11-18 09:32:30,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:30 WrapperNode [2018-11-18 09:32:30,536 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 09:32:30,536 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 09:32:30,537 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 09:32:30,537 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 09:32:30,544 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:30" (1/1) ... [2018-11-18 09:32:30,544 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:30" (1/1) ... [2018-11-18 09:32:30,547 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:30" (1/1) ... [2018-11-18 09:32:30,547 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:30" (1/1) ... [2018-11-18 09:32:30,550 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:30" (1/1) ... [2018-11-18 09:32:30,553 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:30" (1/1) ... [2018-11-18 09:32:30,554 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:30" (1/1) ... [2018-11-18 09:32:30,555 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 09:32:30,555 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 09:32:30,555 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 09:32:30,555 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 09:32:30,556 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_36d39713-4714-4156-a954-2ccea157486b/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 09:32:30,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 09:32:30,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 09:32:30,622 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 09:32:30,622 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 09:32:30,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 09:32:30,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 09:32:30,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-11-18 09:32:30,623 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-18 09:32:30,623 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 09:32:30,623 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 09:32:30,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 09:32:30,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 09:32:30,713 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 09:32:30,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:32:30 BoogieIcfgContainer [2018-11-18 09:32:30,714 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 09:32:30,714 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 09:32:30,714 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 09:32:30,717 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 09:32:30,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:32:30" (1/3) ... [2018-11-18 09:32:30,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e70a7e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:32:30, skipping insertion in model container [2018-11-18 09:32:30,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:30" (2/3) ... [2018-11-18 09:32:30,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e70a7e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:32:30, skipping insertion in model container [2018-11-18 09:32:30,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:32:30" (3/3) ... [2018-11-18 09:32:30,720 INFO L112 eAbstractionObserver]: Analyzing ICFG filter1_true-unreach-call_true-termination.c [2018-11-18 09:32:30,726 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 09:32:30,731 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 09:32:30,740 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 09:32:30,758 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 09:32:30,758 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 09:32:30,758 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 09:32:30,758 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 09:32:30,758 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 09:32:30,758 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 09:32:30,758 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 09:32:30,758 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 09:32:30,758 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 09:32:30,772 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-11-18 09:32:30,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-18 09:32:30,777 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:32:30,777 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:32:30,779 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:32:30,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:32:30,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1867248710, now seen corresponding path program 1 times [2018-11-18 09:32:30,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:32:30,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:32:30,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:32:30,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:32:30,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:32:30,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:32:30,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:32:30,858 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 09:32:30,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 09:32:30 BoogieIcfgContainer [2018-11-18 09:32:30,872 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 09:32:30,872 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 09:32:30,872 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 09:32:30,872 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 09:32:30,872 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:32:30" (3/4) ... [2018-11-18 09:32:30,875 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 09:32:30,875 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 09:32:30,876 INFO L168 Benchmark]: Toolchain (without parser) took 503.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -143.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:32:30,878 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:32:30,878 INFO L168 Benchmark]: CACSL2BoogieTranslator took 162.65 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 948.4 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-11-18 09:32:30,879 INFO L168 Benchmark]: Boogie Preprocessor took 18.38 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 09:32:30,879 INFO L168 Benchmark]: RCFGBuilder took 158.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -178.1 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-18 09:32:30,880 INFO L168 Benchmark]: TraceAbstraction took 157.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2018-11-18 09:32:30,880 INFO L168 Benchmark]: Witness Printer took 3.49 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:32:30,883 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 162.65 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 948.4 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.38 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 158.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -178.1 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 157.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.49 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 12]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 26, overapproximation of to_real at line 29. Possible FailurePath: [L17] double E0, E1, S; [L18] int i; [L20] E1 = 0 [L21] S = 0 [L23] i = 0 VAL [i=0] [L23] COND TRUE i <= 1000000 [L25] E0 = __VERIFIER_nondet_double() [L28] COND TRUE __VERIFIER_nondet_int() [L29] S = 0 VAL [E0=2, i=0] [L34] E1 = E0 VAL [E0=2, E1=2, i=0] [L36] CALL __VERIFIER_assert(S >= -10000. && S <= 10000.) VAL [\old(cond)=0] [L12] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L12] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 22 locations, 1 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 13 NumberOfCodeBlocks, 13 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-5842f4b [2018-11-18 09:32:32,380 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 09:32:32,381 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 09:32:32,390 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 09:32:32,390 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 09:32:32,391 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 09:32:32,391 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 09:32:32,393 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 09:32:32,394 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 09:32:32,394 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 09:32:32,395 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 09:32:32,395 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 09:32:32,396 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 09:32:32,396 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 09:32:32,397 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 09:32:32,398 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 09:32:32,398 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 09:32:32,399 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 09:32:32,401 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 09:32:32,402 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 09:32:32,403 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 09:32:32,403 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 09:32:32,405 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 09:32:32,405 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 09:32:32,406 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 09:32:32,406 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 09:32:32,407 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 09:32:32,407 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 09:32:32,408 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 09:32:32,409 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 09:32:32,409 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 09:32:32,409 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 09:32:32,409 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 09:32:32,410 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 09:32:32,410 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 09:32:32,411 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 09:32:32,411 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_36d39713-4714-4156-a954-2ccea157486b/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-18 09:32:32,421 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 09:32:32,421 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 09:32:32,422 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 09:32:32,422 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 09:32:32,423 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 09:32:32,423 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 09:32:32,423 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 09:32:32,423 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 09:32:32,423 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 09:32:32,423 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 09:32:32,423 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 09:32:32,424 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 09:32:32,424 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 09:32:32,424 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 09:32:32,424 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 09:32:32,424 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 09:32:32,424 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 09:32:32,424 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 09:32:32,424 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 09:32:32,425 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 09:32:32,425 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 09:32:32,425 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 09:32:32,425 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 09:32:32,425 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 09:32:32,425 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 09:32:32,425 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 09:32:32,426 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 09:32:32,426 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 09:32:32,426 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-18 09:32:32,426 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 09:32:32,426 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 09:32:32,426 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 09:32:32,426 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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-vcloud-master/worker/working_dir_36d39713-4714-4156-a954-2ccea157486b/bin-2019/uautomizer 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(__VERIFIER_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 -> 20183bacfea343fcbafe493366fbda56f082cdb8 [2018-11-18 09:32:32,458 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 09:32:32,467 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 09:32:32,470 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 09:32:32,471 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 09:32:32,472 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 09:32:32,472 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_36d39713-4714-4156-a954-2ccea157486b/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/filter1_true-unreach-call_true-termination.c [2018-11-18 09:32:32,512 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_36d39713-4714-4156-a954-2ccea157486b/bin-2019/uautomizer/data/8d3d4368f/f2735dd0232848a580ad37739a2e7dd2/FLAG6074404a3 [2018-11-18 09:32:32,840 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 09:32:32,840 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_36d39713-4714-4156-a954-2ccea157486b/sv-benchmarks/c/float-benchs/filter1_true-unreach-call_true-termination.c [2018-11-18 09:32:32,844 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_36d39713-4714-4156-a954-2ccea157486b/bin-2019/uautomizer/data/8d3d4368f/f2735dd0232848a580ad37739a2e7dd2/FLAG6074404a3 [2018-11-18 09:32:33,270 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_36d39713-4714-4156-a954-2ccea157486b/bin-2019/uautomizer/data/8d3d4368f/f2735dd0232848a580ad37739a2e7dd2 [2018-11-18 09:32:33,273 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 09:32:33,274 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 09:32:33,275 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 09:32:33,275 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 09:32:33,278 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 09:32:33,278 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:32:33" (1/1) ... [2018-11-18 09:32:33,280 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bd23e32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:33, skipping insertion in model container [2018-11-18 09:32:33,281 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:32:33" (1/1) ... [2018-11-18 09:32:33,289 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 09:32:33,304 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 09:32:33,435 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:32:33,440 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 09:32:33,451 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:32:33,460 INFO L195 MainTranslator]: Completed translation [2018-11-18 09:32:33,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:33 WrapperNode [2018-11-18 09:32:33,460 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 09:32:33,461 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 09:32:33,461 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 09:32:33,461 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 09:32:33,470 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:33" (1/1) ... [2018-11-18 09:32:33,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:33" (1/1) ... [2018-11-18 09:32:33,475 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:33" (1/1) ... [2018-11-18 09:32:33,475 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:33" (1/1) ... [2018-11-18 09:32:33,479 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:33" (1/1) ... [2018-11-18 09:32:33,482 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:33" (1/1) ... [2018-11-18 09:32:33,483 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:33" (1/1) ... [2018-11-18 09:32:33,485 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 09:32:33,486 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 09:32:33,486 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 09:32:33,486 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 09:32:33,487 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_36d39713-4714-4156-a954-2ccea157486b/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 09:32:33,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 09:32:33,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 09:32:33,572 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 09:32:33,573 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 09:32:33,573 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 09:32:33,573 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 09:32:33,573 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-11-18 09:32:33,573 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-18 09:32:33,573 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 09:32:33,573 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 09:32:33,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 09:32:33,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 09:32:34,195 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 09:32:34,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:32:34 BoogieIcfgContainer [2018-11-18 09:32:34,196 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 09:32:34,196 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 09:32:34,196 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 09:32:34,199 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 09:32:34,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:32:33" (1/3) ... [2018-11-18 09:32:34,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ad1574b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:32:34, skipping insertion in model container [2018-11-18 09:32:34,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:33" (2/3) ... [2018-11-18 09:32:34,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ad1574b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:32:34, skipping insertion in model container [2018-11-18 09:32:34,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:32:34" (3/3) ... [2018-11-18 09:32:34,202 INFO L112 eAbstractionObserver]: Analyzing ICFG filter1_true-unreach-call_true-termination.c [2018-11-18 09:32:34,208 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 09:32:34,212 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 09:32:34,221 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 09:32:34,239 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 09:32:34,240 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 09:32:34,240 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 09:32:34,240 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 09:32:34,240 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 09:32:34,240 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 09:32:34,240 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 09:32:34,240 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 09:32:34,241 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 09:32:34,252 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-11-18 09:32:34,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-18 09:32:34,256 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:32:34,257 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:32:34,258 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:32:34,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:32:34,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1867248710, now seen corresponding path program 1 times [2018-11-18 09:32:34,264 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 09:32:34,264 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_36d39713-4714-4156-a954-2ccea157486b/bin-2019/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-11-18 09:32:34,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:32:34,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:32:34,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:32:34,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:32:34,362 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 09:32:34,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:32:34,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 09:32:34,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 09:32:34,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 09:32:34,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:32:34,382 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 5 states. [2018-11-18 09:32:35,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:32:35,319 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2018-11-18 09:32:35,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 09:32:35,321 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-18 09:32:35,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:32:35,326 INFO L225 Difference]: With dead ends: 52 [2018-11-18 09:32:35,326 INFO L226 Difference]: Without dead ends: 27 [2018-11-18 09:32:35,328 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 09:32:35,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-18 09:32:35,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2018-11-18 09:32:35,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-18 09:32:35,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-11-18 09:32:35,353 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 13 [2018-11-18 09:32:35,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:32:35,353 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-18 09:32:35,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 09:32:35,353 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-11-18 09:32:35,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-18 09:32:35,354 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:32:35,354 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:32:35,356 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:32:35,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:32:35,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1924507012, now seen corresponding path program 1 times [2018-11-18 09:32:35,357 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 09:32:35,358 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_36d39713-4714-4156-a954-2ccea157486b/bin-2019/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-11-18 09:32:35,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:32:35,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:32:35,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:32:35,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:32:35,811 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 09:32:35,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:32:35,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 09:32:35,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 09:32:35,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 09:32:35,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-18 09:32:35,829 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 7 states. [2018-11-18 09:32:39,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:32:39,709 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-11-18 09:32:39,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 09:32:39,737 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-11-18 09:32:39,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:32:39,739 INFO L225 Difference]: With dead ends: 39 [2018-11-18 09:32:39,739 INFO L226 Difference]: Without dead ends: 37 [2018-11-18 09:32:39,740 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-18 09:32:39,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-18 09:32:39,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2018-11-18 09:32:39,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-18 09:32:39,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-11-18 09:32:39,744 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 13 [2018-11-18 09:32:39,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:32:39,744 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-18 09:32:39,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 09:32:39,745 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-18 09:32:39,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 09:32:39,745 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:32:39,745 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:32:39,746 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:32:39,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:32:39,746 INFO L82 PathProgramCache]: Analyzing trace with hash 521295018, now seen corresponding path program 1 times [2018-11-18 09:32:39,746 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 09:32:39,746 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_36d39713-4714-4156-a954-2ccea157486b/bin-2019/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-11-18 09:32:39,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:32:40,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:32:40,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:32:42,417 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~E1~0 (_ FloatingPoint 11 53)) (main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 (fp.neg .cse0))) (and (fp.leq main_~E1~0 .cse0) (= (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) main_~E0~0) main_~E1~0) c_main_~S~0) (fp.geq main_~E1~0 .cse1) (fp.leq main_~E0~0 .cse0) (fp.geq main_~E0~0 .cse1))))) is different from true [2018-11-18 09:33:15,790 WARN L180 SmtUtils]: Spent 21.05 s on a formula simplification that was a NOOP. DAG size: 44 [2018-11-18 09:33:54,365 WARN L180 SmtUtils]: Spent 26.82 s on a formula simplification. DAG size of input: 44 DAG size of output: 30 [2018-11-18 09:34:00,392 WARN L832 $PredicateComparison]: unable to prove that (exists ((main_~E1~0 (_ FloatingPoint 11 53)) (main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 (fp.neg .cse0))) (and (fp.leq main_~E1~0 .cse0) (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) main_~E0~0) main_~E1~0) ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (fp.geq main_~E1~0 .cse1) (fp.leq main_~E0~0 .cse0) (fp.geq main_~E0~0 .cse1))))) is different from false [2018-11-18 09:34:02,401 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~E1~0 (_ FloatingPoint 11 53)) (main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 (fp.neg .cse0))) (and (fp.leq main_~E1~0 .cse0) (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) main_~E0~0) main_~E1~0) ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (fp.geq main_~E1~0 .cse1) (fp.leq main_~E0~0 .cse0) (fp.geq main_~E0~0 .cse1))))) is different from true [2018-11-18 09:34:02,404 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-11-18 09:34:02,404 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 09:34:09,985 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) c_main_~S~0) c_main_~E0~0) c_main_~E1~0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from false [2018-11-18 09:34:12,020 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) c_main_~S~0) c_main_~E0~0) c_main_~E1~0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from true [2018-11-18 09:34:14,077 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_main_~E0~0_5 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (not (fp.leq v_main_~E0~0_5 .cse0)) (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) c_main_~S~0) v_main_~E0~0_5) c_main_~E1~0) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (not (fp.geq v_main_~E0~0_5 (fp.neg .cse0)))))) (forall ((v_prenex_4 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (not (fp.geq v_prenex_4 (fp.neg .cse1))) (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) c_main_~S~0) v_prenex_4) c_main_~E1~0) ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)) (not (fp.leq v_prenex_4 .cse1)))))) is different from true [2018-11-18 09:34:14,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:34:14,103 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_36d39713-4714-4156-a954-2ccea157486b/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:34:14,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:34:18,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:34:18,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:34:42,098 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-11-18 09:34:42,098 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 09:34:44,147 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|main_#t~nondet1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (not (fp.geq |main_#t~nondet1| (fp.neg .cse0))) (not (fp.leq |main_#t~nondet1| .cse0)) (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) c_main_~S~0) |main_#t~nondet1|) c_main_~E1~0) ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))))) (forall ((v_prenex_8 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (not (fp.leq v_prenex_8 .cse1)) (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) c_main_~S~0) v_prenex_8) c_main_~E1~0) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (not (fp.geq v_prenex_8 (fp.neg .cse1))))))) is different from true [2018-11-18 09:34:44,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:34:44,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-18 09:34:44,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 09:34:44,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 09:34:44,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=85, Unknown=9, NotChecked=110, Total=240 [2018-11-18 09:34:44,182 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 10 states. [2018-11-18 09:34:57,489 WARN L180 SmtUtils]: Spent 2.50 s on a formula simplification that was a NOOP. DAG size: 22 [2018-11-18 09:35:44,701 WARN L180 SmtUtils]: Spent 40.23 s on a formula simplification that was a NOOP. DAG size: 51 [2018-11-18 09:35:50,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:35:50,845 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-11-18 09:35:50,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 09:35:50,846 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-11-18 09:35:50,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:35:50,847 INFO L225 Difference]: With dead ends: 41 [2018-11-18 09:35:50,847 INFO L226 Difference]: Without dead ends: 39 [2018-11-18 09:35:50,848 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 132.9s TimeCoverageRelationStatistics Valid=43, Invalid=118, Unknown=15, NotChecked=130, Total=306 [2018-11-18 09:35:50,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-18 09:35:50,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-11-18 09:35:50,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-18 09:35:50,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-11-18 09:35:50,861 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 23 [2018-11-18 09:35:50,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:35:50,862 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-11-18 09:35:50,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 09:35:50,862 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-18 09:35:50,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 09:35:50,864 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:35:50,864 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:35:50,865 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:35:50,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:35:50,865 INFO L82 PathProgramCache]: Analyzing trace with hash -499773336, now seen corresponding path program 1 times [2018-11-18 09:35:50,865 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 09:35:50,865 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_36d39713-4714-4156-a954-2ccea157486b/bin-2019/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-11-18 09:35:50,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:35:51,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:35:51,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:35:54,250 WARN L832 $PredicateComparison]: unable to prove that (exists ((main_~E1~0 (_ FloatingPoint 11 53)) (main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 (fp.neg .cse0))) (and (fp.leq main_~E1~0 .cse0) (fp.geq main_~E1~0 .cse1) (fp.leq main_~E0~0 .cse0) (= (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)))) (fp.mul roundNearestTiesToEven .cse2 (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse3) main_~E1~0) .cse3)))) main_~E0~0) main_~E1~0) c_main_~S~0) (fp.geq main_~E0~0 .cse1))))) is different from false [2018-11-18 09:35:56,282 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~E1~0 (_ FloatingPoint 11 53)) (main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 (fp.neg .cse0))) (and (fp.leq main_~E1~0 .cse0) (fp.geq main_~E1~0 .cse1) (fp.leq main_~E0~0 .cse0) (= (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)))) (fp.mul roundNearestTiesToEven .cse2 (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse3) main_~E1~0) .cse3)))) main_~E0~0) main_~E1~0) c_main_~S~0) (fp.geq main_~E0~0 .cse1))))) is different from true [2018-11-18 09:36:12,607 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse4 (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (or (and (exists ((v_prenex_12 (_ FloatingPoint 11 53)) (v_prenex_13 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse3 (fp.neg .cse0))) (and (fp.leq v_prenex_12 .cse0) (fp.leq v_prenex_13 .cse0) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)))) (fp.mul roundNearestTiesToEven .cse1 (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) v_prenex_12) .cse2)))) v_prenex_13) v_prenex_12) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)))) (fp.geq v_prenex_12 .cse3) (fp.geq v_prenex_13 .cse3))))) .cse4) (and .cse4 (exists ((v_prenex_10 (_ FloatingPoint 11 53)) (v_prenex_9 (_ FloatingPoint 11 53))) (let ((.cse8 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse5 (fp.neg .cse8))) (and (fp.geq v_prenex_10 .cse5) (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)))) (fp.mul roundNearestTiesToEven .cse6 (let ((.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 .cse7) v_prenex_9) .cse7)))) v_prenex_10) v_prenex_9) ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (fp.leq v_prenex_10 .cse8) (fp.leq v_prenex_9 .cse8) (fp.geq v_prenex_9 .cse5)))))) (and (= (bvadd |c___VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32)) (exists ((main_~E1~0 (_ FloatingPoint 11 53)) (main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse11 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse12 (fp.neg .cse11)) (.cse9 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (let ((.cse13 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)))) (fp.mul roundNearestTiesToEven .cse13 (let ((.cse14 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse13 .cse14) main_~E1~0) .cse14)))) main_~E0~0) main_~E1~0)) (.cse10 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (and (fp.leq .cse9 .cse10) (fp.leq main_~E1~0 .cse11) (fp.geq main_~E1~0 .cse12) (fp.leq main_~E0~0 .cse11) (fp.geq main_~E0~0 .cse12) (fp.geq .cse9 (fp.neg .cse10))))))))) is different from false [2018-11-18 09:36:26,767 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (or (and .cse0 (exists ((v_prenex_10 (_ FloatingPoint 11 53)) (v_prenex_9 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 (fp.neg .cse4))) (and (fp.geq v_prenex_10 .cse1) (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)))) (fp.mul roundNearestTiesToEven .cse2 (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse3) v_prenex_9) .cse3)))) v_prenex_10) v_prenex_9) ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (fp.leq v_prenex_10 .cse4) (fp.leq v_prenex_9 .cse4) (fp.geq v_prenex_9 .cse1)))))) (and .cse0 (exists ((v_prenex_12 (_ FloatingPoint 11 53)) (v_prenex_13 (_ FloatingPoint 11 53))) (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse8 (fp.neg .cse5))) (and (fp.leq v_prenex_12 .cse5) (fp.leq v_prenex_13 .cse5) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)))) (fp.mul roundNearestTiesToEven .cse6 (let ((.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 .cse7) v_prenex_12) .cse7)))) v_prenex_13) v_prenex_12) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)))) (fp.geq v_prenex_12 .cse8) (fp.geq v_prenex_13 .cse8)))))) (= (bvadd c___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)))) is different from false [2018-11-18 09:36:36,989 WARN L832 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_12 (_ FloatingPoint 11 53)) (v_prenex_13 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse3 (fp.neg .cse0))) (and (fp.leq v_prenex_12 .cse0) (fp.leq v_prenex_13 .cse0) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)))) (fp.mul roundNearestTiesToEven .cse1 (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) v_prenex_12) .cse2)))) v_prenex_13) v_prenex_12) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)))) (fp.geq v_prenex_12 .cse3) (fp.geq v_prenex_13 .cse3))))) (exists ((v_prenex_10 (_ FloatingPoint 11 53)) (v_prenex_9 (_ FloatingPoint 11 53))) (let ((.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse4 (fp.neg .cse7))) (and (fp.geq v_prenex_10 .cse4) (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)))) (fp.mul roundNearestTiesToEven .cse5 (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 .cse6) v_prenex_9) .cse6)))) v_prenex_10) v_prenex_9) ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (fp.leq v_prenex_10 .cse7) (fp.leq v_prenex_9 .cse7) (fp.geq v_prenex_9 .cse4)))))) is different from false [2018-11-18 09:36:39,022 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_12 (_ FloatingPoint 11 53)) (v_prenex_13 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse3 (fp.neg .cse0))) (and (fp.leq v_prenex_12 .cse0) (fp.leq v_prenex_13 .cse0) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)))) (fp.mul roundNearestTiesToEven .cse1 (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) v_prenex_12) .cse2)))) v_prenex_13) v_prenex_12) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)))) (fp.geq v_prenex_12 .cse3) (fp.geq v_prenex_13 .cse3))))) (exists ((v_prenex_10 (_ FloatingPoint 11 53)) (v_prenex_9 (_ FloatingPoint 11 53))) (let ((.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse4 (fp.neg .cse7))) (and (fp.geq v_prenex_10 .cse4) (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)))) (fp.mul roundNearestTiesToEven .cse5 (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 .cse6) v_prenex_9) .cse6)))) v_prenex_10) v_prenex_9) ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (fp.leq v_prenex_10 .cse7) (fp.leq v_prenex_9 .cse7) (fp.geq v_prenex_9 .cse4)))))) is different from true [2018-11-18 09:36:39,026 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-11-18 09:36:39,026 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 09:36:41,137 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) c_main_~S~0) c_main_~E0~0) c_main_~E1~0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from false [2018-11-18 09:36:43,177 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) c_main_~S~0) c_main_~E0~0) c_main_~E1~0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from true [2018-11-18 09:36:45,238 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_main_~E0~0_7 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) c_main_~S~0) v_main_~E0~0_7) c_main_~E1~0) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (not (fp.geq v_main_~E0~0_7 (fp.neg .cse0))) (not (fp.leq v_main_~E0~0_7 .cse0))))) (forall ((v_prenex_15 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (not (fp.leq v_prenex_15 .cse1)) (not (fp.geq v_prenex_15 (fp.neg .cse1))) (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) c_main_~S~0) v_prenex_15) c_main_~E1~0) ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)))))) is different from true [2018-11-18 09:36:47,341 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (let ((.cse0 (not (fp.leq c_main_~S~0 .cse4))) (.cse2 (not (fp.geq c_main_~S~0 (fp.neg .cse4))))) (and (or .cse0 (forall ((v_main_~E0~0_7 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) c_main_~S~0) v_main_~E0~0_7) c_main_~E1~0) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (not (fp.geq v_main_~E0~0_7 (fp.neg .cse1))) (not (fp.leq v_main_~E0~0_7 .cse1))))) .cse2) (or .cse0 (forall ((v_prenex_15 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (not (fp.leq v_prenex_15 .cse3)) (not (fp.geq v_prenex_15 (fp.neg .cse3))) (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) c_main_~S~0) v_prenex_15) c_main_~E1~0) ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))))) .cse2)))) is different from true [2018-11-18 09:36:47,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:36:47,363 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_36d39713-4714-4156-a954-2ccea157486b/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:36:47,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:36:59,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2018-11-18 09:36:59,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-18 09:36:59,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-11-18 09:36:59,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 09:36:59,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 09:36:59,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=85, Unknown=10, NotChecked=168, Total=306 [2018-11-18 09:36:59,646 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 13 states. [2018-11-18 09:37:03,189 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (exists ((main_~E1~0 (_ FloatingPoint 11 53)) (main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 (fp.neg .cse0))) (and (fp.leq main_~E1~0 .cse0) (fp.geq main_~E1~0 .cse1) (fp.leq main_~E0~0 .cse0) (= (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)))) (fp.mul roundNearestTiesToEven .cse2 (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse3) main_~E1~0) .cse3)))) main_~E0~0) main_~E1~0) c_main_~S~0) (fp.geq main_~E0~0 .cse1))))) (fp.leq c_main_~E0~0 .cse4) (= (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) .cse5) c_main_~E0~0) .cse5)) c_main_~S~0) (fp.geq c_main_~E0~0 (fp.neg .cse4)))) is different from false [2018-11-18 09:37:05,250 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.leq c_main_~E1~0 .cse0) (fp.geq c_main_~E1~0 (fp.neg .cse0)) (= c_main_~S~0 (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) .cse1) c_main_~E1~0) .cse1))) (exists ((main_~E1~0 (_ FloatingPoint 11 53)) (main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse3 (fp.neg .cse2))) (and (fp.leq main_~E1~0 .cse2) (fp.geq main_~E1~0 .cse3) (fp.leq main_~E0~0 .cse2) (= (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)))) (fp.mul roundNearestTiesToEven .cse4 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse5) main_~E1~0) .cse5)))) main_~E0~0) main_~E1~0) c_main_~S~0) (fp.geq main_~E0~0 .cse3))))))) is different from false [2018-11-18 09:37:07,325 WARN L832 $PredicateComparison]: unable to prove that (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (let ((.cse0 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (or (and .cse0 (exists ((v_prenex_10 (_ FloatingPoint 11 53)) (v_prenex_9 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 (fp.neg .cse4))) (and (fp.geq v_prenex_10 .cse1) (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)))) (fp.mul roundNearestTiesToEven .cse2 (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse3) v_prenex_9) .cse3)))) v_prenex_10) v_prenex_9) ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (fp.leq v_prenex_10 .cse4) (fp.leq v_prenex_9 .cse4) (fp.geq v_prenex_9 .cse1)))))) (and .cse0 (exists ((v_prenex_12 (_ FloatingPoint 11 53)) (v_prenex_13 (_ FloatingPoint 11 53))) (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse8 (fp.neg .cse5))) (and (fp.leq v_prenex_12 .cse5) (fp.leq v_prenex_13 .cse5) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)))) (fp.mul roundNearestTiesToEven .cse6 (let ((.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 .cse7) v_prenex_12) .cse7)))) v_prenex_13) v_prenex_12) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)))) (fp.geq v_prenex_12 .cse8) (fp.geq v_prenex_13 .cse8)))))) (= (bvadd c___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))))) is different from false [2018-11-18 09:37:10,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:37:10,767 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2018-11-18 09:37:10,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 09:37:10,768 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2018-11-18 09:37:10,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:37:10,769 INFO L225 Difference]: With dead ends: 55 [2018-11-18 09:37:10,769 INFO L226 Difference]: Without dead ends: 53 [2018-11-18 09:37:10,769 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 27.0s TimeCoverageRelationStatistics Valid=54, Invalid=105, Unknown=13, NotChecked=290, Total=462 [2018-11-18 09:37:10,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-18 09:37:10,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 36. [2018-11-18 09:37:10,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-18 09:37:10,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2018-11-18 09:37:10,778 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 23 [2018-11-18 09:37:10,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:37:10,778 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2018-11-18 09:37:10,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 09:37:10,778 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2018-11-18 09:37:10,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 09:37:10,779 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:37:10,779 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:37:10,779 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:37:10,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:37:10,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1001818126, now seen corresponding path program 2 times [2018-11-18 09:37:10,780 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 09:37:10,780 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_36d39713-4714-4156-a954-2ccea157486b/bin-2019/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-11-18 09:37:10,787 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-18 09:37:11,958 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 09:37:11,958 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 09:37:12,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:37:14,234 WARN L832 $PredicateComparison]: unable to prove that (exists ((main_~E1~0 (_ FloatingPoint 11 53)) (main_~E0~0 (_ FloatingPoint 11 53)) (v_main_~S~0_17 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)) (.cse2 (fp.neg .cse1))) (and (fp.geq v_main_~S~0_17 (fp.neg .cse0)) (fp.leq main_~E1~0 .cse1) (= c_main_~S~0 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) v_main_~S~0_17) main_~E0~0) main_~E1~0)) (fp.geq main_~E1~0 .cse2) (fp.leq v_main_~S~0_17 .cse0) (fp.leq main_~E0~0 .cse1) (fp.geq main_~E0~0 .cse2))))) is different from false [2018-11-18 09:37:16,269 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~E1~0 (_ FloatingPoint 11 53)) (main_~E0~0 (_ FloatingPoint 11 53)) (v_main_~S~0_17 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)) (.cse2 (fp.neg .cse1))) (and (fp.geq v_main_~S~0_17 (fp.neg .cse0)) (fp.leq main_~E1~0 .cse1) (= c_main_~S~0 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) v_main_~S~0_17) main_~E0~0) main_~E1~0)) (fp.geq main_~E1~0 .cse2) (fp.leq v_main_~S~0_17 .cse0) (fp.leq main_~E0~0 .cse1) (fp.geq main_~E0~0 .cse2))))) is different from true [2018-11-18 09:37:32,610 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (or (and (exists ((v_prenex_16 (_ FloatingPoint 11 53)) (v_prenex_17 (_ FloatingPoint 11 53)) (v_prenex_19 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse2 (fp.neg .cse0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (and (fp.leq v_prenex_16 .cse0) (fp.leq v_prenex_17 .cse0) (fp.leq v_prenex_19 .cse1) (fp.geq v_prenex_16 .cse2) (fp.geq v_prenex_19 (fp.neg .cse1)) (fp.geq v_prenex_17 .cse2) (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) v_prenex_19) v_prenex_17) v_prenex_16) .cse1)))))) .cse3) (and (exists ((v_prenex_23 (_ FloatingPoint 11 53)) (v_prenex_21 (_ FloatingPoint 11 53)) (v_prenex_20 (_ FloatingPoint 11 53))) (let ((.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (let ((.cse4 (fp.neg .cse5)) (.cse6 (fp.neg .cse7))) (and (fp.geq v_prenex_23 .cse4) (fp.leq v_prenex_23 .cse5) (fp.geq v_prenex_21 .cse6) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) v_prenex_23) v_prenex_21) v_prenex_20) .cse4)) (fp.leq v_prenex_20 .cse7) (fp.leq v_prenex_21 .cse7) (fp.geq v_prenex_20 .cse6))))) .cse3) (and (= (bvadd |c___VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32)) (exists ((main_~E1~0 (_ FloatingPoint 11 53)) (main_~E0~0 (_ FloatingPoint 11 53)) (v_main_~S~0_17 (_ FloatingPoint 11 53))) (let ((.cse10 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse11 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (let ((.cse8 (fp.neg .cse11)) (.cse9 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) v_main_~S~0_17) main_~E0~0) main_~E1~0)) (.cse12 (fp.neg .cse10))) (and (fp.geq v_main_~S~0_17 .cse8) (fp.geq .cse9 .cse8) (fp.leq main_~E1~0 .cse10) (fp.leq .cse9 .cse11) (fp.geq main_~E1~0 .cse12) (fp.leq v_main_~S~0_17 .cse11) (fp.leq main_~E0~0 .cse10) (fp.geq main_~E0~0 .cse12)))))))) is different from false [2018-11-18 09:37:46,962 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse5 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (or (and (exists ((main_~E1~0 (_ FloatingPoint 11 53)) (main_~E0~0 (_ FloatingPoint 11 53)) (v_main_~S~0_17 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) v_main_~S~0_17) main_~E0~0) main_~E1~0)) (.cse4 (fp.neg .cse2))) (and (fp.geq v_main_~S~0_17 .cse0) (fp.geq .cse1 .cse0) (fp.leq main_~E1~0 .cse2) (fp.leq .cse1 .cse3) (fp.geq main_~E1~0 .cse4) (fp.leq v_main_~S~0_17 .cse3) (fp.leq main_~E0~0 .cse2) (fp.geq main_~E0~0 .cse4))))) (= (bvadd c___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))) (and .cse5 (exists ((v_prenex_16 (_ FloatingPoint 11 53)) (v_prenex_17 (_ FloatingPoint 11 53)) (v_prenex_19 (_ FloatingPoint 11 53))) (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse8 (fp.neg .cse6)) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (and (fp.leq v_prenex_16 .cse6) (fp.leq v_prenex_17 .cse6) (fp.leq v_prenex_19 .cse7) (fp.geq v_prenex_16 .cse8) (fp.geq v_prenex_19 (fp.neg .cse7)) (fp.geq v_prenex_17 .cse8) (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) v_prenex_19) v_prenex_17) v_prenex_16) .cse7))))))) (and .cse5 (exists ((v_prenex_23 (_ FloatingPoint 11 53)) (v_prenex_21 (_ FloatingPoint 11 53)) (v_prenex_20 (_ FloatingPoint 11 53))) (let ((.cse12 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse10 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (let ((.cse9 (fp.neg .cse10)) (.cse11 (fp.neg .cse12))) (and (fp.geq v_prenex_23 .cse9) (fp.leq v_prenex_23 .cse10) (fp.geq v_prenex_21 .cse11) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) v_prenex_23) v_prenex_21) v_prenex_20) .cse9)) (fp.leq v_prenex_20 .cse12) (fp.leq v_prenex_21 .cse12) (fp.geq v_prenex_20 .cse11)))))))) is different from false [2018-11-18 09:37:57,189 WARN L832 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_16 (_ FloatingPoint 11 53)) (v_prenex_17 (_ FloatingPoint 11 53)) (v_prenex_19 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse2 (fp.neg .cse0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (and (fp.leq v_prenex_16 .cse0) (fp.leq v_prenex_17 .cse0) (fp.leq v_prenex_19 .cse1) (fp.geq v_prenex_16 .cse2) (fp.geq v_prenex_19 (fp.neg .cse1)) (fp.geq v_prenex_17 .cse2) (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) v_prenex_19) v_prenex_17) v_prenex_16) .cse1)))))) (exists ((v_prenex_23 (_ FloatingPoint 11 53)) (v_prenex_21 (_ FloatingPoint 11 53)) (v_prenex_20 (_ FloatingPoint 11 53))) (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (let ((.cse3 (fp.neg .cse4)) (.cse5 (fp.neg .cse6))) (and (fp.geq v_prenex_23 .cse3) (fp.leq v_prenex_23 .cse4) (fp.geq v_prenex_21 .cse5) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) v_prenex_23) v_prenex_21) v_prenex_20) .cse3)) (fp.leq v_prenex_20 .cse6) (fp.leq v_prenex_21 .cse6) (fp.geq v_prenex_20 .cse5)))))) is different from false [2018-11-18 09:37:59,220 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_16 (_ FloatingPoint 11 53)) (v_prenex_17 (_ FloatingPoint 11 53)) (v_prenex_19 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse2 (fp.neg .cse0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (and (fp.leq v_prenex_16 .cse0) (fp.leq v_prenex_17 .cse0) (fp.leq v_prenex_19 .cse1) (fp.geq v_prenex_16 .cse2) (fp.geq v_prenex_19 (fp.neg .cse1)) (fp.geq v_prenex_17 .cse2) (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) v_prenex_19) v_prenex_17) v_prenex_16) .cse1)))))) (exists ((v_prenex_23 (_ FloatingPoint 11 53)) (v_prenex_21 (_ FloatingPoint 11 53)) (v_prenex_20 (_ FloatingPoint 11 53))) (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (let ((.cse3 (fp.neg .cse4)) (.cse5 (fp.neg .cse6))) (and (fp.geq v_prenex_23 .cse3) (fp.leq v_prenex_23 .cse4) (fp.geq v_prenex_21 .cse5) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) v_prenex_23) v_prenex_21) v_prenex_20) .cse3)) (fp.leq v_prenex_20 .cse6) (fp.leq v_prenex_21 .cse6) (fp.geq v_prenex_20 .cse5)))))) is different from true [2018-11-18 09:37:59,223 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2018-11-18 09:37:59,223 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 09:38:01,301 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) c_main_~S~0) c_main_~E0~0) c_main_~E1~0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from false [2018-11-18 09:38:04,402 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_main_~E0~0_8 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) c_main_~S~0) v_main_~E0~0_8) c_main_~E1~0) ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)) (not (fp.leq v_main_~E0~0_8 .cse0)) (not (fp.geq v_main_~E0~0_8 (fp.neg .cse0)))))) (forall ((v_prenex_24 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) c_main_~S~0) v_prenex_24) c_main_~E1~0) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (not (fp.geq v_prenex_24 (fp.neg .cse1))) (not (fp.leq v_prenex_24 .cse1)))))) is different from true [2018-11-18 09:38:06,466 WARN L832 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_26 (_ FloatingPoint 11 53)) (v_prenex_24 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (let ((.cse1 (fp.neg .cse2)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (not (fp.geq v_prenex_24 (fp.neg .cse0))) (not (fp.geq v_prenex_26 .cse1)) (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) v_prenex_26) v_prenex_24) c_main_~E1~0) .cse1) (not (fp.leq v_prenex_24 .cse0)) (not (fp.leq v_prenex_26 .cse2)))))) (forall ((v_main_~E0~0_8 (_ FloatingPoint 11 53)) (main_~S~0 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) main_~S~0) v_main_~E0~0_8) c_main_~E1~0) .cse3) (not (fp.leq main_~S~0 .cse3)) (not (fp.leq v_main_~E0~0_8 .cse4)) (not (fp.geq main_~S~0 (fp.neg .cse3))) (not (fp.geq v_main_~E0~0_8 (fp.neg .cse4))))))) is different from false [2018-11-18 09:38:08,528 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_26 (_ FloatingPoint 11 53)) (v_prenex_24 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (let ((.cse1 (fp.neg .cse2)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (not (fp.geq v_prenex_24 (fp.neg .cse0))) (not (fp.geq v_prenex_26 .cse1)) (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) v_prenex_26) v_prenex_24) c_main_~E1~0) .cse1) (not (fp.leq v_prenex_24 .cse0)) (not (fp.leq v_prenex_26 .cse2)))))) (forall ((v_main_~E0~0_8 (_ FloatingPoint 11 53)) (main_~S~0 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) main_~S~0) v_main_~E0~0_8) c_main_~E1~0) .cse3) (not (fp.leq main_~S~0 .cse3)) (not (fp.leq v_main_~E0~0_8 .cse4)) (not (fp.geq main_~S~0 (fp.neg .cse3))) (not (fp.geq v_main_~E0~0_8 (fp.neg .cse4))))))) is different from true [2018-11-18 09:38:08,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:38:08,542 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_36d39713-4714-4156-a954-2ccea157486b/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:38:08,548 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 09:38:23,333 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 09:38:23,333 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2018-11-18 09:38:23,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-18 09:38:23,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-11-18 09:38:23,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 09:38:23,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 09:38:23,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=71, Unknown=10, NotChecked=154, Total=272 [2018-11-18 09:38:23,492 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 12 states. [2018-11-18 09:38:27,653 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (exists ((main_~E1~0 (_ FloatingPoint 11 53)) (main_~E0~0 (_ FloatingPoint 11 53)) (v_main_~S~0_17 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)) (.cse2 (fp.neg .cse1))) (and (fp.geq v_main_~S~0_17 (fp.neg .cse0)) (fp.leq main_~E1~0 .cse1) (= c_main_~S~0 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) v_main_~S~0_17) main_~E0~0) main_~E1~0)) (fp.geq main_~E1~0 .cse2) (fp.leq v_main_~S~0_17 .cse0) (fp.leq main_~E0~0 .cse1) (fp.geq main_~E0~0 .cse2))))) (fp.leq c_main_~E0~0 .cse3) (fp.geq c_main_~E0~0 (fp.neg .cse3)))) is different from false [2018-11-18 09:38:29,707 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.leq c_main_~E1~0 .cse0) (exists ((main_~E1~0 (_ FloatingPoint 11 53)) (main_~E0~0 (_ FloatingPoint 11 53)) (v_main_~S~0_17 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)) (.cse3 (fp.neg .cse2))) (and (fp.geq v_main_~S~0_17 (fp.neg .cse1)) (fp.leq main_~E1~0 .cse2) (= c_main_~S~0 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) v_main_~S~0_17) main_~E0~0) main_~E1~0)) (fp.geq main_~E1~0 .cse3) (fp.leq v_main_~S~0_17 .cse1) (fp.leq main_~E0~0 .cse2) (fp.geq main_~E0~0 .cse3))))) (fp.geq c_main_~E1~0 (fp.neg .cse0)))) is different from false [2018-11-18 09:38:31,833 WARN L832 $PredicateComparison]: unable to prove that (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (let ((.cse5 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (or (and (exists ((main_~E1~0 (_ FloatingPoint 11 53)) (main_~E0~0 (_ FloatingPoint 11 53)) (v_main_~S~0_17 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) v_main_~S~0_17) main_~E0~0) main_~E1~0)) (.cse4 (fp.neg .cse2))) (and (fp.geq v_main_~S~0_17 .cse0) (fp.geq .cse1 .cse0) (fp.leq main_~E1~0 .cse2) (fp.leq .cse1 .cse3) (fp.geq main_~E1~0 .cse4) (fp.leq v_main_~S~0_17 .cse3) (fp.leq main_~E0~0 .cse2) (fp.geq main_~E0~0 .cse4))))) (= (bvadd c___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))) (and .cse5 (exists ((v_prenex_16 (_ FloatingPoint 11 53)) (v_prenex_17 (_ FloatingPoint 11 53)) (v_prenex_19 (_ FloatingPoint 11 53))) (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse8 (fp.neg .cse6)) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (and (fp.leq v_prenex_16 .cse6) (fp.leq v_prenex_17 .cse6) (fp.leq v_prenex_19 .cse7) (fp.geq v_prenex_16 .cse8) (fp.geq v_prenex_19 (fp.neg .cse7)) (fp.geq v_prenex_17 .cse8) (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) v_prenex_19) v_prenex_17) v_prenex_16) .cse7))))))) (and .cse5 (exists ((v_prenex_23 (_ FloatingPoint 11 53)) (v_prenex_21 (_ FloatingPoint 11 53)) (v_prenex_20 (_ FloatingPoint 11 53))) (let ((.cse12 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse10 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (let ((.cse9 (fp.neg .cse10)) (.cse11 (fp.neg .cse12))) (and (fp.geq v_prenex_23 .cse9) (fp.leq v_prenex_23 .cse10) (fp.geq v_prenex_21 .cse11) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) v_prenex_23) v_prenex_21) v_prenex_20) .cse9)) (fp.leq v_prenex_20 .cse12) (fp.leq v_prenex_21 .cse12) (fp.geq v_prenex_20 .cse11))))))))) is different from false [2018-11-18 09:38:31,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:38:31,858 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-11-18 09:38:31,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 09:38:31,859 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2018-11-18 09:38:31,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:38:31,859 INFO L225 Difference]: With dead ends: 45 [2018-11-18 09:38:31,859 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 09:38:31,860 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 28.0s TimeCoverageRelationStatistics Valid=48, Invalid=89, Unknown=13, NotChecked=270, Total=420 [2018-11-18 09:38:31,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 09:38:31,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 09:38:31,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 09:38:31,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 09:38:31,861 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2018-11-18 09:38:31,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:38:31,861 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 09:38:31,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 09:38:31,861 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 09:38:31,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 09:38:31,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 09:40:55,567 WARN L180 SmtUtils]: Spent 2.39 m on a formula simplification. DAG size of input: 201 DAG size of output: 1 [2018-11-18 09:43:16,545 WARN L180 SmtUtils]: Spent 2.35 m on a formula simplification. DAG size of input: 56 DAG size of output: 31 [2018-11-18 09:43:16,698 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 23 [2018-11-18 09:43:16,700 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-18 09:43:16,700 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 09:43:16,700 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 09:43:16,700 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 09:43:16,700 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 09:43:16,700 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 09:43:16,700 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 15 39) the Hoare annotation is: true [2018-11-18 09:43:16,700 INFO L425 ceAbstractionStarter]: For program point L28(lines 28 33) no Hoare annotation was computed. [2018-11-18 09:43:16,700 INFO L425 ceAbstractionStarter]: For program point L28-2(lines 28 33) no Hoare annotation was computed. [2018-11-18 09:43:16,700 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 15 39) no Hoare annotation was computed. [2018-11-18 09:43:16,700 INFO L425 ceAbstractionStarter]: For program point L23-1(lines 23 37) no Hoare annotation was computed. [2018-11-18 09:43:16,700 INFO L421 ceAbstractionStarter]: At program point L23-3(lines 23 37) the Hoare annotation is: (or (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)) (.cse2 (fp.neg .cse0))) (and (fp.leq main_~E1~0 .cse0) (fp.leq main_~S~0 .cse1) (fp.geq main_~E1~0 .cse2) (fp.geq main_~S~0 (fp.neg .cse1)) (fp.leq main_~E0~0 .cse0) (fp.geq main_~E0~0 .cse2)))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (= main_~E1~0 .cse3) (= main_~S~0 .cse3)))) [2018-11-18 09:43:16,701 INFO L425 ceAbstractionStarter]: For program point L23-4(lines 23 37) no Hoare annotation was computed. [2018-11-18 09:43:16,701 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 15 39) no Hoare annotation was computed. [2018-11-18 09:43:16,701 INFO L421 ceAbstractionStarter]: At program point L36(line 36) the Hoare annotation is: (let ((.cse8 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse7 (fp.neg .cse8))) (let ((.cse0 (fp.leq main_~E1~0 .cse8)) (.cse1 (fp.geq main_~E1~0 .cse7)) (.cse2 (fp.leq main_~E0~0 .cse8)) (.cse3 (fp.geq main_~E0~0 .cse7))) (or (and .cse0 .cse1 .cse2 (= main_~S~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) .cse3) (and .cse0 (exists ((main_~E1~0 (_ FloatingPoint 11 53)) (main_~E0~0 (_ FloatingPoint 11 53)) (v_main_~S~0_17 (_ FloatingPoint 11 53))) (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)) (.cse6 (fp.neg .cse5))) (and (fp.geq v_main_~S~0_17 (fp.neg .cse4)) (fp.leq main_~E1~0 .cse5) (= main_~S~0 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) v_main_~S~0_17) main_~E0~0) main_~E1~0)) (fp.geq main_~E1~0 .cse6) (fp.leq v_main_~S~0_17 .cse4) (fp.leq main_~E0~0 .cse5) (fp.geq main_~E0~0 .cse6))))) .cse1 .cse2 .cse3))))) [2018-11-18 09:43:16,701 INFO L425 ceAbstractionStarter]: For program point L36-1(lines 23 37) no Hoare annotation was computed. [2018-11-18 09:43:16,701 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(line 12) the Hoare annotation is: true [2018-11-18 09:43:16,701 INFO L425 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. [2018-11-18 09:43:16,701 INFO L425 ceAbstractionStarter]: For program point L12-1(line 12) no Hoare annotation was computed. [2018-11-18 09:43:16,701 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(line 12) no Hoare annotation was computed. [2018-11-18 09:43:16,701 INFO L425 ceAbstractionStarter]: For program point L12-3(line 12) no Hoare annotation was computed. [2018-11-18 09:43:16,701 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2018-11-18 09:43:16,707 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-18 09:43:16,707 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-18 09:43:16,707 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-18 09:43:16,707 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-18 09:43:16,708 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-18 09:43:16,708 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-18 09:43:16,708 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-18 09:43:16,708 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-18 09:43:16,712 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-18 09:43:16,712 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-18 09:43:16,712 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-18 09:43:16,712 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-18 09:43:16,712 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-18 09:43:16,713 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-18 09:43:16,713 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-18 09:43:16,713 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-18 09:43:16,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 09:43:16 BoogieIcfgContainer [2018-11-18 09:43:16,715 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 09:43:16,715 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 09:43:16,715 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 09:43:16,715 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 09:43:16,715 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:32:34" (3/4) ... [2018-11-18 09:43:16,718 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 09:43:16,722 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 09:43:16,722 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 09:43:16,722 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-18 09:43:16,726 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2018-11-18 09:43:16,726 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-18 09:43:16,726 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-18 09:43:16,755 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_36d39713-4714-4156-a954-2ccea157486b/bin-2019/uautomizer/witness.graphml [2018-11-18 09:43:16,756 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 09:43:16,756 INFO L168 Benchmark]: Toolchain (without parser) took 643482.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 949.7 MB in the beginning and 1.1 GB in the end (delta: -122.4 MB). Peak memory consumption was 305.4 kB. Max. memory is 11.5 GB. [2018-11-18 09:43:16,757 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:43:16,757 INFO L168 Benchmark]: CACSL2BoogieTranslator took 186.00 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 939.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 09:43:16,757 INFO L168 Benchmark]: Boogie Preprocessor took 24.54 ms. Allocated memory is still 1.0 GB. Free memory was 939.0 MB in the beginning and 933.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-18 09:43:16,757 INFO L168 Benchmark]: RCFGBuilder took 709.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -172.3 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2018-11-18 09:43:16,757 INFO L168 Benchmark]: TraceAbstraction took 642518.41 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -5.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.9 MB). Peak memory consumption was 314.0 MB. Max. memory is 11.5 GB. [2018-11-18 09:43:16,758 INFO L168 Benchmark]: Witness Printer took 40.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 11.5 GB. [2018-11-18 09:43:16,759 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 186.00 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 939.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.54 ms. Allocated memory is still 1.0 GB. Free memory was 939.0 MB in the beginning and 933.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 709.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -172.3 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 642518.41 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -5.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.9 MB). Peak memory consumption was 314.0 MB. Max. memory is 11.5 GB. * Witness Printer took 40.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant [2018-11-18 09:43:16,764 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-18 09:43:16,764 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-18 09:43:16,764 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-18 09:43:16,764 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-18 09:43:16,764 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-18 09:43:16,764 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-18 09:43:16,764 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-18 09:43:16,765 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-18 09:43:16,765 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-18 09:43:16,765 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-18 09:43:16,765 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-18 09:43:16,765 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-18 09:43:16,766 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-18 09:43:16,766 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-18 09:43:16,766 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-18 09:43:16,766 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (((((~fp.leq~DOUBLE(E1, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)) && ~fp.leq~DOUBLE(S, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 10000.0))) && ~fp.geq~DOUBLE(E1, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)))) && ~fp.geq~DOUBLE(S, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 10000.0)))) && ~fp.leq~DOUBLE(E0, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0))) && ~fp.geq~DOUBLE(E0, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)))) || (E1 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32) && S == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 22 locations, 1 error locations. SAFE Result, 642.4s OverallTime, 5 OverallIterations, 3 TraceHistogramMax, 91.0s AutomataDifference, 0.0s DeadEndRemovalTime, 284.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 77 SDtfs, 59 SDslu, 297 SDs, 0 SdLazy, 143 SolverSat, 26 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 19.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 174 GetRequests, 107 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 25 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 188.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 33 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 11 PreInvPairs, 19 NumberOfFragments, 152 HoareAnnotationTreeSize, 11 FomulaSimplifications, 1444 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 3271 FormulaSimplificationTreeSizeReductionInter, 284.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 34.1s SatisfiabilityAnalysisTime, 231.7s InterpolantComputationTime, 184 NumberOfCodeBlocks, 184 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 122 ConstructedInterpolants, 22 QuantifiedInterpolants, 61706 SizeOfPredicates, 29 NumberOfNonLiveVariables, 231 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 32/45 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...