./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/floats-esbmc-regression/Double_div_true-unreach-call.i.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_40a88832-e746-4dca-a188-e3ba4b33ba84/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_40a88832-e746-4dca-a188-e3ba4b33ba84/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_40a88832-e746-4dca-a188-e3ba4b33ba84/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_40a88832-e746-4dca-a188-e3ba4b33ba84/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/Double_div_true-unreach-call.i.p+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_40a88832-e746-4dca-a188-e3ba4b33ba84/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_40a88832-e746-4dca-a188-e3ba4b33ba84/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 1bbff5832e71471655f4416229b3fdd1dac2e479 ............................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_40a88832-e746-4dca-a188-e3ba4b33ba84/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_40a88832-e746-4dca-a188-e3ba4b33ba84/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_40a88832-e746-4dca-a188-e3ba4b33ba84/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_40a88832-e746-4dca-a188-e3ba4b33ba84/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/Double_div_true-unreach-call.i.p+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_40a88832-e746-4dca-a188-e3ba4b33ba84/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_40a88832-e746-4dca-a188-e3ba4b33ba84/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 1bbff5832e71471655f4416229b3fdd1dac2e479 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 01:50:12,693 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 01:50:12,695 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 01:50:12,701 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 01:50:12,701 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 01:50:12,702 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 01:50:12,703 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 01:50:12,704 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 01:50:12,705 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 01:50:12,706 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 01:50:12,706 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 01:50:12,706 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 01:50:12,707 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 01:50:12,708 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 01:50:12,708 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 01:50:12,709 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 01:50:12,710 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 01:50:12,711 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 01:50:12,712 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 01:50:12,713 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 01:50:12,714 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 01:50:12,715 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 01:50:12,717 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 01:50:12,717 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 01:50:12,717 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 01:50:12,718 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 01:50:12,718 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 01:50:12,719 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 01:50:12,719 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 01:50:12,720 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 01:50:12,720 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 01:50:12,722 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 01:50:12,722 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 01:50:12,722 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 01:50:12,723 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 01:50:12,724 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 01:50:12,724 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_40a88832-e746-4dca-a188-e3ba4b33ba84/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 01:50:12,734 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 01:50:12,734 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 01:50:12,735 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 01:50:12,735 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 01:50:12,735 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 01:50:12,736 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 01:50:12,736 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 01:50:12,736 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 01:50:12,736 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 01:50:12,736 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 01:50:12,736 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 01:50:12,736 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 01:50:12,737 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 01:50:12,737 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 01:50:12,737 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 01:50:12,737 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 01:50:12,737 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 01:50:12,737 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 01:50:12,737 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 01:50:12,738 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 01:50:12,738 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 01:50:12,738 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 01:50:12,738 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 01:50:12,738 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 01:50:12,738 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 01:50:12,739 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 01:50:12,739 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 01:50:12,739 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 01:50:12,739 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 01:50:12,739 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 01:50:12,739 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_40a88832-e746-4dca-a188-e3ba4b33ba84/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 -> 1bbff5832e71471655f4416229b3fdd1dac2e479 [2018-11-23 01:50:12,763 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 01:50:12,772 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 01:50:12,774 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 01:50:12,775 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 01:50:12,775 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 01:50:12,775 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_40a88832-e746-4dca-a188-e3ba4b33ba84/bin-2019/uautomizer/../../sv-benchmarks/c/floats-esbmc-regression/Double_div_true-unreach-call.i.p+cfa-reducer.c [2018-11-23 01:50:12,812 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_40a88832-e746-4dca-a188-e3ba4b33ba84/bin-2019/uautomizer/data/df1e68754/8d1c4db7af964773b1308f581c675129/FLAG153e76337 [2018-11-23 01:50:13,100 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 01:50:13,101 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_40a88832-e746-4dca-a188-e3ba4b33ba84/sv-benchmarks/c/floats-esbmc-regression/Double_div_true-unreach-call.i.p+cfa-reducer.c [2018-11-23 01:50:13,104 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_40a88832-e746-4dca-a188-e3ba4b33ba84/bin-2019/uautomizer/data/df1e68754/8d1c4db7af964773b1308f581c675129/FLAG153e76337 [2018-11-23 01:50:13,113 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_40a88832-e746-4dca-a188-e3ba4b33ba84/bin-2019/uautomizer/data/df1e68754/8d1c4db7af964773b1308f581c675129 [2018-11-23 01:50:13,115 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 01:50:13,116 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 01:50:13,117 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 01:50:13,117 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 01:50:13,120 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 01:50:13,121 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:50:13" (1/1) ... [2018-11-23 01:50:13,123 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fae5e35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:13, skipping insertion in model container [2018-11-23 01:50:13,123 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:50:13" (1/1) ... [2018-11-23 01:50:13,130 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 01:50:13,141 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 01:50:13,246 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:50:13,250 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 01:50:13,261 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:50:13,269 INFO L195 MainTranslator]: Completed translation [2018-11-23 01:50:13,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:13 WrapperNode [2018-11-23 01:50:13,270 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 01:50:13,270 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 01:50:13,270 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 01:50:13,270 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 01:50:13,276 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:13" (1/1) ... [2018-11-23 01:50:13,279 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:13" (1/1) ... [2018-11-23 01:50:13,283 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 01:50:13,283 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 01:50:13,283 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 01:50:13,283 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 01:50:13,289 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:13" (1/1) ... [2018-11-23 01:50:13,289 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:13" (1/1) ... [2018-11-23 01:50:13,289 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:13" (1/1) ... [2018-11-23 01:50:13,289 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:13" (1/1) ... [2018-11-23 01:50:13,292 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:13" (1/1) ... [2018-11-23 01:50:13,294 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:13" (1/1) ... [2018-11-23 01:50:13,294 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:13" (1/1) ... [2018-11-23 01:50:13,295 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 01:50:13,295 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 01:50:13,295 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 01:50:13,295 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 01:50:13,296 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_40a88832-e746-4dca-a188-e3ba4b33ba84/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-23 01:50:13,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 01:50:13,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 01:50:13,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 01:50:13,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 01:50:13,370 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 01:50:13,370 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 01:50:13,483 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 01:50:13,484 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 01:50:13,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:50:13 BoogieIcfgContainer [2018-11-23 01:50:13,484 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 01:50:13,485 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 01:50:13,485 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 01:50:13,487 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 01:50:13,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:50:13" (1/3) ... [2018-11-23 01:50:13,488 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@244c4deb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:50:13, skipping insertion in model container [2018-11-23 01:50:13,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:13" (2/3) ... [2018-11-23 01:50:13,488 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@244c4deb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:50:13, skipping insertion in model container [2018-11-23 01:50:13,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:50:13" (3/3) ... [2018-11-23 01:50:13,490 INFO L112 eAbstractionObserver]: Analyzing ICFG Double_div_true-unreach-call.i.p+cfa-reducer.c [2018-11-23 01:50:13,498 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 01:50:13,503 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 01:50:13,513 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 01:50:13,531 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 01:50:13,532 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 01:50:13,532 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 01:50:13,532 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 01:50:13,532 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 01:50:13,532 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 01:50:13,532 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 01:50:13,532 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 01:50:13,532 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 01:50:13,545 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2018-11-23 01:50:13,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 01:50:13,548 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:50:13,549 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:50:13,551 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:50:13,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:50:13,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1301230683, now seen corresponding path program 1 times [2018-11-23 01:50:13,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:50:13,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:50:13,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:50:13,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:50:13,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:50:13,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:50:13,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:50:13,628 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|old(~__return_main~0)|=2, ~__return_main~0=2] [?] ~__return_main~0 := 0; VAL [|old(~__return_main~0)|=2, ~__return_main~0=0] [?] assume true; VAL [|old(~__return_main~0)|=2, ~__return_main~0=0] [?] RET #20#return; VAL [~__return_main~0=0] [?] CALL call #t~ret0 := main(); VAL [~__return_main~0=0] [?] ~main__x~0 := 1.0;~main__x1~0 := ~someBinaryArithmeticDOUBLEoperation(~main__x~0, 2.5); VAL [main_~main__x~0=1.0, ~__return_main~0=0] [?] assume !~someBinaryDOUBLEComparisonOperation(~main__x1~0, ~main__x~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~someBinaryDOUBLEComparisonOperation(~main__x~0, ~convertINTToDOUBLE(0)) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; VAL [main_~__tmp_1~0=0, main_~__VERIFIER_assert__cond~0=0, main_~main__x~0=1.0, ~__return_main~0=0] [?] assume 0 == ~__VERIFIER_assert__cond~0; VAL [main_~__tmp_1~0=0, main_~__VERIFIER_assert__cond~0=0, main_~main__x~0=1.0, ~__return_main~0=0] [?] assume !false; VAL [main_~__tmp_1~0=0, main_~__VERIFIER_assert__cond~0=0, main_~main__x~0=1.0, ~__return_main~0=0] [?] CALL call ULTIMATE.init(); VAL [old(~__return_main~0)=2, ~__return_main~0=2] [L1] ~__return_main~0 := 0; VAL [old(~__return_main~0)=2, ~__return_main~0=0] [?] ensures true; VAL [old(~__return_main~0)=2, ~__return_main~0=0] [?] RET call ULTIMATE.init(); VAL [~__return_main~0=0] [?] CALL call #t~ret0 := main(); VAL [~__return_main~0=0] [L7] ~main__x~0 := 1.0; [L8] ~main__x1~0 := ~someBinaryArithmeticDOUBLEoperation(~main__x~0, 2.5); VAL [~__return_main~0=0, ~main__x~0=1.0] [L10-L33] assume !~someBinaryDOUBLEComparisonOperation(~main__x1~0, ~main__x~0); [L19] havoc ~__tmp_1~0; [L20] ~__tmp_1~0 := (if ~someBinaryDOUBLEComparisonOperation(~main__x~0, ~convertINTToDOUBLE(0)) then 1 else 0); [L21] havoc ~__VERIFIER_assert__cond~0; [L22] ~__VERIFIER_assert__cond~0 := ~__tmp_1~0; VAL [~__return_main~0=0, ~__tmp_1~0=0, ~__VERIFIER_assert__cond~0=0, ~main__x~0=1.0] [L23-L31] assume 0 == ~__VERIFIER_assert__cond~0; VAL [~__return_main~0=0, ~__tmp_1~0=0, ~__VERIFIER_assert__cond~0=0, ~main__x~0=1.0] [L25] assert false; VAL [~__return_main~0=0, ~__tmp_1~0=0, ~__VERIFIER_assert__cond~0=0, ~main__x~0=1.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~__return_main~0)=2, ~__return_main~0=2] [L1] ~__return_main~0 := 0; VAL [old(~__return_main~0)=2, ~__return_main~0=0] [?] ensures true; VAL [old(~__return_main~0)=2, ~__return_main~0=0] [?] RET call ULTIMATE.init(); VAL [~__return_main~0=0] [?] CALL call #t~ret0 := main(); VAL [~__return_main~0=0] [L7] ~main__x~0 := 1.0; [L8] ~main__x1~0 := ~someBinaryArithmeticDOUBLEoperation(~main__x~0, 2.5); VAL [~__return_main~0=0, ~main__x~0=1.0] [L10-L33] assume !~someBinaryDOUBLEComparisonOperation(~main__x1~0, ~main__x~0); [L19] havoc ~__tmp_1~0; [L20] ~__tmp_1~0 := (if ~someBinaryDOUBLEComparisonOperation(~main__x~0, ~convertINTToDOUBLE(0)) then 1 else 0); [L21] havoc ~__VERIFIER_assert__cond~0; [L22] ~__VERIFIER_assert__cond~0 := ~__tmp_1~0; VAL [~__return_main~0=0, ~__tmp_1~0=0, ~__VERIFIER_assert__cond~0=0, ~main__x~0=1.0] [L23-L31] assume 0 == ~__VERIFIER_assert__cond~0; VAL [~__return_main~0=0, ~__tmp_1~0=0, ~__VERIFIER_assert__cond~0=0, ~main__x~0=1.0] [L25] assert false; VAL [~__return_main~0=0, ~__tmp_1~0=0, ~__VERIFIER_assert__cond~0=0, ~main__x~0=1.0] [?] CALL call ULTIMATE.init(); VAL [old(~__return_main~0)=2, ~__return_main~0=2] [L1] ~__return_main~0 := 0; VAL [old(~__return_main~0)=2, ~__return_main~0=0] [?] RET call ULTIMATE.init(); VAL [~__return_main~0=0] [?] CALL call #t~ret0 := main(); VAL [~__return_main~0=0] [L7] ~main__x~0 := 1.0; [L8] ~main__x1~0 := ~someBinaryArithmeticDOUBLEoperation(~main__x~0, 2.5); VAL [~__return_main~0=0, ~main__x~0=1.0] [L10] COND FALSE !(~someBinaryDOUBLEComparisonOperation(~main__x1~0, ~main__x~0)) [L19] havoc ~__tmp_1~0; [L20] ~__tmp_1~0 := (if ~someBinaryDOUBLEComparisonOperation(~main__x~0, ~convertINTToDOUBLE(0)) then 1 else 0); [L21] havoc ~__VERIFIER_assert__cond~0; [L22] ~__VERIFIER_assert__cond~0 := ~__tmp_1~0; VAL [~__return_main~0=0, ~__tmp_1~0=0, ~__VERIFIER_assert__cond~0=0, ~main__x~0=1.0] [L23] COND TRUE 0 == ~__VERIFIER_assert__cond~0 VAL [~__return_main~0=0, ~__tmp_1~0=0, ~__VERIFIER_assert__cond~0=0, ~main__x~0=1.0] [L25] assert false; VAL [~__return_main~0=0, ~__tmp_1~0=0, ~__VERIFIER_assert__cond~0=0, ~main__x~0=1.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~__return_main~0)=2, ~__return_main~0=2] [L1] ~__return_main~0 := 0; VAL [old(~__return_main~0)=2, ~__return_main~0=0] [?] RET call ULTIMATE.init(); VAL [~__return_main~0=0] [?] CALL call #t~ret0 := main(); VAL [~__return_main~0=0] [L7] ~main__x~0 := 1.0; [L8] ~main__x1~0 := ~someBinaryArithmeticDOUBLEoperation(~main__x~0, 2.5); VAL [~__return_main~0=0, ~main__x~0=1.0] [L10] COND FALSE !(~someBinaryDOUBLEComparisonOperation(~main__x1~0, ~main__x~0)) [L19] havoc ~__tmp_1~0; [L20] ~__tmp_1~0 := (if ~someBinaryDOUBLEComparisonOperation(~main__x~0, ~convertINTToDOUBLE(0)) then 1 else 0); [L21] havoc ~__VERIFIER_assert__cond~0; [L22] ~__VERIFIER_assert__cond~0 := ~__tmp_1~0; VAL [~__return_main~0=0, ~__tmp_1~0=0, ~__VERIFIER_assert__cond~0=0, ~main__x~0=1.0] [L23] COND TRUE 0 == ~__VERIFIER_assert__cond~0 VAL [~__return_main~0=0, ~__tmp_1~0=0, ~__VERIFIER_assert__cond~0=0, ~main__x~0=1.0] [L25] assert false; VAL [~__return_main~0=0, ~__tmp_1~0=0, ~__VERIFIER_assert__cond~0=0, ~main__x~0=1.0] [?] CALL call ULTIMATE.init(); VAL [old(~__return_main~0)=2, ~__return_main~0=2] [L1] ~__return_main~0 := 0; VAL [old(~__return_main~0)=2, ~__return_main~0=0] [?] RET call ULTIMATE.init(); VAL [~__return_main~0=0] [?] CALL call #t~ret0 := main(); VAL [~__return_main~0=0] [L7] ~main__x~0 := 1.0; [L8] ~main__x1~0 := ~someBinaryArithmeticDOUBLEoperation(~main__x~0, 2.5); VAL [~__return_main~0=0, ~main__x~0=1.0] [L10] COND FALSE !(~someBinaryDOUBLEComparisonOperation(~main__x1~0, ~main__x~0)) [L19] havoc ~__tmp_1~0; [L20] ~__tmp_1~0 := (if ~someBinaryDOUBLEComparisonOperation(~main__x~0, ~convertINTToDOUBLE(0)) then 1 else 0); [L21] havoc ~__VERIFIER_assert__cond~0; [L22] ~__VERIFIER_assert__cond~0 := ~__tmp_1~0; VAL [~__return_main~0=0, ~__tmp_1~0=0, ~__VERIFIER_assert__cond~0=0, ~main__x~0=1.0] [L23] COND TRUE 0 == ~__VERIFIER_assert__cond~0 VAL [~__return_main~0=0, ~__tmp_1~0=0, ~__VERIFIER_assert__cond~0=0, ~main__x~0=1.0] [L25] assert false; VAL [~__return_main~0=0, ~__tmp_1~0=0, ~__VERIFIER_assert__cond~0=0, ~main__x~0=1.0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~__return_main~0)=2, ~__return_main~0=2] [L1] ~__return_main~0 := 0; VAL [old(~__return_main~0)=2, ~__return_main~0=0] [?] RET call ULTIMATE.init(); VAL [~__return_main~0=0] [?] CALL call #t~ret0 := main(); VAL [~__return_main~0=0] [L7] ~main__x~0 := 1.0; [L8] ~main__x1~0 := ~someBinaryArithmeticDOUBLEoperation(~main__x~0, 2.5); VAL [~__return_main~0=0, ~main__x~0=1.0] [L10] COND FALSE !(~someBinaryDOUBLEComparisonOperation(~main__x1~0, ~main__x~0)) [L19] havoc ~__tmp_1~0; [L20] ~__tmp_1~0 := (if ~someBinaryDOUBLEComparisonOperation(~main__x~0, ~convertINTToDOUBLE(0)) then 1 else 0); [L21] havoc ~__VERIFIER_assert__cond~0; [L22] ~__VERIFIER_assert__cond~0 := ~__tmp_1~0; VAL [~__return_main~0=0, ~__tmp_1~0=0, ~__VERIFIER_assert__cond~0=0, ~main__x~0=1.0] [L23] COND TRUE 0 == ~__VERIFIER_assert__cond~0 VAL [~__return_main~0=0, ~__tmp_1~0=0, ~__VERIFIER_assert__cond~0=0, ~main__x~0=1.0] [L25] assert false; VAL [~__return_main~0=0, ~__tmp_1~0=0, ~__VERIFIER_assert__cond~0=0, ~main__x~0=1.0] [L1] int __return_main; VAL [\old(__return_main)=2, __return_main=0] [L7] double main__x = 1.0; [L8] double main__x1 = main__x / 2.5; VAL [__return_main=0, main__x=1] [L10] COND FALSE !(main__x1 != main__x) [L19] int __tmp_1; [L20] __tmp_1 = main__x == 0 [L21] int __VERIFIER_assert__cond; [L22] __VERIFIER_assert__cond = __tmp_1 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main__x=1] [L23] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main__x=1] [L25] __VERIFIER_error() VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main__x=1] ----- [2018-11-23 01:50:13,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:50:13 BoogieIcfgContainer [2018-11-23 01:50:13,652 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 01:50:13,652 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 01:50:13,652 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 01:50:13,653 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 01:50:13,653 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:50:13" (3/4) ... [2018-11-23 01:50:13,656 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 01:50:13,656 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 01:50:13,656 INFO L168 Benchmark]: Toolchain (without parser) took 540.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -173.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:50:13,658 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:50:13,658 INFO L168 Benchmark]: CACSL2BoogieTranslator took 153.29 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 01:50:13,659 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.97 ms. Allocated memory is still 1.0 GB. Free memory was 941.9 MB in the beginning and 939.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 01:50:13,659 INFO L168 Benchmark]: Boogie Preprocessor took 11.61 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:50:13,659 INFO L168 Benchmark]: RCFGBuilder took 189.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -200.7 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-23 01:50:13,660 INFO L168 Benchmark]: TraceAbstraction took 166.85 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: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2018-11-23 01:50:13,661 INFO L168 Benchmark]: Witness Printer took 3.60 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-23 01:50:13,663 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 153.29 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.97 ms. Allocated memory is still 1.0 GB. Free memory was 941.9 MB in the beginning and 939.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.61 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 189.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -200.7 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 166.85 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: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.60 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: 25]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 10, overapproximation of someBinaryArithmeticDOUBLEoperation at line 8. Possible FailurePath: [L1] int __return_main; VAL [\old(__return_main)=2, __return_main=0] [L7] double main__x = 1.0; [L8] double main__x1 = main__x / 2.5; VAL [__return_main=0, main__x=1] [L10] COND FALSE !(main__x1 != main__x) [L19] int __tmp_1; [L20] __tmp_1 = main__x == 0 [L21] int __VERIFIER_assert__cond; [L22] __VERIFIER_assert__cond = __tmp_1 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main__x=1] [L23] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main__x=1] [L25] __VERIFIER_error() VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main__x=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 14 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=14occurred 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, 9 NumberOfCodeBlocks, 9 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-aa41828 [2018-11-23 01:50:15,124 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 01:50:15,126 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 01:50:15,135 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 01:50:15,135 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 01:50:15,136 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 01:50:15,137 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 01:50:15,138 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 01:50:15,139 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 01:50:15,139 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 01:50:15,140 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 01:50:15,140 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 01:50:15,141 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 01:50:15,141 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 01:50:15,142 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 01:50:15,143 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 01:50:15,143 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 01:50:15,144 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 01:50:15,146 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 01:50:15,147 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 01:50:15,147 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 01:50:15,148 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 01:50:15,150 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 01:50:15,150 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 01:50:15,150 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 01:50:15,151 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 01:50:15,151 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 01:50:15,152 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 01:50:15,152 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 01:50:15,153 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 01:50:15,153 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 01:50:15,154 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 01:50:15,154 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 01:50:15,154 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 01:50:15,155 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 01:50:15,155 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 01:50:15,155 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_40a88832-e746-4dca-a188-e3ba4b33ba84/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 01:50:15,165 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 01:50:15,165 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 01:50:15,166 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 01:50:15,166 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 01:50:15,166 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 01:50:15,167 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 01:50:15,167 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 01:50:15,167 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 01:50:15,167 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 01:50:15,167 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 01:50:15,167 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 01:50:15,167 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 01:50:15,168 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 01:50:15,168 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 01:50:15,168 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 01:50:15,168 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 01:50:15,168 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 01:50:15,168 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 01:50:15,168 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 01:50:15,169 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 01:50:15,169 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 01:50:15,169 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 01:50:15,169 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 01:50:15,169 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 01:50:15,169 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 01:50:15,169 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 01:50:15,170 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 01:50:15,170 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 01:50:15,170 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 01:50:15,170 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 01:50:15,170 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 01:50:15,170 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 01:50:15,170 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_40a88832-e746-4dca-a188-e3ba4b33ba84/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 -> 1bbff5832e71471655f4416229b3fdd1dac2e479 [2018-11-23 01:50:15,199 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 01:50:15,208 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 01:50:15,211 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 01:50:15,212 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 01:50:15,213 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 01:50:15,213 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_40a88832-e746-4dca-a188-e3ba4b33ba84/bin-2019/uautomizer/../../sv-benchmarks/c/floats-esbmc-regression/Double_div_true-unreach-call.i.p+cfa-reducer.c [2018-11-23 01:50:15,244 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_40a88832-e746-4dca-a188-e3ba4b33ba84/bin-2019/uautomizer/data/f288cd1b8/f7e1df85e83e4ac188470fbbeab855cd/FLAG1d25c6444 [2018-11-23 01:50:15,537 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 01:50:15,537 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_40a88832-e746-4dca-a188-e3ba4b33ba84/sv-benchmarks/c/floats-esbmc-regression/Double_div_true-unreach-call.i.p+cfa-reducer.c [2018-11-23 01:50:15,540 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_40a88832-e746-4dca-a188-e3ba4b33ba84/bin-2019/uautomizer/data/f288cd1b8/f7e1df85e83e4ac188470fbbeab855cd/FLAG1d25c6444 [2018-11-23 01:50:15,549 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_40a88832-e746-4dca-a188-e3ba4b33ba84/bin-2019/uautomizer/data/f288cd1b8/f7e1df85e83e4ac188470fbbeab855cd [2018-11-23 01:50:15,552 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 01:50:15,553 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 01:50:15,553 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 01:50:15,553 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 01:50:15,555 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 01:50:15,556 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:50:15" (1/1) ... [2018-11-23 01:50:15,558 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@232702b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:15, skipping insertion in model container [2018-11-23 01:50:15,558 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:50:15" (1/1) ... [2018-11-23 01:50:15,563 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 01:50:15,574 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 01:50:15,682 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:50:15,687 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 01:50:15,696 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:50:15,705 INFO L195 MainTranslator]: Completed translation [2018-11-23 01:50:15,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:15 WrapperNode [2018-11-23 01:50:15,706 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 01:50:15,706 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 01:50:15,706 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 01:50:15,706 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 01:50:15,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:15" (1/1) ... [2018-11-23 01:50:15,716 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:15" (1/1) ... [2018-11-23 01:50:15,720 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 01:50:15,720 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 01:50:15,720 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 01:50:15,720 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 01:50:15,725 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:15" (1/1) ... [2018-11-23 01:50:15,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:15" (1/1) ... [2018-11-23 01:50:15,727 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:15" (1/1) ... [2018-11-23 01:50:15,727 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:15" (1/1) ... [2018-11-23 01:50:15,732 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:15" (1/1) ... [2018-11-23 01:50:15,733 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:15" (1/1) ... [2018-11-23 01:50:15,734 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:15" (1/1) ... [2018-11-23 01:50:15,736 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 01:50:15,736 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 01:50:15,736 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 01:50:15,736 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 01:50:15,737 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_40a88832-e746-4dca-a188-e3ba4b33ba84/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-23 01:50:15,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 01:50:15,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 01:50:15,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 01:50:15,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 01:50:15,819 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 01:50:15,819 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 01:50:16,545 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 01:50:16,546 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 01:50:16,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:50:16 BoogieIcfgContainer [2018-11-23 01:50:16,546 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 01:50:16,546 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 01:50:16,546 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 01:50:16,548 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 01:50:16,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:50:15" (1/3) ... [2018-11-23 01:50:16,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e75d5d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:50:16, skipping insertion in model container [2018-11-23 01:50:16,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:15" (2/3) ... [2018-11-23 01:50:16,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e75d5d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:50:16, skipping insertion in model container [2018-11-23 01:50:16,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:50:16" (3/3) ... [2018-11-23 01:50:16,550 INFO L112 eAbstractionObserver]: Analyzing ICFG Double_div_true-unreach-call.i.p+cfa-reducer.c [2018-11-23 01:50:16,556 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 01:50:16,560 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 01:50:16,569 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 01:50:16,587 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 01:50:16,587 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 01:50:16,587 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 01:50:16,588 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 01:50:16,588 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 01:50:16,588 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 01:50:16,588 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 01:50:16,588 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 01:50:16,588 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 01:50:16,600 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2018-11-23 01:50:16,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 01:50:16,604 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:50:16,604 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:50:16,606 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:50:16,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:50:16,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1301230683, now seen corresponding path program 1 times [2018-11-23 01:50:16,612 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 01:50:16,612 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_40a88832-e746-4dca-a188-e3ba4b33ba84/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-23 01:50:16,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:50:16,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:50:16,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:50:17,834 WARN L180 SmtUtils]: Spent 1.04 s on a formula simplification that was a NOOP. DAG size: 11 [2018-11-23 01:50:17,841 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-23 01:50:17,841 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 01:50:17,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:50:17,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 01:50:17,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:50:17,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:50:17,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:50:17,863 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 3 states. [2018-11-23 01:50:20,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:50:20,023 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-23 01:50:20,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:50:20,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-11-23 01:50:20,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:50:20,209 INFO L225 Difference]: With dead ends: 22 [2018-11-23 01:50:20,209 INFO L226 Difference]: Without dead ends: 11 [2018-11-23 01:50:20,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:50:20,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-11-23 01:50:20,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-11-23 01:50:20,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 01:50:20,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-11-23 01:50:20,231 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-11-23 01:50:20,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:50:20,231 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-11-23 01:50:20,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:50:20,231 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-11-23 01:50:20,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 01:50:20,232 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:50:20,232 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:50:20,232 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:50:20,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:50:20,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1683383028, now seen corresponding path program 1 times [2018-11-23 01:50:20,233 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 01:50:20,233 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_40a88832-e746-4dca-a188-e3ba4b33ba84/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-23 01:50:20,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:50:20,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:50:20,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:50:23,091 WARN L180 SmtUtils]: Spent 1.19 s on a formula simplification that was a NOOP. DAG size: 12 [2018-11-23 01:50:23,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:50:23,093 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 01:50:33,151 WARN L180 SmtUtils]: Spent 2.18 s on a formula simplification that was a NOOP. DAG size: 7 [2018-11-23 01:50:33,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:50:33,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 01:50:33,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 01:50:33,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 01:50:33,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 01:50:33,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 01:50:33,172 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 6 states. [2018-11-23 01:50:43,833 WARN L854 $PredicateComparison]: unable to prove that (and (not (fp.eq (fp.div roundNearestTiesToEven c_main_~main__x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0))) c_main_~main__x1~0)) (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0))) is different from true [2018-11-23 01:50:52,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:50:52,568 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2018-11-23 01:50:52,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 01:50:52,753 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-11-23 01:50:52,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:50:52,754 INFO L225 Difference]: With dead ends: 17 [2018-11-23 01:50:52,754 INFO L226 Difference]: Without dead ends: 14 [2018-11-23 01:50:52,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=19, Invalid=25, Unknown=2, NotChecked=10, Total=56 [2018-11-23 01:50:52,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-23 01:50:52,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-23 01:50:52,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 01:50:52,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-23 01:50:52,758 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 10 [2018-11-23 01:50:52,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:50:52,758 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-23 01:50:52,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 01:50:52,759 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 01:50:52,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 01:50:52,759 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:50:52,759 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:50:52,760 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:50:52,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:50:52,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1563595419, now seen corresponding path program 2 times [2018-11-23 01:50:52,760 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 01:50:52,760 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_40a88832-e746-4dca-a188-e3ba4b33ba84/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-23 01:50:52,764 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 01:50:53,445 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 01:50:53,446 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 01:50:53,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:51:02,455 WARN L180 SmtUtils]: Spent 2.66 s on a formula simplification that was a NOOP. DAG size: 15 [2018-11-23 01:51:02,463 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:51:02,463 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 01:51:08,995 WARN L854 $PredicateComparison]: unable to prove that (or (fp.eq c_main_~main__x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq (fp.div roundNearestTiesToEven c_main_~main__x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0))) c_main_~main__x1~0))) is different from true [2018-11-23 01:51:11,383 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven c_main_~main__x1~0 .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0))))) is different from false [2018-11-23 01:51:16,178 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~main__x1~0 .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0))))) is different from false [2018-11-23 01:51:18,743 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~main__x1~0 .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0))))) is different from true [2018-11-23 01:51:21,484 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~main__x1~0 .cse1) .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0))))) is different from false [2018-11-23 01:51:24,220 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~main__x1~0 .cse1) .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0))))) is different from true [2018-11-23 01:51:24,231 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2018-11-23 01:51:24,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 01:51:24,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2018-11-23 01:51:24,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 01:51:24,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 01:51:24,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=57, Unknown=7, NotChecked=68, Total=156 [2018-11-23 01:51:24,248 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2018-11-23 01:51:27,006 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~main__x1~0 .cse2) .cse2) .cse2))) (or (fp.eq .cse0 .cse1) (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse2) .cse0)))) (= c_main_~main__x1~0 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse2)) (or (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0)) (fp.eq c_main_~main__x~0 .cse1)))) is different from true [2018-11-23 01:51:29,591 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~main__x1~0 .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) (= (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse1) .cse1) c_main_~main__x1~0))) is different from true [2018-11-23 01:51:31,986 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (let ((.cse0 (fp.div roundNearestTiesToEven c_main_~main__x1~0 .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) (= (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse1) .cse1) .cse1) c_main_~main__x1~0))) is different from true [2018-11-23 01:51:34,193 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (or (fp.eq c_main_~main__x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq (fp.div roundNearestTiesToEven c_main_~main__x1~0 .cse0) c_main_~main__x1~0))) (= (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0) .cse0) .cse0) .cse0) c_main_~main__x1~0))) is different from true [2018-11-23 01:51:42,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:51:42,574 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2018-11-23 01:51:42,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 01:51:42,574 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-11-23 01:51:42,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:51:42,575 INFO L225 Difference]: With dead ends: 20 [2018-11-23 01:51:42,575 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 01:51:42,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 42.1s TimeCoverageRelationStatistics Valid=36, Invalid=75, Unknown=11, NotChecked=184, Total=306 [2018-11-23 01:51:42,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 01:51:42,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-23 01:51:42,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 01:51:42,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-11-23 01:51:42,579 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2018-11-23 01:51:42,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:51:42,579 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-11-23 01:51:42,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 01:51:42,579 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 01:51:42,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 01:51:42,580 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:51:42,580 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:51:42,580 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:51:42,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:51:42,580 INFO L82 PathProgramCache]: Analyzing trace with hash -625355333, now seen corresponding path program 3 times [2018-11-23 01:51:42,580 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 01:51:42,580 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_40a88832-e746-4dca-a188-e3ba4b33ba84/bin-2019/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-11-23 01:51:42,584 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 01:51:43,336 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 01:51:43,337 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 01:51:43,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:51:45,960 WARN L180 SmtUtils]: Spent 1.28 s on a formula simplification that was a NOOP. DAG size: 7 [2018-11-23 01:51:48,362 WARN L832 $PredicateComparison]: unable to prove that (and (exists ((v_main_~main__x~0_12 (_ FloatingPoint 11 53))) (and (not (fp.eq c_main_~main__x~0 v_main_~main__x~0_12)) (= (fp.div roundNearestTiesToEven v_main_~main__x~0_12 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0))) c_main_~main__x~0))) (= (fp.div roundNearestTiesToEven c_main_~main__x~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0))) c_main_~main__x1~0)) is different from false [2018-11-23 01:51:50,571 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_main_~main__x~0_12 (_ FloatingPoint 11 53))) (and (not (fp.eq c_main_~main__x~0 v_main_~main__x~0_12)) (= (fp.div roundNearestTiesToEven v_main_~main__x~0_12 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0))) c_main_~main__x~0))) (= (fp.div roundNearestTiesToEven c_main_~main__x~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0))) c_main_~main__x1~0)) is different from true [2018-11-23 01:52:02,865 WARN L832 $PredicateComparison]: unable to prove that (or (and (exists ((v_prenex_2 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven v_prenex_2 .cse1))) (and (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0) (not (fp.eq .cse0 v_prenex_2)) (not (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))))) (= c_main_~__VERIFIER_assert__cond~0 (_ bv0 32))) (and (exists ((v_main_~main__x~0_12 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse2 (fp.div roundNearestTiesToEven v_main_~main__x~0_12 .cse3))) (and (not (fp.eq .cse2 v_main_~main__x~0_12)) (fp.eq .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (fp.eq (fp.div roundNearestTiesToEven .cse2 .cse3) .cse2))))) (= (bvadd c_main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32)))) is different from false [2018-11-23 01:52:10,048 WARN L832 $PredicateComparison]: unable to prove that (exists ((v_prenex_2 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven v_prenex_2 .cse1))) (and (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0) (not (fp.eq .cse0 v_prenex_2)) (not (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))))) is different from false [2018-11-23 01:52:12,382 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_prenex_2 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven v_prenex_2 .cse1))) (and (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0) (not (fp.eq .cse0 v_prenex_2)) (not (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))))) is different from true [2018-11-23 01:52:12,383 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 1 not checked. [2018-11-23 01:52:12,384 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 01:52:19,097 WARN L832 $PredicateComparison]: unable to prove that (or (fp.eq c_main_~main__x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq (fp.div roundNearestTiesToEven c_main_~main__x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0))) c_main_~main__x1~0)) (fp.eq c_main_~main__x1~0 c_main_~main__x~0)) is different from false [2018-11-23 01:52:21,292 WARN L854 $PredicateComparison]: unable to prove that (or (fp.eq c_main_~main__x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq (fp.div roundNearestTiesToEven c_main_~main__x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0))) c_main_~main__x1~0)) (fp.eq c_main_~main__x1~0 c_main_~main__x~0)) is different from true [2018-11-23 01:52:28,414 WARN L832 $PredicateComparison]: unable to prove that (forall ((v_main_~main__x~0_14 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven v_main_~main__x~0_14 .cse1))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)) (fp.eq .cse0 v_main_~main__x~0_14) (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))))))) is different from false [2018-11-23 01:52:30,798 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_main_~main__x~0_14 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven v_main_~main__x~0_14 .cse1))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)) (fp.eq .cse0 v_main_~main__x~0_14) (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))))))) is different from true [2018-11-23 01:53:04,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:53:04,327 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_40a88832-e746-4dca-a188-e3ba4b33ba84/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 01:53:04,334 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 01:53:38,986 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 01:53:38,987 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Forcibly destroying the process [2018-11-23 01:53:41,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 01:53:41,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-23 01:53:41,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 01:53:41,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 01:53:41,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=13, Unknown=10, NotChecked=50, Total=90 [2018-11-23 01:53:41,309 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 6 states. [2018-11-23 01:53:43,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:53:43,759 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-23 01:53:44,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 01:53:44,145 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-23 01:53:44,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:53:44,145 INFO L225 Difference]: With dead ends: 16 [2018-11-23 01:53:44,145 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 01:53:44,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 28.2s TimeCoverageRelationStatistics Valid=17, Invalid=13, Unknown=10, NotChecked=50, Total=90 [2018-11-23 01:53:44,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 01:53:44,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 01:53:44,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 01:53:44,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 01:53:44,147 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2018-11-23 01:53:44,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:53:44,147 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 01:53:44,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 01:53:44,147 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 01:53:44,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 01:53:44,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 01:54:59,421 WARN L180 SmtUtils]: Spent 1.25 m on a formula simplification. DAG size of input: 34 DAG size of output: 21 [2018-11-23 01:54:59,423 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 01:54:59,423 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 01:54:59,423 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 01:54:59,423 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 01:54:59,423 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 01:54:59,423 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 01:54:59,423 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 01:54:59,423 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 25) no Hoare annotation was computed. [2018-11-23 01:54:59,424 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 5 34) the Hoare annotation is: true [2018-11-23 01:54:59,424 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-23 01:54:59,424 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 5 34) no Hoare annotation was computed. [2018-11-23 01:54:59,424 INFO L448 ceAbstractionStarter]: For program point L23(lines 23 31) no Hoare annotation was computed. [2018-11-23 01:54:59,424 INFO L444 ceAbstractionStarter]: At program point L14(lines 6 34) the Hoare annotation is: (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 (= (fp.div roundNearestTiesToEven main_~main__x~0 .cse1) main_~main__x1~0))) (or (and (exists ((v_main_~main__x~0_12 (_ FloatingPoint 11 53))) (and (not (fp.eq main_~main__x~0 v_main_~main__x~0_12)) (= (fp.div roundNearestTiesToEven v_main_~main__x~0_12 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0))) main_~main__x~0))) .cse0) (and .cse0 (= main_~main__x1~0 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse1)))))) [2018-11-23 01:54:59,424 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 5 34) no Hoare annotation was computed. [2018-11-23 01:54:59,428 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_12,QUANTIFIED] [2018-11-23 01:54:59,432 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:54:59,432 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_12,QUANTIFIED] [2018-11-23 01:54:59,432 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:54:59,432 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:54:59,432 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:54:59,432 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:54:59,432 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:54:59,433 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:54:59,433 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:54:59,433 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:54:59,436 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_12,QUANTIFIED] [2018-11-23 01:54:59,436 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:54:59,436 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_12,QUANTIFIED] [2018-11-23 01:54:59,436 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:54:59,436 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:54:59,437 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:54:59,437 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:54:59,437 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:54:59,437 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:54:59,437 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:54:59,438 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:54:59,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:54:59 BoogieIcfgContainer [2018-11-23 01:54:59,439 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 01:54:59,440 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 01:54:59,440 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 01:54:59,440 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 01:54:59,441 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:50:16" (3/4) ... [2018-11-23 01:54:59,443 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 01:54:59,447 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 01:54:59,447 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 01:54:59,450 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-23 01:54:59,450 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-23 01:54:59,468 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\exists v_main_~main__x~0_12 : C_DOUBLE :: !~fp.eq~DOUBLE(main__x, v_main_~main__x~0_12) && ~fp.div~DOUBLE(~roundNearestTiesToEven, v_main_~main__x~0_12, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 5/2)) == main__x) && ~fp.div~DOUBLE(~roundNearestTiesToEven, main__x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 5/2)) == main__x1) || (~fp.div~DOUBLE(~roundNearestTiesToEven, main__x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 5/2)) == main__x1 && main__x1 == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 5/2))) [2018-11-23 01:54:59,476 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_40a88832-e746-4dca-a188-e3ba4b33ba84/bin-2019/uautomizer/witness.graphml [2018-11-23 01:54:59,476 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 01:54:59,476 INFO L168 Benchmark]: Toolchain (without parser) took 283924.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 949.7 MB in the beginning and 987.1 MB in the end (delta: -37.4 MB). Peak memory consumption was 100.0 MB. Max. memory is 11.5 GB. [2018-11-23 01:54:59,477 INFO L168 Benchmark]: CDTParser took 0.12 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-23 01:54:59,477 INFO L168 Benchmark]: CACSL2BoogieTranslator took 152.57 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-23 01:54:59,478 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.85 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-23 01:54:59,478 INFO L168 Benchmark]: Boogie Preprocessor took 15.91 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:54:59,478 INFO L168 Benchmark]: RCFGBuilder took 809.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -180.2 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2018-11-23 01:54:59,479 INFO L168 Benchmark]: TraceAbstraction took 282893.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 987.1 MB in the end (delta: 126.7 MB). Peak memory consumption was 126.7 MB. Max. memory is 11.5 GB. [2018-11-23 01:54:59,479 INFO L168 Benchmark]: Witness Printer took 36.04 ms. Allocated memory is still 1.2 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:54:59,481 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.12 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 152.57 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 Procedure Inliner took 13.85 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. * Boogie Preprocessor took 15.91 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 809.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -180.2 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 282893.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 987.1 MB in the end (delta: 126.7 MB). Peak memory consumption was 126.7 MB. Max. memory is 11.5 GB. * Witness Printer took 36.04 ms. Allocated memory is still 1.2 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_12,QUANTIFIED] - 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_12,QUANTIFIED] - 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: 25]: 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: 6]: Loop Invariant [2018-11-23 01:54:59,485 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_12,QUANTIFIED] [2018-11-23 01:54:59,485 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:54:59,485 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_12,QUANTIFIED] [2018-11-23 01:54:59,485 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:54:59,485 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:54:59,485 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:54:59,486 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:54:59,486 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:54:59,486 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:54:59,486 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:54:59,486 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:54:59,487 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_12,QUANTIFIED] [2018-11-23 01:54:59,487 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:54:59,487 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_12,QUANTIFIED] [2018-11-23 01:54:59,487 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:54:59,487 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:54:59,488 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:54:59,488 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:54:59,488 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:54:59,488 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:54:59,488 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:54:59,488 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((\exists v_main_~main__x~0_12 : C_DOUBLE :: !~fp.eq~DOUBLE(main__x, v_main_~main__x~0_12) && ~fp.div~DOUBLE(~roundNearestTiesToEven, v_main_~main__x~0_12, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 5/2)) == main__x) && ~fp.div~DOUBLE(~roundNearestTiesToEven, main__x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 5/2)) == main__x1) || (~fp.div~DOUBLE(~roundNearestTiesToEven, main__x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 5/2)) == main__x1 && main__x1 == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 5/2))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 14 locations, 1 error locations. SAFE Result, 282.8s OverallTime, 4 OverallIterations, 6 TraceHistogramMax, 43.1s AutomataDifference, 0.0s DeadEndRemovalTime, 75.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 36 SDtfs, 1 SDslu, 99 SDs, 0 SdLazy, 32 SolverSat, 6 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 22.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 50 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 90.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred 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, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 11 NumberOfFragments, 47 HoareAnnotationTreeSize, 5 FomulaSimplifications, 337 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 69 FormulaSimplificationTreeSizeReductionInter, 75.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 36.5s SatisfiabilityAnalysisTime, 125.4s InterpolantComputationTime, 62 NumberOfCodeBlocks, 60 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 64 ConstructedInterpolants, 3 QuantifiedInterpolants, 6438 SizeOfPredicates, 16 NumberOfNonLiveVariables, 99 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 6 InterpolantComputations, 1 PerfectInterpolantSequences, 20/43 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...