./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/floats-esbmc-regression/Double_div_bad.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_192aa5d1-2464-4f93-9326-4bb3805889be/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_192aa5d1-2464-4f93-9326-4bb3805889be/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_192aa5d1-2464-4f93-9326-4bb3805889be/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_192aa5d1-2464-4f93-9326-4bb3805889be/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/Double_div_bad.i -s /tmp/vcloud-vcloud-master/worker/run_dir_192aa5d1-2464-4f93-9326-4bb3805889be/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_192aa5d1-2464-4f93-9326-4bb3805889be/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1d363a30f559764c47bcb73d637f2d7196a1b97b ................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_192aa5d1-2464-4f93-9326-4bb3805889be/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_192aa5d1-2464-4f93-9326-4bb3805889be/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_192aa5d1-2464-4f93-9326-4bb3805889be/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_192aa5d1-2464-4f93-9326-4bb3805889be/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/Double_div_bad.i -s /tmp/vcloud-vcloud-master/worker/run_dir_192aa5d1-2464-4f93-9326-4bb3805889be/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_192aa5d1-2464-4f93-9326-4bb3805889be/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1d363a30f559764c47bcb73d637f2d7196a1b97b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 11:24:26,435 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:24:26,437 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:24:26,444 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:24:26,444 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:24:26,445 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:24:26,446 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:24:26,447 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:24:26,448 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:24:26,449 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:24:26,449 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:24:26,450 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:24:26,450 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:24:26,451 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:24:26,452 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:24:26,453 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:24:26,453 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:24:26,454 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:24:26,455 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:24:26,457 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:24:26,458 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:24:26,458 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:24:26,459 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:24:26,459 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:24:26,461 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:24:26,461 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:24:26,461 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:24:26,462 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:24:26,462 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:24:26,463 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:24:26,463 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:24:26,463 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:24:26,464 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:24:26,464 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:24:26,465 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:24:26,465 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:24:26,465 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:24:26,466 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:24:26,466 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:24:26,466 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:24:26,467 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:24:26,467 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_192aa5d1-2464-4f93-9326-4bb3805889be/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 11:24:26,477 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:24:26,477 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:24:26,478 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 11:24:26,478 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 11:24:26,478 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 11:24:26,478 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 11:24:26,478 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 11:24:26,479 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 11:24:26,479 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 11:24:26,479 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 11:24:26,479 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 11:24:26,479 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 11:24:26,479 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 11:24:26,480 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 11:24:26,480 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 11:24:26,480 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:24:26,480 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:24:26,480 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:24:26,481 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:24:26,481 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:24:26,481 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:24:26,481 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:24:26,481 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:24:26,481 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 11:24:26,481 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:24:26,482 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:24:26,482 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:24:26,482 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:24:26,482 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:24:26,482 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:24:26,482 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:24:26,482 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:24:26,483 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:24:26,483 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:24:26,483 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:24:26,483 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 11:24:26,483 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:24:26,483 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:24:26,483 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:24:26,483 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 11:24:26,484 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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/run_dir_192aa5d1-2464-4f93-9326-4bb3805889be/bin/utaipan 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 -> Taipan 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 -> 1d363a30f559764c47bcb73d637f2d7196a1b97b [2019-12-07 11:24:26,582 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:24:26,590 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:24:26,592 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:24:26,593 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:24:26,593 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:24:26,594 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_192aa5d1-2464-4f93-9326-4bb3805889be/bin/utaipan/../../sv-benchmarks/c/floats-esbmc-regression/Double_div_bad.i [2019-12-07 11:24:26,631 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_192aa5d1-2464-4f93-9326-4bb3805889be/bin/utaipan/data/6d79e656d/2d036bb456d141feb98257783f68d6b9/FLAG9e2034f3b [2019-12-07 11:24:26,936 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:24:26,937 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_192aa5d1-2464-4f93-9326-4bb3805889be/sv-benchmarks/c/floats-esbmc-regression/Double_div_bad.i [2019-12-07 11:24:26,940 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_192aa5d1-2464-4f93-9326-4bb3805889be/bin/utaipan/data/6d79e656d/2d036bb456d141feb98257783f68d6b9/FLAG9e2034f3b [2019-12-07 11:24:26,949 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_192aa5d1-2464-4f93-9326-4bb3805889be/bin/utaipan/data/6d79e656d/2d036bb456d141feb98257783f68d6b9 [2019-12-07 11:24:26,952 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:24:26,952 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:24:26,953 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:24:26,953 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:24:26,955 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:24:26,956 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:24:26" (1/1) ... [2019-12-07 11:24:26,958 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a8ebb28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:24:26, skipping insertion in model container [2019-12-07 11:24:26,958 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:24:26" (1/1) ... [2019-12-07 11:24:26,963 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:24:26,973 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:24:27,105 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:24:27,109 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:24:27,121 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:24:27,131 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:24:27,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:24:27 WrapperNode [2019-12-07 11:24:27,132 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:24:27,132 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:24:27,132 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:24:27,132 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:24:27,138 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:24:27" (1/1) ... [2019-12-07 11:24:27,142 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:24:27" (1/1) ... [2019-12-07 11:24:27,153 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:24:27,153 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:24:27,154 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:24:27,154 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:24:27,159 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:24:27" (1/1) ... [2019-12-07 11:24:27,159 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:24:27" (1/1) ... [2019-12-07 11:24:27,160 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:24:27" (1/1) ... [2019-12-07 11:24:27,160 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:24:27" (1/1) ... [2019-12-07 11:24:27,162 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:24:27" (1/1) ... [2019-12-07 11:24:27,164 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:24:27" (1/1) ... [2019-12-07 11:24:27,165 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:24:27" (1/1) ... [2019-12-07 11:24:27,165 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:24:27,166 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:24:27,166 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:24:27,166 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:24:27,166 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:24:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_192aa5d1-2464-4f93-9326-4bb3805889be/bin/utaipan/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 [2019-12-07 11:24:27,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:24:27,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:24:27,303 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:24:27,303 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 11:24:27,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:24:27 BoogieIcfgContainer [2019-12-07 11:24:27,304 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:24:27,305 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:24:27,305 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:24:27,306 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:24:27,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:24:26" (1/3) ... [2019-12-07 11:24:27,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@422b7282 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:24:27, skipping insertion in model container [2019-12-07 11:24:27,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:24:27" (2/3) ... [2019-12-07 11:24:27,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@422b7282 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:24:27, skipping insertion in model container [2019-12-07 11:24:27,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:24:27" (3/3) ... [2019-12-07 11:24:27,308 INFO L109 eAbstractionObserver]: Analyzing ICFG Double_div_bad.i [2019-12-07 11:24:27,314 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:24:27,318 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 11:24:27,325 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 11:24:27,339 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:24:27,339 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:24:27,339 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:24:27,339 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:24:27,339 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:24:27,339 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:24:27,340 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:24:27,340 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:24:27,348 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-12-07 11:24:27,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 11:24:27,351 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:24:27,351 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 11:24:27,352 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:24:27,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:24:27,355 INFO L82 PathProgramCache]: Analyzing trace with hash 984610, now seen corresponding path program 1 times [2019-12-07 11:24:27,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:24:27,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219790182] [2019-12-07 11:24:27,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:24:27,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:24:27,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:24:27,430 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 11:24:27,430 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 11:24:27,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:24:27 BoogieIcfgContainer [2019-12-07 11:24:27,440 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:24:27,440 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:24:27,440 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:24:27,440 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:24:27,441 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:24:27" (3/4) ... [2019-12-07 11:24:27,443 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 11:24:27,443 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:24:27,445 INFO L168 Benchmark]: Toolchain (without parser) took 491.51 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -134.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:24:27,445 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 955.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:24:27,445 INFO L168 Benchmark]: CACSL2BoogieTranslator took 178.90 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -163.0 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-12-07 11:24:27,446 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.11 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 11.5 GB. [2019-12-07 11:24:27,446 INFO L168 Benchmark]: Boogie Preprocessor took 12.07 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:24:27,447 INFO L168 Benchmark]: RCFGBuilder took 138.28 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. [2019-12-07 11:24:27,447 INFO L168 Benchmark]: TraceAbstraction took 135.44 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-12-07 11:24:27,447 INFO L168 Benchmark]: Witness Printer took 2.73 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:24:27,450 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 955.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 178.90 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -163.0 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.11 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 12.07 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 138.28 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 135.44 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Witness Printer took 2.73 ms. Allocated memory is still 1.1 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: 2]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 12, overapproximation of someBinaryArithmeticDOUBLEoperation at line 10. Possible FailurePath: [L9] double x = 1.0; [L10] double x1 = x/1.6; [L12] COND FALSE !(x1 != x) [L2] COND TRUE !(cond) [L2] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. Result: UNSAFE, OverallTime: 0.0s, OverallIterations: 1, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 4 NumberOfCodeBlocks, 4 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 11:24:28,826 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:24:28,827 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:24:28,835 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:24:28,835 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:24:28,836 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:24:28,837 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:24:28,838 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:24:28,839 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:24:28,840 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:24:28,840 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:24:28,841 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:24:28,841 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:24:28,842 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:24:28,843 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:24:28,844 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:24:28,844 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:24:28,845 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:24:28,846 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:24:28,848 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:24:28,849 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:24:28,850 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:24:28,850 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:24:28,851 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:24:28,853 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:24:28,853 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:24:28,853 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:24:28,854 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:24:28,854 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:24:28,854 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:24:28,855 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:24:28,855 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:24:28,856 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:24:28,856 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:24:28,857 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:24:28,857 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:24:28,857 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:24:28,858 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:24:28,858 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:24:28,858 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:24:28,859 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:24:28,859 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_192aa5d1-2464-4f93-9326-4bb3805889be/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2019-12-07 11:24:28,869 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:24:28,869 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:24:28,870 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 11:24:28,870 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 11:24:28,870 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 11:24:28,870 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 11:24:28,870 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 11:24:28,870 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 11:24:28,871 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 11:24:28,871 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:24:28,871 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:24:28,871 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:24:28,871 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:24:28,871 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:24:28,872 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:24:28,872 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:24:28,872 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 11:24:28,872 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 11:24:28,872 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 11:24:28,872 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:24:28,872 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:24:28,872 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:24:28,873 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:24:28,873 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:24:28,873 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 11:24:28,873 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:24:28,873 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:24:28,873 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:24:28,873 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:24:28,874 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:24:28,874 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:24:28,874 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-12-07 11:24:28,874 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 11:24:28,874 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:24:28,874 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:24:28,874 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 11:24:28,874 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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/run_dir_192aa5d1-2464-4f93-9326-4bb3805889be/bin/utaipan 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 -> Taipan 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 -> 1d363a30f559764c47bcb73d637f2d7196a1b97b [2019-12-07 11:24:29,034 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:24:29,043 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:24:29,046 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:24:29,047 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:24:29,047 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:24:29,048 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_192aa5d1-2464-4f93-9326-4bb3805889be/bin/utaipan/../../sv-benchmarks/c/floats-esbmc-regression/Double_div_bad.i [2019-12-07 11:24:29,092 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_192aa5d1-2464-4f93-9326-4bb3805889be/bin/utaipan/data/6a50ef4c4/9c9d483aecc84d7b846bf6d979b9754f/FLAGb72a13732 [2019-12-07 11:24:29,413 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:24:29,413 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_192aa5d1-2464-4f93-9326-4bb3805889be/sv-benchmarks/c/floats-esbmc-regression/Double_div_bad.i [2019-12-07 11:24:29,417 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_192aa5d1-2464-4f93-9326-4bb3805889be/bin/utaipan/data/6a50ef4c4/9c9d483aecc84d7b846bf6d979b9754f/FLAGb72a13732 [2019-12-07 11:24:29,425 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_192aa5d1-2464-4f93-9326-4bb3805889be/bin/utaipan/data/6a50ef4c4/9c9d483aecc84d7b846bf6d979b9754f [2019-12-07 11:24:29,427 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:24:29,428 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:24:29,429 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:24:29,429 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:24:29,431 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:24:29,432 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:24:29" (1/1) ... [2019-12-07 11:24:29,433 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23cf13fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:24:29, skipping insertion in model container [2019-12-07 11:24:29,433 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:24:29" (1/1) ... [2019-12-07 11:24:29,438 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:24:29,448 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:24:29,545 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:24:29,550 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:24:29,559 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:24:29,569 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:24:29,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:24:29 WrapperNode [2019-12-07 11:24:29,569 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:24:29,570 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:24:29,570 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:24:29,570 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:24:29,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:24:29" (1/1) ... [2019-12-07 11:24:29,580 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:24:29" (1/1) ... [2019-12-07 11:24:29,626 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:24:29,626 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:24:29,626 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:24:29,626 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:24:29,632 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:24:29" (1/1) ... [2019-12-07 11:24:29,633 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:24:29" (1/1) ... [2019-12-07 11:24:29,634 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:24:29" (1/1) ... [2019-12-07 11:24:29,634 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:24:29" (1/1) ... [2019-12-07 11:24:29,637 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:24:29" (1/1) ... [2019-12-07 11:24:29,640 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:24:29" (1/1) ... [2019-12-07 11:24:29,641 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:24:29" (1/1) ... [2019-12-07 11:24:29,642 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:24:29,643 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:24:29,643 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:24:29,643 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:24:29,643 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:24:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_192aa5d1-2464-4f93-9326-4bb3805889be/bin/utaipan/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 [2019-12-07 11:24:29,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:24:29,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:24:34,061 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:24:34,062 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 11:24:34,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:24:34 BoogieIcfgContainer [2019-12-07 11:24:34,063 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:24:34,064 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:24:34,064 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:24:34,066 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:24:34,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:24:29" (1/3) ... [2019-12-07 11:24:34,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38ec76c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:24:34, skipping insertion in model container [2019-12-07 11:24:34,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:24:29" (2/3) ... [2019-12-07 11:24:34,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38ec76c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:24:34, skipping insertion in model container [2019-12-07 11:24:34,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:24:34" (3/3) ... [2019-12-07 11:24:34,069 INFO L109 eAbstractionObserver]: Analyzing ICFG Double_div_bad.i [2019-12-07 11:24:34,075 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:24:34,079 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 11:24:34,087 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 11:24:34,102 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:24:34,102 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:24:34,103 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:24:34,103 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:24:34,103 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:24:34,103 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:24:34,103 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:24:34,103 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:24:34,113 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-12-07 11:24:34,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 11:24:34,116 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:24:34,117 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 11:24:34,117 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:24:34,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:24:34,121 INFO L82 PathProgramCache]: Analyzing trace with hash 889633835, now seen corresponding path program 1 times [2019-12-07 11:24:34,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:24:34,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1239469651] [2019-12-07 11:24:34,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_192aa5d1-2464-4f93-9326-4bb3805889be/bin/utaipan/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 [2019-12-07 11:24:34,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:24:34,935 INFO L264 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 11:24:34,939 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:24:37,867 WARN L192 SmtUtils]: Spent 2.29 s on a formula simplification that was a NOOP. DAG size: 11 [2019-12-07 11:24:37,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:24:37,871 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:24:42,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:24:42,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1239469651] [2019-12-07 11:24:42,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:24:42,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-12-07 11:24:42,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907797023] [2019-12-07 11:24:42,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:24:42,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:24:42,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:24:42,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:24:42,452 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 5 states. [2019-12-07 11:24:47,330 WARN L192 SmtUtils]: Spent 3.15 s on a formula simplification that was a NOOP. DAG size: 13 [2019-12-07 11:24:52,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:24:52,810 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2019-12-07 11:24:52,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:24:52,812 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-12-07 11:24:52,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:24:52,819 INFO L225 Difference]: With dead ends: 21 [2019-12-07 11:24:52,819 INFO L226 Difference]: Without dead ends: 9 [2019-12-07 11:24:52,821 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:24:52,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-12-07 11:24:52,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-12-07 11:24:52,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-12-07 11:24:52,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-12-07 11:24:52,843 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2019-12-07 11:24:52,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:24:52,843 INFO L462 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-12-07 11:24:52,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:24:52,843 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-12-07 11:24:52,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 11:24:52,843 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:24:52,844 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-12-07 11:24:53,044 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 11:24:53,045 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:24:53,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:24:53,046 INFO L82 PathProgramCache]: Analyzing trace with hash 292915403, now seen corresponding path program 1 times [2019-12-07 11:24:53,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:24:53,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1485654374] [2019-12-07 11:24:53,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_192aa5d1-2464-4f93-9326-4bb3805889be/bin/utaipan/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 [2019-12-07 11:24:55,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:24:55,361 WARN L262 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 11:24:55,363 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:24:58,268 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~x1~0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2019-12-07 11:25:00,904 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~x1~0 (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2019-12-07 11:25:07,580 WARN L192 SmtUtils]: Spent 4.12 s on a formula simplification that was a NOOP. DAG size: 13 [2019-12-07 11:25:07,584 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2019-12-07 11:25:07,584 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:25:29,074 WARN L192 SmtUtils]: Spent 4.52 s on a formula simplification that was a NOOP. DAG size: 7 [2019-12-07 11:25:31,567 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x1~0 .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from false [2019-12-07 11:25:34,075 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x1~0 .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from true [2019-12-07 11:25:36,788 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from false [2019-12-07 11:25:39,526 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from true [2019-12-07 11:25:39,527 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 1 times theorem prover too weak. 0 trivial. 2 not checked. [2019-12-07 11:25:39,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1485654374] [2019-12-07 11:25:39,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1256387124] [2019-12-07 11:25:39,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_192aa5d1-2464-4f93-9326-4bb3805889be/bin/utaipan/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 11:25:45,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:25:45,247 WARN L262 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 11:25:45,249 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:25:45,254 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2019-12-07 11:25:45,255 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:25:45,260 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 1 times theorem prover too weak. 0 trivial. 2 not checked. [2019-12-07 11:25:45,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442820307] [2019-12-07 11:25:45,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_192aa5d1-2464-4f93-9326-4bb3805889be/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:27:08,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:27:09,192 WARN L262 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 11:27:09,193 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:27:11,408 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (= c_ULTIMATE.start_main_~x1~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 .cse0)) (= (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) c_ULTIMATE.start_main_~x~0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2019-12-07 11:27:14,188 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse2 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0))) (let ((.cse1 (fp.div c_currentRoundingMode .cse2 .cse0))) (and (= c_ULTIMATE.start_main_~x1~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 .cse0)) (= c_ULTIMATE.start_main_~x~0 .cse1) (= c_currentRoundingMode roundNearestTiesToEven) (not (fp.eq .cse1 .cse2)))))) is different from false [2019-12-07 11:27:16,703 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse2 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0))) (let ((.cse1 (fp.div c_currentRoundingMode .cse2 .cse0))) (and (= c_ULTIMATE.start_main_~x1~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 .cse0)) (= c_ULTIMATE.start_main_~x~0 .cse1) (= c_currentRoundingMode roundNearestTiesToEven) (not (fp.eq .cse1 .cse2)))))) is different from true [2019-12-07 11:27:19,481 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse2 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0))) (let ((.cse1 (fp.div c_currentRoundingMode .cse2 .cse0))) (and (fp.eq (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 .cse0) c_ULTIMATE.start_main_~x~0) (= c_ULTIMATE.start_main_~x~0 .cse1) (= c_currentRoundingMode roundNearestTiesToEven) (not (fp.eq .cse1 .cse2)))))) is different from false [2019-12-07 11:27:22,246 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse2 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0))) (let ((.cse1 (fp.div c_currentRoundingMode .cse2 .cse0))) (and (fp.eq (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 .cse0) c_ULTIMATE.start_main_~x~0) (= c_ULTIMATE.start_main_~x~0 .cse1) (= c_currentRoundingMode roundNearestTiesToEven) (not (fp.eq .cse1 .cse2)))))) is different from true [2019-12-07 11:27:22,256 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2019-12-07 11:27:22,256 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:27:35,997 WARN L838 $PredicateComparison]: unable to prove that (or (fp.eq c_ULTIMATE.start_main_~x1~0 c_ULTIMATE.start_main_~x~0) (fp.eq c_ULTIMATE.start_main_~x1~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0))) c_ULTIMATE.start_main_~x1~0))) is different from false [2019-12-07 11:27:38,251 WARN L860 $PredicateComparison]: unable to prove that (or (fp.eq c_ULTIMATE.start_main_~x1~0 c_ULTIMATE.start_main_~x~0) (fp.eq c_ULTIMATE.start_main_~x1~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0))) c_ULTIMATE.start_main_~x1~0))) is different from true [2019-12-07 11:27:40,758 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x1~0 .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.eq .cse0 c_ULTIMATE.start_main_~x1~0)))) is different from false [2019-12-07 11:27:43,256 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x1~0 .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.eq .cse0 c_ULTIMATE.start_main_~x1~0)))) is different from true [2019-12-07 11:27:46,018 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse2 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1))) (let ((.cse0 (fp.div c_currentRoundingMode .cse2 .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 .cse2))))) is different from false [2019-12-07 11:27:48,779 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse2 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1))) (let ((.cse0 (fp.div c_currentRoundingMode .cse2 .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 .cse2))))) is different from true [2019-12-07 11:27:48,780 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2019-12-07 11:27:48,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 11:27:48,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 6, 7] total 18 [2019-12-07 11:27:48,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238606475] [2019-12-07 11:27:48,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 11:27:48,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:27:48,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 11:27:48,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=49, Unknown=23, NotChecked=230, Total=342 [2019-12-07 11:27:48,784 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 19 states. [2019-12-07 11:27:52,304 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse2 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse3))) (let ((.cse1 (fp.div c_currentRoundingMode .cse2 .cse3))) (let ((.cse0 (not (fp.eq (fp.div c_currentRoundingMode .cse1 .cse3) .cse1)))) (and .cse0 (or (fp.eq .cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) .cse0 (fp.eq .cse1 .cse2)) (= c_currentRoundingMode roundNearestTiesToEven)))))) is different from true [2019-12-07 11:27:54,802 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x1~0 .cse0))) (let ((.cse1 (not (fp.eq (fp.div c_currentRoundingMode .cse2 .cse0) .cse2)))) (and (= c_ULTIMATE.start_main_~x1~0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0)) (or .cse1 (fp.eq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.eq .cse2 c_ULTIMATE.start_main_~x1~0)) .cse1 (= c_currentRoundingMode roundNearestTiesToEven))))) is different from false [2019-12-07 11:27:57,312 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x1~0 .cse0))) (let ((.cse1 (not (fp.eq (fp.div c_currentRoundingMode .cse2 .cse0) .cse2)))) (and (= c_ULTIMATE.start_main_~x1~0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0)) (or .cse1 (fp.eq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.eq .cse2 c_ULTIMATE.start_main_~x1~0)) .cse1 (= c_currentRoundingMode roundNearestTiesToEven))))) is different from true [2019-12-07 11:28:01,100 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse1 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0)) (.cse2 (not (fp.eq (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x1~0 .cse0) c_ULTIMATE.start_main_~x1~0)))) (and (= c_ULTIMATE.start_main_~x1~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 .cse0)) (= c_ULTIMATE.start_main_~x1~0 (fp.div c_currentRoundingMode .cse1 .cse0)) .cse2 (= .cse1 c_ULTIMATE.start_main_~x~0) (or (fp.eq c_ULTIMATE.start_main_~x1~0 c_ULTIMATE.start_main_~x~0) (fp.eq c_ULTIMATE.start_main_~x1~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) .cse2) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2019-12-07 11:28:03,789 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse3 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0))) (.cse2 (fp.div c_currentRoundingMode .cse3 .cse0))) (and (= c_ULTIMATE.start_main_~x1~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 .cse0)) (= (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 .cse1) c_ULTIMATE.start_main_~x1~0) (= (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse1) .cse1) c_ULTIMATE.start_main_~x~0) (= c_ULTIMATE.start_main_~x~0 .cse2) (= c_currentRoundingMode roundNearestTiesToEven) (not (fp.eq .cse2 .cse3)))))) is different from false [2019-12-07 11:28:06,301 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse3 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0))) (.cse2 (fp.div c_currentRoundingMode .cse3 .cse0))) (and (= c_ULTIMATE.start_main_~x1~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 .cse0)) (= (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 .cse1) c_ULTIMATE.start_main_~x1~0) (= (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse1) .cse1) c_ULTIMATE.start_main_~x~0) (= c_ULTIMATE.start_main_~x~0 .cse2) (= c_currentRoundingMode roundNearestTiesToEven) (not (fp.eq .cse2 .cse3)))))) is different from true [2019-12-07 11:28:16,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:28:16,365 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-12-07 11:28:16,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:28:16,366 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 8 [2019-12-07 11:28:16,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:28:16,367 INFO L225 Difference]: With dead ends: 14 [2019-12-07 11:28:16,367 INFO L226 Difference]: Without dead ends: 10 [2019-12-07 11:28:16,368 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 100.7s TimeCoverageRelationStatistics Valid=48, Invalid=51, Unknown=29, NotChecked=378, Total=506 [2019-12-07 11:28:16,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-12-07 11:28:16,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-12-07 11:28:16,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-12-07 11:28:16,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-12-07 11:28:16,371 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-12-07 11:28:16,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:28:16,372 INFO L462 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-12-07 11:28:16,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 11:28:16,372 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-12-07 11:28:16,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 11:28:16,372 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:28:16,372 INFO L410 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2019-12-07 11:28:16,974 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk,3 mathsat -unsat_core_generation=3,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:28:16,976 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:28:16,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:28:16,977 INFO L82 PathProgramCache]: Analyzing trace with hash 492108272, now seen corresponding path program 2 times [2019-12-07 11:28:16,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:28:16,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [242165014] [2019-12-07 11:28:16,980 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_192aa5d1-2464-4f93-9326-4bb3805889be/bin/utaipan/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-12-07 11:28:19,741 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 11:28:19,741 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:28:19,993 WARN L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 11:28:19,994 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:28:27,338 WARN L192 SmtUtils]: Spent 5.23 s on a formula simplification that was a NOOP. DAG size: 11 [2019-12-07 11:28:29,866 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~x1~0 (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2019-12-07 11:28:43,730 WARN L192 SmtUtils]: Spent 8.26 s on a formula simplification that was a NOOP. DAG size: 13 [2019-12-07 11:28:48,803 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (= (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) c_ULTIMATE.start_main_~x~0) (= c_ULTIMATE.start_main_~x1~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 .cse0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2019-12-07 11:28:49,518 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 1 times theorem prover too weak. 0 trivial. 5 not checked. [2019-12-07 11:28:49,518 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:28:51,843 WARN L838 $PredicateComparison]: unable to prove that (or (fp.eq c_ULTIMATE.start_main_~x1~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0))) c_ULTIMATE.start_main_~x1~0))) is different from false [2019-12-07 11:28:54,110 WARN L860 $PredicateComparison]: unable to prove that (or (fp.eq c_ULTIMATE.start_main_~x1~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0))) c_ULTIMATE.start_main_~x1~0))) is different from true [2019-12-07 11:28:56,622 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x1~0 .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from false [2019-12-07 11:28:59,140 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x1~0 .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from true [2019-12-07 11:29:01,935 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x1~0 .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) is different from false [2019-12-07 11:29:04,692 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x1~0 .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) is different from true [2019-12-07 11:29:07,680 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) is different from false [2019-12-07 11:29:10,696 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) is different from true [2019-12-07 11:29:10,697 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2019-12-07 11:29:10,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [242165014] [2019-12-07 11:29:10,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2069553968] [2019-12-07 11:29:10,697 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_192aa5d1-2464-4f93-9326-4bb3805889be/bin/utaipan/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 11:29:18,297 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 11:29:18,298 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:29:18,309 WARN L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 11:29:18,310 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:29:19,031 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 1 times theorem prover too weak. 0 trivial. 5 not checked. [2019-12-07 11:29:19,031 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:29:19,038 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2019-12-07 11:29:19,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535373972] [2019-12-07 11:29:19,038 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_192aa5d1-2464-4f93-9326-4bb3805889be/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:34:24,210 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 11:34:24,210 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:34:25,087 WARN L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 11:34:25,089 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:34:27,489 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (= c_ULTIMATE.start_main_~x1~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 .cse0)) (= (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) c_ULTIMATE.start_main_~x~0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2019-12-07 11:34:29,835 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse1 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0))) (and (= c_ULTIMATE.start_main_~x1~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 .cse0)) (not (fp.eq c_ULTIMATE.start_main_~x~0 .cse1)) (= c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode .cse1 .cse0)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2019-12-07 11:34:32,880 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse2 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1))) (let ((.cse0 (fp.div c_currentRoundingMode .cse2 .cse1))) (and (= (fp.div c_currentRoundingMode .cse0 .cse1) c_ULTIMATE.start_main_~x~0) (= c_ULTIMATE.start_main_~x1~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 .cse1)) (= c_currentRoundingMode roundNearestTiesToEven) (not (fp.eq .cse0 .cse2)) (not (fp.eq c_ULTIMATE.start_main_~x~0 .cse0)))))) is different from false [2019-12-07 11:34:35,965 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse2 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1))) (let ((.cse0 (fp.div c_currentRoundingMode .cse2 .cse1))) (and (= (fp.div c_currentRoundingMode .cse0 .cse1) c_ULTIMATE.start_main_~x~0) (= c_ULTIMATE.start_main_~x1~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 .cse1)) (= c_currentRoundingMode roundNearestTiesToEven) (not (fp.eq .cse0 .cse2)) (not (fp.eq c_ULTIMATE.start_main_~x~0 .cse0)))))) is different from true [2019-12-07 11:34:39,013 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse2 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1))) (let ((.cse0 (fp.div c_currentRoundingMode .cse2 .cse1))) (and (= (fp.div c_currentRoundingMode .cse0 .cse1) c_ULTIMATE.start_main_~x~0) (fp.eq (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 .cse1) c_ULTIMATE.start_main_~x~0) (= c_currentRoundingMode roundNearestTiesToEven) (not (fp.eq .cse0 .cse2)) (not (fp.eq c_ULTIMATE.start_main_~x~0 .cse0)))))) is different from false [2019-12-07 11:34:41,900 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse2 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1))) (let ((.cse0 (fp.div c_currentRoundingMode .cse2 .cse1))) (and (= (fp.div c_currentRoundingMode .cse0 .cse1) c_ULTIMATE.start_main_~x~0) (fp.eq (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 .cse1) c_ULTIMATE.start_main_~x~0) (= c_currentRoundingMode roundNearestTiesToEven) (not (fp.eq .cse0 .cse2)) (not (fp.eq c_ULTIMATE.start_main_~x~0 .cse0)))))) is different from true [2019-12-07 11:34:41,905 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2019-12-07 11:34:41,905 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:34:44,166 WARN L838 $PredicateComparison]: unable to prove that (or (fp.eq c_ULTIMATE.start_main_~x1~0 c_ULTIMATE.start_main_~x~0) (fp.eq c_ULTIMATE.start_main_~x1~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0))) c_ULTIMATE.start_main_~x1~0))) is different from false [2019-12-07 11:34:46,425 WARN L860 $PredicateComparison]: unable to prove that (or (fp.eq c_ULTIMATE.start_main_~x1~0 c_ULTIMATE.start_main_~x~0) (fp.eq c_ULTIMATE.start_main_~x1~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0))) c_ULTIMATE.start_main_~x1~0))) is different from true [2019-12-07 11:34:48,946 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x1~0 .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq c_ULTIMATE.start_main_~x1~0 c_ULTIMATE.start_main_~x~0) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.eq .cse0 c_ULTIMATE.start_main_~x1~0)))) is different from false [2019-12-07 11:34:51,465 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x1~0 .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq c_ULTIMATE.start_main_~x1~0 c_ULTIMATE.start_main_~x~0) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.eq .cse0 c_ULTIMATE.start_main_~x1~0)))) is different from true [2019-12-07 11:34:54,254 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x1~0 .cse2))) (let ((.cse1 (fp.div c_currentRoundingMode .cse0 .cse2))) (or (fp.eq .cse0 c_ULTIMATE.start_main_~x1~0) (fp.eq .cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse1 .cse2) .cse1)) (fp.eq .cse1 .cse0))))) is different from false [2019-12-07 11:34:57,045 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x1~0 .cse2))) (let ((.cse1 (fp.div c_currentRoundingMode .cse0 .cse2))) (or (fp.eq .cse0 c_ULTIMATE.start_main_~x1~0) (fp.eq .cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse1 .cse2) .cse1)) (fp.eq .cse1 .cse0))))) is different from true [2019-12-07 11:35:00,098 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse2 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse3))) (let ((.cse1 (fp.div c_currentRoundingMode .cse2 .cse3))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 .cse3))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.eq .cse0 .cse1) (fp.eq .cse1 .cse2) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse3) .cse0))))))) is different from false [2019-12-07 11:35:03,183 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse2 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse3))) (let ((.cse1 (fp.div c_currentRoundingMode .cse2 .cse3))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 .cse3))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.eq .cse0 .cse1) (fp.eq .cse1 .cse2) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse3) .cse0))))))) is different from true [2019-12-07 11:35:03,185 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2019-12-07 11:35:03,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 11:35:03,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 6, 8, 7, 8] total 21 [2019-12-07 11:35:03,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955371336] [2019-12-07 11:35:03,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-07 11:35:03,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:35:03,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-07 11:35:03,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=42, Unknown=26, NotChecked=350, Total=462 [2019-12-07 11:35:03,187 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 22 states. [2019-12-07 11:35:06,228 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse4 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse5))) (let ((.cse3 (fp.div c_currentRoundingMode .cse4 .cse5))) (let ((.cse2 (fp.div c_currentRoundingMode .cse3 .cse5))) (let ((.cse0 (fp.eq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (.cse1 (not (fp.eq (fp.div c_currentRoundingMode .cse2 .cse5) .cse2)))) (and (or .cse0 .cse1) (or .cse0 (fp.eq .cse2 .cse3) (fp.eq .cse3 .cse4) .cse1) (= c_currentRoundingMode roundNearestTiesToEven))))))) is different from true [2019-12-07 11:35:08,960 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x1~0 .cse0))) (let ((.cse4 (fp.div c_currentRoundingMode .cse1 .cse0))) (let ((.cse2 (fp.eq .cse4 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (.cse3 (not (fp.eq (fp.div c_currentRoundingMode .cse4 .cse0) .cse4)))) (and (= c_ULTIMATE.start_main_~x1~0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0)) (or (fp.eq .cse1 c_ULTIMATE.start_main_~x1~0) .cse2 .cse3 (fp.eq .cse4 .cse1)) (or .cse2 .cse3) (= c_currentRoundingMode roundNearestTiesToEven)))))) is different from false [2019-12-07 11:35:11,737 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x1~0 .cse0))) (let ((.cse4 (fp.div c_currentRoundingMode .cse1 .cse0))) (let ((.cse2 (fp.eq .cse4 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (.cse3 (not (fp.eq (fp.div c_currentRoundingMode .cse4 .cse0) .cse4)))) (and (= c_ULTIMATE.start_main_~x1~0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0)) (or (fp.eq .cse1 c_ULTIMATE.start_main_~x1~0) .cse2 .cse3 (fp.eq .cse4 .cse1)) (or .cse2 .cse3) (= c_currentRoundingMode roundNearestTiesToEven)))))) is different from true [2019-12-07 11:35:14,249 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x1~0 .cse0))) (let ((.cse1 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0)) (.cse2 (not (fp.eq (fp.div c_currentRoundingMode .cse4 .cse0) .cse4))) (.cse3 (fp.eq .cse4 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))) (and (= c_ULTIMATE.start_main_~x1~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 .cse0)) (= c_ULTIMATE.start_main_~x1~0 (fp.div c_currentRoundingMode .cse1 .cse0)) (or .cse2 .cse3) (= .cse1 c_ULTIMATE.start_main_~x~0) (or .cse2 (fp.eq c_ULTIMATE.start_main_~x1~0 c_ULTIMATE.start_main_~x~0) .cse3 (fp.eq .cse4 c_ULTIMATE.start_main_~x1~0)) (= c_currentRoundingMode roundNearestTiesToEven))))) is different from false [2019-12-07 11:35:17,035 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x1~0 .cse0))) (let ((.cse1 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0)) (.cse2 (not (fp.eq (fp.div c_currentRoundingMode .cse4 .cse0) .cse4))) (.cse3 (fp.eq .cse4 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))) (and (= c_ULTIMATE.start_main_~x1~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 .cse0)) (= c_ULTIMATE.start_main_~x1~0 (fp.div c_currentRoundingMode .cse1 .cse0)) (or .cse2 .cse3) (= .cse1 c_ULTIMATE.start_main_~x~0) (or .cse2 (fp.eq c_ULTIMATE.start_main_~x1~0 c_ULTIMATE.start_main_~x~0) .cse3 (fp.eq .cse4 c_ULTIMATE.start_main_~x1~0)) (= c_currentRoundingMode roundNearestTiesToEven))))) is different from true [2019-12-07 11:35:19,560 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse3 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0))) (let ((.cse1 (fp.eq c_ULTIMATE.start_main_~x1~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (.cse2 (not (fp.eq (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x1~0 .cse0) c_ULTIMATE.start_main_~x1~0))) (.cse4 (fp.div c_currentRoundingMode .cse3 .cse0))) (and (= c_ULTIMATE.start_main_~x1~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 .cse0)) (or .cse1 .cse2) (not (fp.eq c_ULTIMATE.start_main_~x~0 .cse3)) (= c_ULTIMATE.start_main_~x~0 .cse4) (or (fp.eq c_ULTIMATE.start_main_~x1~0 c_ULTIMATE.start_main_~x~0) .cse1 .cse2) (= (fp.div c_currentRoundingMode .cse4 .cse0) c_ULTIMATE.start_main_~x1~0) (= c_currentRoundingMode roundNearestTiesToEven))))) is different from false [2019-12-07 11:35:22,307 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse3 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0))) (let ((.cse1 (fp.eq c_ULTIMATE.start_main_~x1~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (.cse2 (not (fp.eq (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x1~0 .cse0) c_ULTIMATE.start_main_~x1~0))) (.cse4 (fp.div c_currentRoundingMode .cse3 .cse0))) (and (= c_ULTIMATE.start_main_~x1~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 .cse0)) (or .cse1 .cse2) (not (fp.eq c_ULTIMATE.start_main_~x~0 .cse3)) (= c_ULTIMATE.start_main_~x~0 .cse4) (or (fp.eq c_ULTIMATE.start_main_~x1~0 c_ULTIMATE.start_main_~x~0) .cse1 .cse2) (= (fp.div c_currentRoundingMode .cse4 .cse0) c_ULTIMATE.start_main_~x1~0) (= c_currentRoundingMode roundNearestTiesToEven))))) is different from true [2019-12-07 11:35:25,364 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse2 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1))) (let ((.cse0 (fp.div c_currentRoundingMode .cse2 .cse1))) (and (= (fp.div c_currentRoundingMode .cse0 .cse1) c_ULTIMATE.start_main_~x~0) (= c_ULTIMATE.start_main_~x1~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 .cse1)) (= c_currentRoundingMode roundNearestTiesToEven) (not (fp.eq .cse0 .cse2)) (or (not (fp.eq c_ULTIMATE.start_main_~x1~0 c_ULTIMATE.start_main_~x~0)) (fp.eq c_ULTIMATE.start_main_~x~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (not (fp.eq c_ULTIMATE.start_main_~x~0 .cse0)))))) is different from false [2019-12-07 11:35:27,883 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse2 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1))) (let ((.cse0 (fp.div c_currentRoundingMode .cse2 .cse1))) (and (= (fp.div c_currentRoundingMode .cse0 .cse1) c_ULTIMATE.start_main_~x~0) (= c_ULTIMATE.start_main_~x1~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 .cse1)) (= c_currentRoundingMode roundNearestTiesToEven) (not (fp.eq .cse0 .cse2)) (or (not (fp.eq c_ULTIMATE.start_main_~x1~0 c_ULTIMATE.start_main_~x~0)) (fp.eq c_ULTIMATE.start_main_~x~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (not (fp.eq c_ULTIMATE.start_main_~x~0 .cse0)))))) is different from true [2019-12-07 11:35:39,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:35:39,471 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-12-07 11:35:39,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:35:39,472 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 9 [2019-12-07 11:35:39,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:35:39,472 INFO L225 Difference]: With dead ends: 15 [2019-12-07 11:35:39,472 INFO L226 Difference]: Without dead ends: 11 [2019-12-07 11:35:39,473 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 19 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 114.1s TimeCoverageRelationStatistics Valid=54, Invalid=43, Unknown=35, NotChecked=570, Total=702 [2019-12-07 11:35:39,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-12-07 11:35:39,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-12-07 11:35:39,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-12-07 11:35:39,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-12-07 11:35:39,476 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-12-07 11:35:39,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:35:39,476 INFO L462 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-12-07 11:35:39,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-07 11:35:39,476 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-12-07 11:35:39,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 11:35:39,477 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:35:39,477 INFO L410 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2019-12-07 11:35:40,078 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk,6 mathsat -unsat_core_generation=3,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:35:40,079 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:35:40,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:35:40,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1922847381, now seen corresponding path program 3 times [2019-12-07 11:35:40,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:35:40,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1774324300] [2019-12-07 11:35:40,081 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_192aa5d1-2464-4f93-9326-4bb3805889be/bin/utaipan/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-12-07 11:35:44,424 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 11:35:44,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:35:44,746 WARN L262 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 11:35:44,747 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:35:51,275 WARN L192 SmtUtils]: Spent 4.48 s on a formula simplification that was a NOOP. DAG size: 11 [2019-12-07 11:35:54,016 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~x1~0 (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2019-12-07 11:35:56,305 WARN L860 $PredicateComparison]: unable to prove that (and (= (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0)) c_ULTIMATE.start_main_~x1~0) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2019-12-07 11:36:00,409 WARN L860 $PredicateComparison]: unable to prove that (and (= (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0)) c_ULTIMATE.start_main_~x1~0) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2019-12-07 11:36:04,939 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (= c_ULTIMATE.start_main_~x1~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 .cse0)) (= (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0) c_ULTIMATE.start_main_~x~0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2019-12-07 11:36:04,942 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2019-12-07 11:36:04,942 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:36:07,281 WARN L838 $PredicateComparison]: unable to prove that (or (fp.eq c_ULTIMATE.start_main_~x1~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0))) c_ULTIMATE.start_main_~x1~0))) is different from false [2019-12-07 11:36:09,550 WARN L860 $PredicateComparison]: unable to prove that (or (fp.eq c_ULTIMATE.start_main_~x1~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0))) c_ULTIMATE.start_main_~x1~0))) is different from true [2019-12-07 11:36:12,077 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x1~0 .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from false [2019-12-07 11:36:14,609 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x1~0 .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from true [2019-12-07 11:36:17,395 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x1~0 .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) is different from false [2019-12-07 11:36:20,165 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x1~0 .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) is different from true [2019-12-07 11:36:23,222 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x1~0 .cse1) .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from false [2019-12-07 11:36:26,314 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x1~0 .cse1) .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from true [2019-12-07 11:36:28,635 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-12-07 11:36:28,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1774324300] [2019-12-07 11:36:28,636 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") [2019-12-07 11:36:28,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1617964857] [2019-12-07 11:36:28,637 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_192aa5d1-2464-4f93-9326-4bb3805889be/bin/utaipan/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 11:36:38,818 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 11:36:38,818 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:36:38,832 WARN L262 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 11:36:38,833 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:36:38,836 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@7f987128 [2019-12-07 11:36:38,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117363685] [2019-12-07 11:36:38,836 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_192aa5d1-2464-4f93-9326-4bb3805889be/bin/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:38:32,255 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 11:38:32,255 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:38:33,357 WARN L262 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 11:38:33,358 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:38:33,360 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@7f987128 [2019-12-07 11:38:33,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:38:33,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2019-12-07 11:38:33,360 ERROR L206 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2019-12-07 11:38:33,360 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 11:38:33,965 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3,10 cvc4 --incremental --print-success --lang smt --rewrite-divk,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:38:33,980 WARN L229 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-12-07 11:38:33,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:38:33 BoogieIcfgContainer [2019-12-07 11:38:33,980 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:38:33,980 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:38:33,980 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:38:33,981 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:38:33,981 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:24:34" (3/4) ... [2019-12-07 11:38:33,984 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 11:38:33,984 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:38:33,985 INFO L168 Benchmark]: Toolchain (without parser) took 844556.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 953.7 MB in the beginning and 929.4 MB in the end (delta: 24.3 MB). Peak memory consumption was 162.2 MB. Max. memory is 11.5 GB. [2019-12-07 11:38:33,985 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:38:33,986 INFO L168 Benchmark]: CACSL2BoogieTranslator took 140.63 ms. Allocated memory is still 1.0 GB. Free memory was 953.7 MB in the beginning and 943.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-12-07 11:38:33,986 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 943.0 MB in the beginning and 1.1 GB in the end (delta: -183.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. [2019-12-07 11:38:33,987 INFO L168 Benchmark]: Boogie Preprocessor took 16.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-12-07 11:38:33,987 INFO L168 Benchmark]: RCFGBuilder took 4420.40 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: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 11:38:33,987 INFO L168 Benchmark]: TraceAbstraction took 839916.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 929.4 MB in the end (delta: 172.0 MB). Peak memory consumption was 172.0 MB. Max. memory is 11.5 GB. [2019-12-07 11:38:33,988 INFO L168 Benchmark]: Witness Printer took 3.39 ms. Allocated memory is still 1.2 GB. Free memory is still 929.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:38:33,990 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 140.63 ms. Allocated memory is still 1.0 GB. Free memory was 953.7 MB in the beginning and 943.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 56.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 943.0 MB in the beginning and 1.1 GB in the end (delta: -183.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4420.40 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: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 839916.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 929.4 MB in the end (delta: 172.0 MB). Peak memory consumption was 172.0 MB. Max. memory is 11.5 GB. * Witness Printer took 3.39 ms. Allocated memory is still 1.2 GB. Free memory is still 929.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 2]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L9] double x = 1.0; [L10] double x1 = x/1.6; [L12] COND TRUE x1 != x [L14] x = x1 [L15] x1 = x/1.6 [L12] COND TRUE x1 != x [L14] x = x1 [L15] x1 = x/1.6 [L12] COND TRUE x1 != x [L14] x = x1 [L15] x1 = x/1.6 [L12] COND TRUE x1 != x [L14] x = x1 [L15] x1 = x/1.6 [L12] COND FALSE !(x1 != x) [L2] COND TRUE !(cond) [L2] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. Result: UNKNOWN, OverallTime: 839.8s, OverallIterations: 4, TraceHistogramMax: 4, AutomataDifference: 74.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 20 SDtfs, 10 SDslu, 36 SDs, 0 SdLazy, 25 SolverSat, 3 SolverUnsat, 9 SolverUnknown, 0 SolverNotchecked, 25.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 52 SyntacticMatches, 8 SemanticMatches, 51 ConstructedPredicates, 33 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 227.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 407.2s SatisfiabilityAnalysisTime, 182.8s InterpolantComputationTime, 57 NumberOfCodeBlocks, 57 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 100 ConstructedInterpolants, 0 QuantifiedInterpolants, 12268 SizeOfPredicates, 31 NumberOfNonLiveVariables, 115 ConjunctsInSsa, 73 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 0/54 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...