./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/floats-esbmc-regression/Double_div_bad_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9248566f-68ca-4d10-900f-5751e41d80f2/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9248566f-68ca-4d10-900f-5751e41d80f2/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9248566f-68ca-4d10-900f-5751e41d80f2/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9248566f-68ca-4d10-900f-5751e41d80f2/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/Double_div_bad_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_9248566f-68ca-4d10-900f-5751e41d80f2/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9248566f-68ca-4d10-900f-5751e41d80f2/bin-2019/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: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9248566f-68ca-4d10-900f-5751e41d80f2/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9248566f-68ca-4d10-900f-5751e41d80f2/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9248566f-68ca-4d10-900f-5751e41d80f2/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9248566f-68ca-4d10-900f-5751e41d80f2/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/Double_div_bad_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_9248566f-68ca-4d10-900f-5751e41d80f2/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9248566f-68ca-4d10-900f-5751e41d80f2/bin-2019/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: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 09:04:21,266 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 09:04:21,267 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 09:04:21,274 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 09:04:21,274 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 09:04:21,275 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 09:04:21,276 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 09:04:21,277 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 09:04:21,278 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 09:04:21,278 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 09:04:21,279 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 09:04:21,279 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 09:04:21,280 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 09:04:21,280 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 09:04:21,281 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 09:04:21,282 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 09:04:21,282 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 09:04:21,284 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 09:04:21,285 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 09:04:21,286 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 09:04:21,287 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 09:04:21,287 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 09:04:21,289 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 09:04:21,289 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 09:04:21,289 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 09:04:21,290 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 09:04:21,291 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 09:04:21,291 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 09:04:21,292 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 09:04:21,293 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 09:04:21,293 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 09:04:21,293 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 09:04:21,294 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 09:04:21,294 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 09:04:21,294 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 09:04:21,295 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 09:04:21,295 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9248566f-68ca-4d10-900f-5751e41d80f2/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 09:04:21,305 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 09:04:21,305 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 09:04:21,306 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 09:04:21,306 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 09:04:21,306 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 09:04:21,306 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 09:04:21,306 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 09:04:21,306 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 09:04:21,307 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 09:04:21,307 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 09:04:21,307 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 09:04:21,307 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 09:04:21,307 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 09:04:21,307 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 09:04:21,307 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 09:04:21,308 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 09:04:21,308 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 09:04:21,308 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 09:04:21,308 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 09:04:21,308 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 09:04:21,308 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 09:04:21,308 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 09:04:21,308 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 09:04:21,309 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 09:04:21,309 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 09:04:21,309 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 09:04:21,309 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 09:04:21,309 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 09:04:21,309 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 09:04:21,309 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 09:04:21,309 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 09:04:21,309 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 09:04:21,309 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 09:04:21,310 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 09:04:21,310 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 09:04:21,310 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 09:04:21,310 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 09:04:21,310 INFO L133 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/working_dir_9248566f-68ca-4d10-900f-5751e41d80f2/bin-2019/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 [2018-11-18 09:04:21,331 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 09:04:21,339 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 09:04:21,341 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 09:04:21,342 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 09:04:21,342 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 09:04:21,343 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9248566f-68ca-4d10-900f-5751e41d80f2/bin-2019/utaipan/../../sv-benchmarks/c/floats-esbmc-regression/Double_div_bad_false-unreach-call.i [2018-11-18 09:04:21,378 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9248566f-68ca-4d10-900f-5751e41d80f2/bin-2019/utaipan/data/445a83cd3/cdabc67c99424b5aaa75b52ce53edd7f/FLAG4e22ded6a [2018-11-18 09:04:21,798 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 09:04:21,799 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9248566f-68ca-4d10-900f-5751e41d80f2/sv-benchmarks/c/floats-esbmc-regression/Double_div_bad_false-unreach-call.i [2018-11-18 09:04:21,804 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9248566f-68ca-4d10-900f-5751e41d80f2/bin-2019/utaipan/data/445a83cd3/cdabc67c99424b5aaa75b52ce53edd7f/FLAG4e22ded6a [2018-11-18 09:04:21,815 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9248566f-68ca-4d10-900f-5751e41d80f2/bin-2019/utaipan/data/445a83cd3/cdabc67c99424b5aaa75b52ce53edd7f [2018-11-18 09:04:21,818 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 09:04:21,819 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 09:04:21,819 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 09:04:21,820 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 09:04:21,823 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 09:04:21,823 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:04:21" (1/1) ... [2018-11-18 09:04:21,825 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b4915a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:04:21, skipping insertion in model container [2018-11-18 09:04:21,826 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:04:21" (1/1) ... [2018-11-18 09:04:21,834 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 09:04:21,849 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 09:04:21,978 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:04:21,980 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 09:04:21,989 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:04:21,996 INFO L195 MainTranslator]: Completed translation [2018-11-18 09:04:21,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:04:21 WrapperNode [2018-11-18 09:04:21,997 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 09:04:21,997 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 09:04:21,997 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 09:04:21,997 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 09:04:22,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:04:21" (1/1) ... [2018-11-18 09:04:22,005 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:04:21" (1/1) ... [2018-11-18 09:04:22,009 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 09:04:22,009 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 09:04:22,009 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 09:04:22,009 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 09:04:22,015 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:04:21" (1/1) ... [2018-11-18 09:04:22,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:04:21" (1/1) ... [2018-11-18 09:04:22,015 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:04:21" (1/1) ... [2018-11-18 09:04:22,015 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:04:21" (1/1) ... [2018-11-18 09:04:22,018 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:04:21" (1/1) ... [2018-11-18 09:04:22,020 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:04:21" (1/1) ... [2018-11-18 09:04:22,021 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:04:21" (1/1) ... [2018-11-18 09:04:22,022 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 09:04:22,022 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 09:04:22,022 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 09:04:22,022 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 09:04:22,023 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:04:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9248566f-68ca-4d10-900f-5751e41d80f2/bin-2019/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 [2018-11-18 09:04:22,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 09:04:22,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 09:04:22,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 09:04:22,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 09:04:22,095 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 09:04:22,095 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 09:04:22,095 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 09:04:22,095 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 09:04:22,183 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 09:04:22,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:04:22 BoogieIcfgContainer [2018-11-18 09:04:22,183 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 09:04:22,184 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 09:04:22,184 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 09:04:22,186 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 09:04:22,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:04:21" (1/3) ... [2018-11-18 09:04:22,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@573efb31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:04:22, skipping insertion in model container [2018-11-18 09:04:22,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:04:21" (2/3) ... [2018-11-18 09:04:22,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@573efb31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:04:22, skipping insertion in model container [2018-11-18 09:04:22,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:04:22" (3/3) ... [2018-11-18 09:04:22,188 INFO L112 eAbstractionObserver]: Analyzing ICFG Double_div_bad_false-unreach-call.i [2018-11-18 09:04:22,193 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 09:04:22,197 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 09:04:22,209 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 09:04:22,228 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 09:04:22,228 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 09:04:22,228 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 09:04:22,228 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 09:04:22,228 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 09:04:22,228 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 09:04:22,229 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 09:04:22,229 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 09:04:22,243 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-18 09:04:22,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-18 09:04:22,247 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:04:22,248 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:04:22,249 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:04:22,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:04:22,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1871509567, now seen corresponding path program 1 times [2018-11-18 09:04:22,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:04:22,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:04:22,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:04:22,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:04:22,284 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:04:22,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:04:22,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:04:22,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:04:22,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 09:04:22,317 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:04:22,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 09:04:22,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 09:04:22,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 09:04:22,329 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-18 09:04:22,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:04:22,341 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-11-18 09:04:22,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 09:04:22,342 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-18 09:04:22,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:04:22,346 INFO L225 Difference]: With dead ends: 31 [2018-11-18 09:04:22,346 INFO L226 Difference]: Without dead ends: 12 [2018-11-18 09:04:22,348 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 09:04:22,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-18 09:04:22,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-18 09:04:22,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 09:04:22,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-18 09:04:22,374 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-18 09:04:22,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:04:22,374 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-18 09:04:22,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 09:04:22,374 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-18 09:04:22,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-18 09:04:22,375 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:04:22,375 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:04:22,375 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:04:22,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:04:22,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1861991801, now seen corresponding path program 1 times [2018-11-18 09:04:22,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:04:22,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:04:22,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:04:22,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:04:22,377 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:04:22,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:04:22,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:04:22,398 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 09:04:22,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 09:04:22 BoogieIcfgContainer [2018-11-18 09:04:22,412 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 09:04:22,412 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 09:04:22,412 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 09:04:22,412 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 09:04:22,413 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:04:22" (3/4) ... [2018-11-18 09:04:22,415 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 09:04:22,415 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 09:04:22,416 INFO L168 Benchmark]: Toolchain (without parser) took 597.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 959.2 MB in the beginning and 1.1 GB in the end (delta: -140.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:04:22,417 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:04:22,417 INFO L168 Benchmark]: CACSL2BoogieTranslator took 177.56 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 09:04:22,417 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.82 ms. Allocated memory is still 1.0 GB. Free memory is still 948.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:04:22,417 INFO L168 Benchmark]: Boogie Preprocessor took 12.50 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 09:04:22,418 INFO L168 Benchmark]: RCFGBuilder took 161.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -180.6 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2018-11-18 09:04:22,419 INFO L168 Benchmark]: TraceAbstraction took 228.24 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: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2018-11-18 09:04:22,419 INFO L168 Benchmark]: Witness Printer took 2.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:04:22,421 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 177.56 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 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 11.82 ms. Allocated memory is still 1.0 GB. Free memory is still 948.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 12.50 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 161.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -180.6 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 228.24 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: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Witness Printer took 2.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 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; VAL [x=1] [L12] COND FALSE !(x1 != x) VAL [x=1] [L18] CALL __VERIFIER_assert(x == 0) VAL [\old(cond)=0] [L2] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L2] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. UNSAFE Result, 0.1s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 19 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 81 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-5842f4b [2018-11-18 09:04:23,854 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 09:04:23,855 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 09:04:23,864 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 09:04:23,865 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 09:04:23,865 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 09:04:23,866 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 09:04:23,867 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 09:04:23,869 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 09:04:23,869 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 09:04:23,870 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 09:04:23,870 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 09:04:23,871 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 09:04:23,871 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 09:04:23,872 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 09:04:23,873 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 09:04:23,873 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 09:04:23,875 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 09:04:23,876 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 09:04:23,877 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 09:04:23,878 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 09:04:23,879 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 09:04:23,880 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 09:04:23,881 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 09:04:23,881 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 09:04:23,881 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 09:04:23,882 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 09:04:23,883 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 09:04:23,883 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 09:04:23,884 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 09:04:23,884 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 09:04:23,885 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 09:04:23,885 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 09:04:23,885 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 09:04:23,885 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 09:04:23,886 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 09:04:23,886 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9248566f-68ca-4d10-900f-5751e41d80f2/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-18 09:04:23,897 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 09:04:23,897 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 09:04:23,897 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 09:04:23,898 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 09:04:23,898 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 09:04:23,898 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 09:04:23,898 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 09:04:23,898 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 09:04:23,898 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 09:04:23,898 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 09:04:23,899 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 09:04:23,899 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 09:04:23,899 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 09:04:23,899 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 09:04:23,900 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 09:04:23,900 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 09:04:23,900 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 09:04:23,900 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 09:04:23,900 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 09:04:23,900 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 09:04:23,900 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 09:04:23,901 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 09:04:23,901 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 09:04:23,901 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 09:04:23,901 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 09:04:23,901 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 09:04:23,901 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 09:04:23,901 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 09:04:23,902 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 09:04:23,902 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 09:04:23,902 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 09:04:23,902 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-18 09:04:23,902 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 09:04:23,902 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 09:04:23,902 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 09:04:23,903 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_9248566f-68ca-4d10-900f-5751e41d80f2/bin-2019/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 [2018-11-18 09:04:23,933 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 09:04:23,942 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 09:04:23,945 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 09:04:23,946 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 09:04:23,946 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 09:04:23,947 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9248566f-68ca-4d10-900f-5751e41d80f2/bin-2019/utaipan/../../sv-benchmarks/c/floats-esbmc-regression/Double_div_bad_false-unreach-call.i [2018-11-18 09:04:23,988 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9248566f-68ca-4d10-900f-5751e41d80f2/bin-2019/utaipan/data/a7e2a07fa/5c94c45d37b147cdadd623147444873c/FLAGf0da49ea5 [2018-11-18 09:04:24,379 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 09:04:24,380 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9248566f-68ca-4d10-900f-5751e41d80f2/sv-benchmarks/c/floats-esbmc-regression/Double_div_bad_false-unreach-call.i [2018-11-18 09:04:24,383 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9248566f-68ca-4d10-900f-5751e41d80f2/bin-2019/utaipan/data/a7e2a07fa/5c94c45d37b147cdadd623147444873c/FLAGf0da49ea5 [2018-11-18 09:04:24,392 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9248566f-68ca-4d10-900f-5751e41d80f2/bin-2019/utaipan/data/a7e2a07fa/5c94c45d37b147cdadd623147444873c [2018-11-18 09:04:24,393 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 09:04:24,395 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 09:04:24,395 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 09:04:24,396 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 09:04:24,399 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 09:04:24,399 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:04:24" (1/1) ... [2018-11-18 09:04:24,402 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@df5c0b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:04:24, skipping insertion in model container [2018-11-18 09:04:24,402 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:04:24" (1/1) ... [2018-11-18 09:04:24,407 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 09:04:24,419 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 09:04:24,534 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:04:24,540 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 09:04:24,551 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:04:24,560 INFO L195 MainTranslator]: Completed translation [2018-11-18 09:04:24,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:04:24 WrapperNode [2018-11-18 09:04:24,560 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 09:04:24,561 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 09:04:24,561 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 09:04:24,561 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 09:04:24,566 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:04:24" (1/1) ... [2018-11-18 09:04:24,570 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:04:24" (1/1) ... [2018-11-18 09:04:24,574 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 09:04:24,574 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 09:04:24,574 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 09:04:24,574 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 09:04:24,579 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:04:24" (1/1) ... [2018-11-18 09:04:24,579 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:04:24" (1/1) ... [2018-11-18 09:04:24,580 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:04:24" (1/1) ... [2018-11-18 09:04:24,581 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:04:24" (1/1) ... [2018-11-18 09:04:24,585 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:04:24" (1/1) ... [2018-11-18 09:04:24,589 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:04:24" (1/1) ... [2018-11-18 09:04:24,590 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:04:24" (1/1) ... [2018-11-18 09:04:24,592 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 09:04:24,592 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 09:04:24,592 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 09:04:24,592 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 09:04:24,593 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:04:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9248566f-68ca-4d10-900f-5751e41d80f2/bin-2019/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 [2018-11-18 09:04:24,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 09:04:24,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 09:04:24,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 09:04:24,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 09:04:24,671 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 09:04:24,671 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 09:04:24,671 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 09:04:24,671 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 09:04:25,481 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 09:04:25,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:04:25 BoogieIcfgContainer [2018-11-18 09:04:25,482 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 09:04:25,483 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 09:04:25,483 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 09:04:25,484 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 09:04:25,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:04:24" (1/3) ... [2018-11-18 09:04:25,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e932452 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:04:25, skipping insertion in model container [2018-11-18 09:04:25,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:04:24" (2/3) ... [2018-11-18 09:04:25,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e932452 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:04:25, skipping insertion in model container [2018-11-18 09:04:25,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:04:25" (3/3) ... [2018-11-18 09:04:25,487 INFO L112 eAbstractionObserver]: Analyzing ICFG Double_div_bad_false-unreach-call.i [2018-11-18 09:04:25,492 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 09:04:25,496 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 09:04:25,505 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 09:04:25,522 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 09:04:25,523 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 09:04:25,523 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 09:04:25,523 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 09:04:25,523 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 09:04:25,523 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 09:04:25,523 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 09:04:25,524 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 09:04:25,524 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 09:04:25,538 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-18 09:04:25,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-18 09:04:25,542 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:04:25,543 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:04:25,544 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:04:25,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:04:25,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1871509567, now seen corresponding path program 1 times [2018-11-18 09:04:25,550 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 09:04:25,550 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9248566f-68ca-4d10-900f-5751e41d80f2/bin-2019/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 [2018-11-18 09:04:25,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:04:25,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:04:25,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:04:25,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:04:25,806 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 09:04:25,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:04:25,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 09:04:25,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 09:04:25,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 09:04:25,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 09:04:25,834 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-18 09:04:25,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:04:25,849 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-11-18 09:04:25,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 09:04:25,850 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-18 09:04:25,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:04:25,854 INFO L225 Difference]: With dead ends: 31 [2018-11-18 09:04:25,854 INFO L226 Difference]: Without dead ends: 12 [2018-11-18 09:04:25,856 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 09:04:25,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-18 09:04:25,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-18 09:04:25,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 09:04:25,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-18 09:04:25,881 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-18 09:04:25,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:04:25,882 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-18 09:04:25,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 09:04:25,882 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-18 09:04:25,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-18 09:04:25,882 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:04:25,883 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:04:25,883 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:04:25,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:04:25,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1861991801, now seen corresponding path program 1 times [2018-11-18 09:04:25,883 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 09:04:25,884 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9248566f-68ca-4d10-900f-5751e41d80f2/bin-2019/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 [2018-11-18 09:04:25,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:04:26,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:04:26,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:04:27,695 WARN L180 SmtUtils]: Spent 1.56 s on a formula simplification that was a NOOP. DAG size: 11 [2018-11-18 09:04:27,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:04:27,701 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 09:04:27,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:04:27,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:04:27,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:04:27,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:04:27,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:04:27,713 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 3 states. [2018-11-18 09:04:28,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:04:28,999 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-18 09:04:29,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:04:29,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-18 09:04:29,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:04:29,612 INFO L225 Difference]: With dead ends: 19 [2018-11-18 09:04:29,612 INFO L226 Difference]: Without dead ends: 14 [2018-11-18 09:04:29,612 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:04:29,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-18 09:04:29,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-18 09:04:29,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 09:04:29,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-18 09:04:29,616 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-11-18 09:04:29,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:04:29,616 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-18 09:04:29,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:04:29,616 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-18 09:04:29,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-18 09:04:29,617 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:04:29,617 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:04:29,617 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:04:29,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:04:29,617 INFO L82 PathProgramCache]: Analyzing trace with hash -661808769, now seen corresponding path program 1 times [2018-11-18 09:04:29,617 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 09:04:29,618 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9248566f-68ca-4d10-900f-5751e41d80f2/bin-2019/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-11-18 09:04:29,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:04:30,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:04:30,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:04:35,909 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification that was a NOOP. DAG size: 12 [2018-11-18 09:04:35,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:04:35,912 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 09:04:38,139 WARN L832 $PredicateComparison]: unable to prove that (not (fp.eq (fp.div roundNearestTiesToEven c_main_~x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0))) c_main_~x1~0)) is different from false [2018-11-18 09:04:38,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-11-18 09:04:38,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:04:38,685 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9248566f-68ca-4d10-900f-5751e41d80f2/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:04:38,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:04:50,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2018-11-18 09:04:52,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:04:52,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-18 09:04:52,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 09:04:52,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 09:04:52,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2018-11-18 09:04:52,025 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 6 states. [2018-11-18 09:04:55,679 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2018-11-18 09:04:59,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:04:59,762 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2018-11-18 09:04:59,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 09:04:59,962 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-11-18 09:04:59,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:04:59,963 INFO L225 Difference]: With dead ends: 23 [2018-11-18 09:04:59,963 INFO L226 Difference]: Without dead ends: 18 [2018-11-18 09:04:59,964 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=14, Invalid=19, Unknown=1, NotChecked=8, Total=42 [2018-11-18 09:04:59,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-18 09:04:59,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-18 09:04:59,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 09:04:59,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-11-18 09:04:59,967 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 13 [2018-11-18 09:04:59,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:04:59,968 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-11-18 09:04:59,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 09:04:59,968 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-18 09:04:59,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 09:04:59,968 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:04:59,969 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:04:59,969 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:04:59,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:04:59,969 INFO L82 PathProgramCache]: Analyzing trace with hash 2058417419, now seen corresponding path program 2 times [2018-11-18 09:04:59,969 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 09:04:59,970 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9248566f-68ca-4d10-900f-5751e41d80f2/bin-2019/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 [2018-11-18 09:04:59,976 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-18 09:05:00,803 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 09:05:00,803 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 09:05:00,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:05:08,570 WARN L180 SmtUtils]: Spent 2.59 s on a formula simplification that was a NOOP. DAG size: 14 [2018-11-18 09:05:08,573 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:05:08,573 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 09:05:17,621 WARN L832 $PredicateComparison]: unable to prove that (or (not (fp.eq (fp.div roundNearestTiesToEven c_main_~x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0))) c_main_~x1~0)) (fp.eq c_main_~x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) is different from false [2018-11-18 09:05:21,239 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))) is different from false [2018-11-18 09:05:23,616 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))) is different from true [2018-11-18 09:05:26,178 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) .cse1))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))) is different from false [2018-11-18 09:05:28,735 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) .cse1))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))) is different from true [2018-11-18 09:05:28,750 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2018-11-18 09:05:28,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:05:28,775 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9248566f-68ca-4d10-900f-5751e41d80f2/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:05:28,781 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 09:05:42,628 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 09:05:42,628 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2018-11-18 09:05:44,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:05:44,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 13 [2018-11-18 09:05:44,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 09:05:44,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 09:05:44,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=71, Unknown=6, NotChecked=54, Total=156 [2018-11-18 09:05:44,870 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 13 states. [2018-11-18 09:05:47,462 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (= c_main_~x1~0 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0)) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse0) .cse0))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse1 .cse0) .cse1)) (fp.eq .cse1 .cse2))) (or (fp.eq c_main_~x~0 .cse2) (not (fp.eq c_main_~x1~0 c_main_~x~0))))) is different from true [2018-11-18 09:05:49,858 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (= c_main_~x1~0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0) .cse0)) (let ((.cse1 (fp.div roundNearestTiesToEven c_main_~x1~0 .cse0))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse1 .cse0) .cse1)) (fp.eq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))))))) is different from true [2018-11-18 09:05:59,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:05:59,426 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-11-18 09:05:59,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 09:05:59,426 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 17 [2018-11-18 09:05:59,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:05:59,427 INFO L225 Difference]: With dead ends: 30 [2018-11-18 09:05:59,427 INFO L226 Difference]: Without dead ends: 22 [2018-11-18 09:05:59,427 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 36.9s TimeCoverageRelationStatistics Valid=33, Invalid=89, Unknown=8, NotChecked=110, Total=240 [2018-11-18 09:05:59,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-18 09:05:59,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-18 09:05:59,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-18 09:05:59,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-11-18 09:05:59,432 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 17 [2018-11-18 09:05:59,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:05:59,432 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-11-18 09:05:59,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 09:05:59,432 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-18 09:05:59,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 09:05:59,432 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:05:59,433 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:05:59,433 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:05:59,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:05:59,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1566812823, now seen corresponding path program 3 times [2018-11-18 09:05:59,433 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 09:05:59,433 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9248566f-68ca-4d10-900f-5751e41d80f2/bin-2019/utaipan/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-11-18 09:05:59,436 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-18 09:06:00,899 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-18 09:06:00,899 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 09:06:00,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:06:03,268 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (= c_main_~x1~0 (fp.div roundNearestTiesToEven c_main_~x~0 .cse0)) (= (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0) .cse0) .cse0) .cse0) .cse0) c_main_~x~0))) is different from true [2018-11-18 09:06:03,272 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2018-11-18 09:06:03,272 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 09:06:05,563 WARN L832 $PredicateComparison]: unable to prove that (or (not (fp.eq (fp.div roundNearestTiesToEven c_main_~x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0))) c_main_~x1~0)) (fp.eq c_main_~x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) is different from false [2018-11-18 09:06:08,728 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))) is different from false [2018-11-18 09:06:11,132 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))) is different from true [2018-11-18 09:06:13,743 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) .cse1))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))) is different from false [2018-11-18 09:06:16,359 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) .cse1))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))) is different from true [2018-11-18 09:06:19,123 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0))))) is different from false [2018-11-18 09:06:21,907 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0))))) is different from true [2018-11-18 09:06:24,892 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) .cse1) .cse1) .cse1))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))) is different from false [2018-11-18 09:06:27,858 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) .cse1) .cse1) .cse1))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))) is different from true [2018-11-18 09:06:27,873 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 30 not checked. [2018-11-18 09:06:27,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:06:27,894 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9248566f-68ca-4d10-900f-5751e41d80f2/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:06:27,902 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 09:07:21,222 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-18 09:07:21,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Forcibly destroying the process [2018-11-18 09:07:23,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:07:23,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 17 [2018-11-18 09:07:23,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-18 09:07:23,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 09:07:23,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=92, Unknown=10, NotChecked=138, Total=272 [2018-11-18 09:07:23,116 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 17 states. [2018-11-18 09:07:26,101 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (= c_main_~x1~0 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0)) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse0) .cse0) .cse0) .cse0))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse1 .cse0) .cse1)) (fp.eq .cse1 .cse2))) (or (fp.eq c_main_~x~0 .cse2) (not (fp.eq c_main_~x1~0 c_main_~x~0))))) is different from true [2018-11-18 09:07:28,912 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (= c_main_~x1~0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0) .cse0)) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse0) .cse0) .cse0))) (or (fp.eq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq (fp.div roundNearestTiesToEven .cse1 .cse0) .cse1)))))) is different from true [2018-11-18 09:07:31,538 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (= c_main_~x1~0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0) .cse0) .cse0)) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse0) .cse0))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse1 .cse0) .cse1)) (fp.eq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))))))) is different from true [2018-11-18 09:07:33,953 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (= c_main_~x1~0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0) .cse0) .cse0) .cse0)) (let ((.cse1 (fp.div roundNearestTiesToEven c_main_~x1~0 .cse0))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse1 .cse0) .cse1)) (fp.eq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))))))) is different from true [2018-11-18 09:07:36,164 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (or (not (fp.eq (fp.div roundNearestTiesToEven c_main_~x1~0 .cse0) c_main_~x1~0)) (fp.eq c_main_~x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (= c_main_~x1~0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0) .cse0) .cse0) .cse0) .cse0)))) is different from true [2018-11-18 09:07:43,747 WARN L180 SmtUtils]: Spent 6.03 s on a formula simplification. DAG size of input: 22 DAG size of output: 16 [2018-11-18 09:07:50,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:07:50,457 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-11-18 09:07:50,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 09:07:50,458 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 21 [2018-11-18 09:07:50,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:07:50,458 INFO L225 Difference]: With dead ends: 34 [2018-11-18 09:07:50,458 INFO L226 Difference]: Without dead ends: 26 [2018-11-18 09:07:50,459 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 47.4s TimeCoverageRelationStatistics Valid=49, Invalid=136, Unknown=15, NotChecked=352, Total=552 [2018-11-18 09:07:50,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-18 09:07:50,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-18 09:07:50,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-18 09:07:50,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-11-18 09:07:50,463 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 21 [2018-11-18 09:07:50,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:07:50,463 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-11-18 09:07:50,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-18 09:07:50,464 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-18 09:07:50,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 09:07:50,464 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:07:50,464 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:07:50,465 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:07:50,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:07:50,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1788298717, now seen corresponding path program 4 times [2018-11-18 09:07:50,465 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 09:07:50,465 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9248566f-68ca-4d10-900f-5751e41d80f2/bin-2019/utaipan/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2018-11-18 09:07:50,469 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 09:07:52,158 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 09:07:52,158 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 09:07:52,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:08:06,615 WARN L180 SmtUtils]: Spent 1.19 s on a formula simplification that was a NOOP. DAG size: 18 [2018-11-18 09:08:06,618 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:08:06,619 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 09:08:33,197 WARN L180 SmtUtils]: Spent 2.76 s on a formula simplification that was a NOOP. DAG size: 7 [2018-11-18 09:08:35,617 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2018-11-18 09:08:38,028 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2018-11-18 09:08:40,648 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2018-11-18 09:08:46,088 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2018-11-18 09:08:48,930 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2018-11-18 09:08:51,971 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2018-11-18 09:08:54,990 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2018-11-18 09:08:58,232 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2018-11-18 09:09:01,455 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2018-11-18 09:09:04,820 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2018-11-18 09:09:08,246 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2018-11-18 09:09:08,264 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 54 not checked. [2018-11-18 09:09:08,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:09:08,290 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9248566f-68ca-4d10-900f-5751e41d80f2/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:09:08,296 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 09:09:32,314 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 09:09:32,315 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Forcibly destroying the process [2018-11-18 09:09:33,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:09:33,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-11-18 09:09:33,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-18 09:09:33,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-18 09:09:33,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=93, Unknown=21, NotChecked=150, Total=306 [2018-11-18 09:09:33,972 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 18 states. [2018-11-18 09:09:37,486 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (= c_main_~x1~0 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0)) (not (let ((.cse1 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse0) .cse0) .cse0) .cse0) .cse0) .cse0))) (fp.eq (fp.div roundNearestTiesToEven .cse1 .cse0) .cse1))) (not (fp.eq c_main_~x1~0 c_main_~x~0)))) is different from true [2018-11-18 09:09:40,719 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (not (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0))) (= c_main_~x1~0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse1) .cse1)) (not (fp.eq c_main_~x1~0 c_main_~x~0)))) is different from true [2018-11-18 09:09:43,774 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (= c_main_~x1~0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0) .cse0) .cse0)) (not (let ((.cse1 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse0) .cse0) .cse0) .cse0))) (fp.eq (fp.div roundNearestTiesToEven .cse1 .cse0) .cse1))))) is different from true [2018-11-18 09:09:46,617 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (= c_main_~x1~0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0) .cse0) .cse0) .cse0)) (not (let ((.cse1 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse0) .cse0) .cse0))) (fp.eq (fp.div roundNearestTiesToEven .cse1 .cse0) .cse1))))) is different from true [2018-11-18 09:09:49,255 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (not (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0))) (= c_main_~x1~0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse1) .cse1) .cse1) .cse1) .cse1)))) is different from true [2018-11-18 09:09:53,254 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (not (let ((.cse0 (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0))) (= c_main_~x1~0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1)))) is different from true [2018-11-18 09:10:08,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:10:08,340 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2018-11-18 09:10:08,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 09:10:08,764 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 25 [2018-11-18 09:10:08,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:10:08,765 INFO L225 Difference]: With dead ends: 35 [2018-11-18 09:10:08,765 INFO L226 Difference]: Without dead ends: 30 [2018-11-18 09:10:08,766 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 96.4s TimeCoverageRelationStatistics Valid=59, Invalid=118, Unknown=27, NotChecked=396, Total=600 [2018-11-18 09:10:08,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-18 09:10:08,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-18 09:10:08,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-18 09:10:08,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-11-18 09:10:08,770 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 25 [2018-11-18 09:10:08,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:10:08,771 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-11-18 09:10:08,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-18 09:10:08,771 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-18 09:10:08,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 09:10:08,772 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:10:08,772 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:10:08,772 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:10:08,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:10:08,772 INFO L82 PathProgramCache]: Analyzing trace with hash 503522223, now seen corresponding path program 5 times [2018-11-18 09:10:08,772 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 09:10:08,773 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9248566f-68ca-4d10-900f-5751e41d80f2/bin-2019/utaipan/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2018-11-18 09:10:08,776 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2018-11-18 09:10:11,519 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-11-18 09:10:11,519 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 09:10:11,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:10:14,039 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (= c_main_~x1~0 (fp.div roundNearestTiesToEven c_main_~x~0 .cse0)) (= (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) c_main_~x~0))) is different from true [2018-11-18 09:10:14,043 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 18 not checked. [2018-11-18 09:10:14,043 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 09:10:16,290 WARN L832 $PredicateComparison]: unable to prove that (not (fp.eq (fp.div roundNearestTiesToEven c_main_~x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0))) c_main_~x1~0)) is different from false [2018-11-18 09:10:19,272 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2018-11-18 09:10:21,688 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2018-11-18 09:10:24,320 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2018-11-18 09:10:26,965 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2018-11-18 09:10:29,796 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2018-11-18 09:10:32,635 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2018-11-18 09:10:34,107 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-11-18 09:10:34,308 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2018-11-18 09:10:34,308 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:823) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:767) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:339) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 40 more [2018-11-18 09:10:34,311 INFO L168 Benchmark]: Toolchain (without parser) took 369917.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 949.7 MB in the beginning and 879.8 MB in the end (delta: 70.0 MB). Peak memory consumption was 218.8 MB. Max. memory is 11.5 GB. [2018-11-18 09:10:34,312 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:10:34,312 INFO L168 Benchmark]: CACSL2BoogieTranslator took 165.09 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 939.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 09:10:34,312 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.00 ms. Allocated memory is still 1.0 GB. Free memory was 939.0 MB in the beginning and 933.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-18 09:10:34,313 INFO L168 Benchmark]: Boogie Preprocessor took 18.01 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:10:34,313 INFO L168 Benchmark]: RCFGBuilder took 889.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -191.6 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2018-11-18 09:10:34,313 INFO L168 Benchmark]: TraceAbstraction took 368827.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 879.8 MB in the end (delta: 238.6 MB). Peak memory consumption was 238.6 MB. Max. memory is 11.5 GB. [2018-11-18 09:10:34,316 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 165.09 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 939.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 13.00 ms. Allocated memory is still 1.0 GB. Free memory was 939.0 MB in the beginning and 933.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.01 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 889.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -191.6 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 368827.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 879.8 MB in the end (delta: 238.6 MB). Peak memory consumption was 238.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...