./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/float-benchs/bary_diverge_true-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_90686f4c-f71f-4885-b8b1-3330c1835a0a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_90686f4c-f71f-4885-b8b1-3330c1835a0a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_90686f4c-f71f-4885-b8b1-3330c1835a0a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_90686f4c-f71f-4885-b8b1-3330c1835a0a/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/bary_diverge_true-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_90686f4c-f71f-4885-b8b1-3330c1835a0a/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_90686f4c-f71f-4885-b8b1-3330c1835a0a/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b00bb4cbbb267b3a6dbfbb1f9808dfa82de7ed74 ........................................................................................................................................................................................................................................................................... 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_90686f4c-f71f-4885-b8b1-3330c1835a0a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_90686f4c-f71f-4885-b8b1-3330c1835a0a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_90686f4c-f71f-4885-b8b1-3330c1835a0a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_90686f4c-f71f-4885-b8b1-3330c1835a0a/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/bary_diverge_true-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_90686f4c-f71f-4885-b8b1-3330c1835a0a/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_90686f4c-f71f-4885-b8b1-3330c1835a0a/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b00bb4cbbb267b3a6dbfbb1f9808dfa82de7ed74 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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. No stderr output. --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 04:24:27,817 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 04:24:27,818 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 04:24:27,826 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 04:24:27,826 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 04:24:27,827 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 04:24:27,827 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 04:24:27,828 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 04:24:27,829 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 04:24:27,830 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 04:24:27,831 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 04:24:27,831 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 04:24:27,832 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 04:24:27,832 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 04:24:27,833 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 04:24:27,834 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 04:24:27,834 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 04:24:27,836 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 04:24:27,837 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 04:24:27,838 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 04:24:27,839 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 04:24:27,840 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 04:24:27,841 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 04:24:27,841 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 04:24:27,842 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 04:24:27,842 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 04:24:27,843 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 04:24:27,843 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 04:24:27,844 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 04:24:27,845 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 04:24:27,845 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 04:24:27,845 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 04:24:27,846 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 04:24:27,846 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 04:24:27,846 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 04:24:27,847 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 04:24:27,847 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_90686f4c-f71f-4885-b8b1-3330c1835a0a/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 04:24:27,857 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 04:24:27,857 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 04:24:27,858 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 04:24:27,858 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 04:24:27,858 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 04:24:27,859 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 04:24:27,859 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 04:24:27,859 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 04:24:27,859 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 04:24:27,859 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 04:24:27,859 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 04:24:27,859 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 04:24:27,860 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 04:24:27,860 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 04:24:27,860 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 04:24:27,860 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 04:24:27,860 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 04:24:27,860 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 04:24:27,860 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 04:24:27,861 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 04:24:27,861 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 04:24:27,861 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 04:24:27,861 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 04:24:27,861 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 04:24:27,861 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 04:24:27,861 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 04:24:27,862 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 04:24:27,862 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 04:24:27,862 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 04:24:27,862 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_90686f4c-f71f-4885-b8b1-3330c1835a0a/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b00bb4cbbb267b3a6dbfbb1f9808dfa82de7ed74 [2018-11-10 04:24:27,884 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 04:24:27,891 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 04:24:27,893 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 04:24:27,894 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 04:24:27,894 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 04:24:27,895 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_90686f4c-f71f-4885-b8b1-3330c1835a0a/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/bary_diverge_true-unreach-call_true-termination.c [2018-11-10 04:24:27,939 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_90686f4c-f71f-4885-b8b1-3330c1835a0a/bin-2019/uautomizer/data/10d7d588c/a63ae9b817834246a33068b60efb0921/FLAGd26c75b9e [2018-11-10 04:24:28,249 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 04:24:28,250 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_90686f4c-f71f-4885-b8b1-3330c1835a0a/sv-benchmarks/c/float-benchs/bary_diverge_true-unreach-call_true-termination.c [2018-11-10 04:24:28,255 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_90686f4c-f71f-4885-b8b1-3330c1835a0a/bin-2019/uautomizer/data/10d7d588c/a63ae9b817834246a33068b60efb0921/FLAGd26c75b9e [2018-11-10 04:24:28,265 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_90686f4c-f71f-4885-b8b1-3330c1835a0a/bin-2019/uautomizer/data/10d7d588c/a63ae9b817834246a33068b60efb0921 [2018-11-10 04:24:28,267 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 04:24:28,268 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 04:24:28,269 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 04:24:28,269 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 04:24:28,271 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 04:24:28,272 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:24:28" (1/1) ... [2018-11-10 04:24:28,273 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f1788b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:24:28, skipping insertion in model container [2018-11-10 04:24:28,273 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:24:28" (1/1) ... [2018-11-10 04:24:28,279 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 04:24:28,293 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 04:24:28,398 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:24:28,400 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 04:24:28,411 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:24:28,419 INFO L193 MainTranslator]: Completed translation [2018-11-10 04:24:28,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:24:28 WrapperNode [2018-11-10 04:24:28,420 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 04:24:28,420 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 04:24:28,420 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 04:24:28,420 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 04:24:28,427 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:24:28" (1/1) ... [2018-11-10 04:24:28,428 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:24:28" (1/1) ... [2018-11-10 04:24:28,433 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:24:28" (1/1) ... [2018-11-10 04:24:28,433 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:24:28" (1/1) ... [2018-11-10 04:24:28,435 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:24:28" (1/1) ... [2018-11-10 04:24:28,438 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:24:28" (1/1) ... [2018-11-10 04:24:28,439 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:24:28" (1/1) ... [2018-11-10 04:24:28,440 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 04:24:28,440 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 04:24:28,440 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 04:24:28,440 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 04:24:28,440 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:24:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_90686f4c-f71f-4885-b8b1-3330c1835a0a/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 04:24:28,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 04:24:28,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 04:24:28,511 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-10 04:24:28,511 INFO L138 BoogieDeclarations]: Found implementation of procedure RANDOM_INPUT [2018-11-10 04:24:28,511 INFO L138 BoogieDeclarations]: Found implementation of procedure wait_for_clock [2018-11-10 04:24:28,511 INFO L138 BoogieDeclarations]: Found implementation of procedure bary [2018-11-10 04:24:28,511 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 04:24:28,512 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 04:24:28,512 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_float [2018-11-10 04:24:28,512 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-10 04:24:28,512 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-10 04:24:28,512 INFO L130 BoogieDeclarations]: Found specification of procedure RANDOM_INPUT [2018-11-10 04:24:28,512 INFO L130 BoogieDeclarations]: Found specification of procedure wait_for_clock [2018-11-10 04:24:28,512 INFO L130 BoogieDeclarations]: Found specification of procedure bary [2018-11-10 04:24:28,512 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 04:24:28,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 04:24:28,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 04:24:28,649 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 04:24:28,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:24:28 BoogieIcfgContainer [2018-11-10 04:24:28,650 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 04:24:28,651 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 04:24:28,651 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 04:24:28,653 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 04:24:28,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 04:24:28" (1/3) ... [2018-11-10 04:24:28,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49443f83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:24:28, skipping insertion in model container [2018-11-10 04:24:28,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:24:28" (2/3) ... [2018-11-10 04:24:28,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49443f83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:24:28, skipping insertion in model container [2018-11-10 04:24:28,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:24:28" (3/3) ... [2018-11-10 04:24:28,656 INFO L112 eAbstractionObserver]: Analyzing ICFG bary_diverge_true-unreach-call_true-termination.c [2018-11-10 04:24:28,663 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 04:24:28,668 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 04:24:28,679 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 04:24:28,703 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 04:24:28,704 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 04:24:28,704 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 04:24:28,704 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 04:24:28,704 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 04:24:28,704 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 04:24:28,705 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 04:24:28,705 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 04:24:28,705 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 04:24:28,724 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-11-10 04:24:28,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 04:24:28,728 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:24:28,729 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:24:28,730 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:24:28,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:24:28,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1588853623, now seen corresponding path program 1 times [2018-11-10 04:24:28,735 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:24:28,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:24:28,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:24:28,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:24:28,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:24:28,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:24:28,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:24:28,837 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 04:24:28,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 04:24:28 BoogieIcfgContainer [2018-11-10 04:24:28,858 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 04:24:28,858 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 04:24:28,858 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 04:24:28,858 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 04:24:28,859 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:24:28" (3/4) ... [2018-11-10 04:24:28,861 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 04:24:28,861 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 04:24:28,862 INFO L168 Benchmark]: Toolchain (without parser) took 593.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 959.2 MB in the beginning and 1.1 GB in the end (delta: -160.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:24:28,863 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:24:28,863 INFO L168 Benchmark]: CACSL2BoogieTranslator took 151.13 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 04:24:28,864 INFO L168 Benchmark]: Boogie Preprocessor took 19.66 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 04:24:28,864 INFO L168 Benchmark]: RCFGBuilder took 210.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -187.6 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2018-11-10 04:24:28,864 INFO L168 Benchmark]: TraceAbstraction took 207.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2018-11-10 04:24:28,865 INFO L168 Benchmark]: Witness Printer took 3.10 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-10 04:24:28,867 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 151.13 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.66 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 210.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -187.6 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 207.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.10 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: 9]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 31. Possible FailurePath: [L15] float C1, I; [L14] BOOLEAN INIT; [L29] static float X,Y,Z; VAL [\old(C1)=7, \old(I)=9, \old(INIT)=2, \old(X)=4, \old(Y)=5, \old(Z)=8, C1=0, I=0, INIT=0, X=0, Y=0, Z=0] [L50] int i; [L52] INIT = TRUE VAL [\old(C1)=0, \old(I)=0, \old(INIT)=0, \old(X)=0, \old(Y)=0, \old(Z)=0, C1=0, I=0, INIT=1, X=0, Y=0, Z=0] [L53] CALL, EXPR RANDOM_INPUT() VAL [\old(C1)=0, \old(I)=0, \old(INIT)=0, \old(X)=0, \old(Y)=0, \old(Z)=0, C1=0, I=0, INIT=1, X=0, Y=0, Z=0] [L19] float x; [L20] x = __VERIFIER_nondet_float() [L22] RET return x; VAL [\old(C1)=0, \old(I)=0, \old(INIT)=0, \old(X)=0, \old(Y)=0, \old(Z)=0, \result=3, C1=0, I=0, INIT=1, x=3, X=0, Y=0, Z=0] [L53] EXPR RANDOM_INPUT() VAL [\old(C1)=0, \old(I)=0, \old(INIT)=0, \old(X)=0, \old(Y)=0, \old(Z)=0, C1=0, I=0, INIT=1, RANDOM_INPUT()=3, X=0, Y=0, Z=0] [L53] C1 = RANDOM_INPUT() [L54] CALL, EXPR RANDOM_INPUT() VAL [\old(C1)=0, \old(I)=0, \old(INIT)=0, \old(X)=0, \old(Y)=0, \old(Z)=0, C1=3, I=0, INIT=1, X=0, Y=0, Z=0] [L19] float x; [L20] x = __VERIFIER_nondet_float() [L22] RET return x; VAL [\old(C1)=0, \old(I)=0, \old(INIT)=0, \old(X)=0, \old(Y)=0, \old(Z)=0, \result=6, C1=3, I=0, INIT=1, x=6, X=0, Y=0, Z=0] [L54] EXPR RANDOM_INPUT() VAL [\old(C1)=0, \old(I)=0, \old(INIT)=0, \old(X)=0, \old(Y)=0, \old(Z)=0, C1=3, I=0, INIT=1, RANDOM_INPUT()=6, X=0, Y=0, Z=0] [L54] I = RANDOM_INPUT() [L56] i = 0 VAL [\old(C1)=0, \old(I)=0, \old(INIT)=0, \old(X)=0, \old(Y)=0, \old(Z)=0, C1=3, i=0, I=6, INIT=1, X=0, Y=0, Z=0] [L56] COND TRUE i < 3600000 VAL [\old(C1)=0, \old(I)=0, \old(INIT)=0, \old(X)=0, \old(Y)=0, \old(Z)=0, C1=3, I=6, i=0, INIT=1, X=0, Y=0, Z=0] [L57] CALL bary() VAL [\old(C1)=0, \old(I)=0, \old(INIT)=0, \old(X)=0, \old(Y)=0, \old(Z)=0, C1=3, I=6, INIT=1, X=0, Y=0, Z=0] [L31] COND TRUE C1 > 0.f [L32] Z = Y [L33] Y = X VAL [\old(C1)=0, \old(I)=0, \old(INIT)=0, \old(X)=0, \old(Y)=0, \old(Z)=0, C1=3, I=6, INIT=1, X=0, Y=0, Z=0] [L36] COND TRUE INIT == TRUE [L37] X = I [L38] Y = I [L39] Z = I VAL [\old(C1)=0, \old(I)=0, \old(INIT)=0, \old(X)=0, \old(Y)=0, \old(Z)=0, C1=3, I=6, INIT=1, X=6, Y=6, Z=6] [L45] CALL __VERIFIER_assert(X >= -5.f && X <= 5.f) VAL [\old(C1)=0, \old(cond)=0, \old(I)=0, \old(INIT)=0, \old(X)=0, \old(Y)=0, \old(Z)=0, C1=3, I=6, INIT=1, X=6, Y=6, Z=6] [L9] COND TRUE !(cond) VAL [\old(C1)=0, \old(cond)=0, \old(I)=0, \old(INIT)=0, \old(X)=0, \old(Y)=0, \old(Z)=0, C1=3, cond=0, I=6, INIT=1, X=6, Y=6, Z=6] [L9] __VERIFIER_error() VAL [\old(C1)=0, \old(cond)=0, \old(I)=0, \old(INIT)=0, \old(X)=0, \old(Y)=0, \old(Z)=0, C1=3, cond=0, I=6, INIT=1, X=6, Y=6, Z=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 42 locations, 1 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 2 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 25 NumberOfCodeBlocks, 25 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-1dbac8b [2018-11-10 04:24:30,298 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 04:24:30,300 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 04:24:30,308 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 04:24:30,308 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 04:24:30,309 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 04:24:30,310 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 04:24:30,311 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 04:24:30,312 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 04:24:30,313 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 04:24:30,313 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 04:24:30,313 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 04:24:30,315 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 04:24:30,315 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 04:24:30,316 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 04:24:30,317 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 04:24:30,317 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 04:24:30,319 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 04:24:30,320 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 04:24:30,321 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 04:24:30,322 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 04:24:30,323 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 04:24:30,325 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 04:24:30,325 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 04:24:30,325 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 04:24:30,325 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 04:24:30,327 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 04:24:30,327 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 04:24:30,328 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 04:24:30,329 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 04:24:30,329 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 04:24:30,329 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 04:24:30,329 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 04:24:30,329 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 04:24:30,330 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 04:24:30,331 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 04:24:30,331 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_90686f4c-f71f-4885-b8b1-3330c1835a0a/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-10 04:24:30,340 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 04:24:30,341 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 04:24:30,341 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 04:24:30,341 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 04:24:30,342 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 04:24:30,342 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 04:24:30,342 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 04:24:30,342 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 04:24:30,342 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 04:24:30,343 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 04:24:30,343 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 04:24:30,343 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 04:24:30,343 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 04:24:30,343 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 04:24:30,343 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-10 04:24:30,343 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-10 04:24:30,343 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 04:24:30,344 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 04:24:30,344 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 04:24:30,344 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 04:24:30,344 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 04:24:30,344 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 04:24:30,344 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 04:24:30,344 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 04:24:30,344 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 04:24:30,345 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 04:24:30,345 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 04:24:30,345 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-10 04:24:30,345 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 04:24:30,345 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-10 04:24:30,345 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-10 04:24:30,345 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_90686f4c-f71f-4885-b8b1-3330c1835a0a/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b00bb4cbbb267b3a6dbfbb1f9808dfa82de7ed74 [2018-11-10 04:24:30,376 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 04:24:30,385 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 04:24:30,387 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 04:24:30,388 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 04:24:30,389 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 04:24:30,389 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_90686f4c-f71f-4885-b8b1-3330c1835a0a/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/bary_diverge_true-unreach-call_true-termination.c [2018-11-10 04:24:30,427 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_90686f4c-f71f-4885-b8b1-3330c1835a0a/bin-2019/uautomizer/data/a68bb1970/152f1862e93a4959b9c317c6082de87f/FLAG3c58fa791 [2018-11-10 04:24:30,740 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 04:24:30,741 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_90686f4c-f71f-4885-b8b1-3330c1835a0a/sv-benchmarks/c/float-benchs/bary_diverge_true-unreach-call_true-termination.c [2018-11-10 04:24:30,744 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_90686f4c-f71f-4885-b8b1-3330c1835a0a/bin-2019/uautomizer/data/a68bb1970/152f1862e93a4959b9c317c6082de87f/FLAG3c58fa791 [2018-11-10 04:24:30,752 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_90686f4c-f71f-4885-b8b1-3330c1835a0a/bin-2019/uautomizer/data/a68bb1970/152f1862e93a4959b9c317c6082de87f [2018-11-10 04:24:30,754 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 04:24:30,755 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 04:24:30,756 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 04:24:30,756 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 04:24:30,759 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 04:24:30,760 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:24:30" (1/1) ... [2018-11-10 04:24:30,762 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2036282e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:24:30, skipping insertion in model container [2018-11-10 04:24:30,762 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:24:30" (1/1) ... [2018-11-10 04:24:30,767 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 04:24:30,783 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 04:24:30,901 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:24:30,905 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 04:24:30,919 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:24:30,931 INFO L193 MainTranslator]: Completed translation [2018-11-10 04:24:30,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:24:30 WrapperNode [2018-11-10 04:24:30,932 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 04:24:30,932 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 04:24:30,932 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 04:24:30,932 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 04:24:30,941 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:24:30" (1/1) ... [2018-11-10 04:24:30,941 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:24:30" (1/1) ... [2018-11-10 04:24:30,946 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:24:30" (1/1) ... [2018-11-10 04:24:30,946 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:24:30" (1/1) ... [2018-11-10 04:24:30,950 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:24:30" (1/1) ... [2018-11-10 04:24:30,954 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:24:30" (1/1) ... [2018-11-10 04:24:30,956 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:24:30" (1/1) ... [2018-11-10 04:24:30,958 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 04:24:30,959 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 04:24:30,959 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 04:24:30,959 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 04:24:30,960 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:24:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_90686f4c-f71f-4885-b8b1-3330c1835a0a/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 04:24:31,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 04:24:31,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 04:24:31,004 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-10 04:24:31,004 INFO L138 BoogieDeclarations]: Found implementation of procedure RANDOM_INPUT [2018-11-10 04:24:31,005 INFO L138 BoogieDeclarations]: Found implementation of procedure wait_for_clock [2018-11-10 04:24:31,005 INFO L138 BoogieDeclarations]: Found implementation of procedure bary [2018-11-10 04:24:31,005 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 04:24:31,005 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 04:24:31,005 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_float [2018-11-10 04:24:31,005 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-10 04:24:31,005 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-10 04:24:31,005 INFO L130 BoogieDeclarations]: Found specification of procedure RANDOM_INPUT [2018-11-10 04:24:31,005 INFO L130 BoogieDeclarations]: Found specification of procedure wait_for_clock [2018-11-10 04:24:31,006 INFO L130 BoogieDeclarations]: Found specification of procedure bary [2018-11-10 04:24:31,006 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 04:24:31,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 04:24:31,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 04:24:31,559 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 04:24:31,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:24:31 BoogieIcfgContainer [2018-11-10 04:24:31,560 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 04:24:31,560 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 04:24:31,560 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 04:24:31,562 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 04:24:31,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 04:24:30" (1/3) ... [2018-11-10 04:24:31,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56140bc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:24:31, skipping insertion in model container [2018-11-10 04:24:31,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:24:30" (2/3) ... [2018-11-10 04:24:31,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56140bc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:24:31, skipping insertion in model container [2018-11-10 04:24:31,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:24:31" (3/3) ... [2018-11-10 04:24:31,564 INFO L112 eAbstractionObserver]: Analyzing ICFG bary_diverge_true-unreach-call_true-termination.c [2018-11-10 04:24:31,572 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 04:24:31,578 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 04:24:31,587 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 04:24:31,604 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 04:24:31,604 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 04:24:31,604 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 04:24:31,604 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 04:24:31,604 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 04:24:31,604 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 04:24:31,605 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 04:24:31,605 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 04:24:31,605 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 04:24:31,615 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-11-10 04:24:31,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 04:24:31,618 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:24:31,619 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:24:31,620 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:24:31,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:24:31,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1588853623, now seen corresponding path program 1 times [2018-11-10 04:24:31,626 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 04:24:31,626 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_90686f4c-f71f-4885-b8b1-3330c1835a0a/bin-2019/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-11-10 04:24:31,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:24:31,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:24:31,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:24:31,836 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 04:24:31,836 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:24:31,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:24:31,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 04:24:31,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 04:24:31,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 04:24:31,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-10 04:24:31,864 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 8 states. [2018-11-10 04:24:36,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:24:36,499 INFO L93 Difference]: Finished difference Result 132 states and 165 transitions. [2018-11-10 04:24:36,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 04:24:36,516 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-11-10 04:24:36,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:24:36,523 INFO L225 Difference]: With dead ends: 132 [2018-11-10 04:24:36,524 INFO L226 Difference]: Without dead ends: 85 [2018-11-10 04:24:36,526 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-11-10 04:24:36,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-10 04:24:36,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 64. [2018-11-10 04:24:36,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-10 04:24:36,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2018-11-10 04:24:36,561 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 25 [2018-11-10 04:24:36,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:24:36,561 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2018-11-10 04:24:36,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 04:24:36,561 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2018-11-10 04:24:36,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 04:24:36,563 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:24:36,563 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:24:36,564 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:24:36,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:24:36,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1587006581, now seen corresponding path program 1 times [2018-11-10 04:24:36,565 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 04:24:36,565 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_90686f4c-f71f-4885-b8b1-3330c1835a0a/bin-2019/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-11-10 04:24:36,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:24:36,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:24:36,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:24:36,750 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 04:24:36,750 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:24:36,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:24:36,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:24:36,759 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:24:36,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:24:36,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:24:36,760 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand 3 states. [2018-11-10 04:24:37,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:24:37,821 INFO L93 Difference]: Finished difference Result 108 states and 122 transitions. [2018-11-10 04:24:37,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:24:37,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-10 04:24:37,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:24:37,839 INFO L225 Difference]: With dead ends: 108 [2018-11-10 04:24:37,839 INFO L226 Difference]: Without dead ends: 74 [2018-11-10 04:24:37,839 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:24:37,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-10 04:24:37,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2018-11-10 04:24:37,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-10 04:24:37,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2018-11-10 04:24:37,851 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 25 [2018-11-10 04:24:37,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:24:37,852 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2018-11-10 04:24:37,852 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:24:37,852 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2018-11-10 04:24:37,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-10 04:24:37,853 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:24:37,853 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:24:37,853 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:24:37,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:24:37,854 INFO L82 PathProgramCache]: Analyzing trace with hash 971109145, now seen corresponding path program 1 times [2018-11-10 04:24:37,854 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 04:24:37,854 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_90686f4c-f71f-4885-b8b1-3330c1835a0a/bin-2019/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-11-10 04:24:37,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:24:37,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:24:37,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:24:38,013 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-10 04:24:38,014 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:24:38,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:24:38,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 04:24:38,026 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 04:24:38,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 04:24:38,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-10 04:24:38,027 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand 8 states. [2018-11-10 04:24:41,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:24:41,332 INFO L93 Difference]: Finished difference Result 94 states and 106 transitions. [2018-11-10 04:24:41,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 04:24:41,332 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2018-11-10 04:24:41,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:24:41,333 INFO L225 Difference]: With dead ends: 94 [2018-11-10 04:24:41,334 INFO L226 Difference]: Without dead ends: 92 [2018-11-10 04:24:41,334 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-11-10 04:24:41,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-10 04:24:41,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 70. [2018-11-10 04:24:41,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-10 04:24:41,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2018-11-10 04:24:41,344 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 56 [2018-11-10 04:24:41,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:24:41,345 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2018-11-10 04:24:41,345 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 04:24:41,345 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2018-11-10 04:24:41,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-10 04:24:41,346 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:24:41,346 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:24:41,346 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:24:41,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:24:41,347 INFO L82 PathProgramCache]: Analyzing trace with hash 972956187, now seen corresponding path program 1 times [2018-11-10 04:24:41,347 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 04:24:41,347 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_90686f4c-f71f-4885-b8b1-3330c1835a0a/bin-2019/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-11-10 04:24:41,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:24:41,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:24:41,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:24:44,045 WARN L854 $PredicateComparison]: unable to prove that (exists ((~Y~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) RNE 1.0))) (and (fp.leq ~Y~0 .cse0) (fp.geq ~Y~0 (fp.neg .cse0)) (= c_~X~0 (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) ~Y~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) ~Y~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) ~Y~0)))))) is different from true [2018-11-10 04:25:30,654 WARN L179 SmtUtils]: Spent 22.25 s on a formula simplification that was a NOOP. DAG size: 46 [2018-11-10 04:25:40,748 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (or (and .cse0 (exists ((v_prenex_2 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 8 24) RNE 1.0))) (and (fp.leq v_prenex_2 .cse1) (fp.geq v_prenex_2 (fp.neg .cse1)) (not (fp.leq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) v_prenex_2) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) v_prenex_2)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) v_prenex_2)) ((_ to_fp 8 24) RNE 5.0))))))) (= (bvadd c___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (and (exists ((~Y~0 (_ FloatingPoint 8 24))) (let ((.cse2 ((_ to_fp 8 24) RNE 1.0))) (and (not (fp.geq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) ~Y~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) ~Y~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) ~Y~0)) (fp.neg ((_ to_fp 8 24) RNE 5.0)))) (fp.leq ~Y~0 .cse2) (fp.geq ~Y~0 (fp.neg .cse2))))) .cse0))) is different from false [2018-11-10 04:25:50,846 WARN L832 $PredicateComparison]: unable to prove that (or (exists ((~Y~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) RNE 1.0))) (and (not (fp.geq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) ~Y~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) ~Y~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) ~Y~0)) (fp.neg ((_ to_fp 8 24) RNE 5.0)))) (fp.leq ~Y~0 .cse0) (fp.geq ~Y~0 (fp.neg .cse0))))) (exists ((v_prenex_2 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 8 24) RNE 1.0))) (and (fp.leq v_prenex_2 .cse1) (fp.geq v_prenex_2 (fp.neg .cse1)) (not (fp.leq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) v_prenex_2) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) v_prenex_2)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) v_prenex_2)) ((_ to_fp 8 24) RNE 5.0))))))) is different from false [2018-11-10 04:25:52,861 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((~Y~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) RNE 1.0))) (and (not (fp.geq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) ~Y~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) ~Y~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) ~Y~0)) (fp.neg ((_ to_fp 8 24) RNE 5.0)))) (fp.leq ~Y~0 .cse0) (fp.geq ~Y~0 (fp.neg .cse0))))) (exists ((v_prenex_2 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 8 24) RNE 1.0))) (and (fp.leq v_prenex_2 .cse1) (fp.geq v_prenex_2 (fp.neg .cse1)) (not (fp.leq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) v_prenex_2) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) v_prenex_2)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) v_prenex_2)) ((_ to_fp 8 24) RNE 5.0))))))) is different from true [2018-11-10 04:25:52,876 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 14 proven. 11 refuted. 1 times theorem prover too weak. 10 trivial. 2 not checked. [2018-11-10 04:25:52,876 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 04:26:01,049 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) c_~Y~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) c_~Z~0))) (.cse1 ((_ to_fp 8 24) RNE 5.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from false [2018-11-10 04:26:03,066 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) c_~Y~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) c_~Z~0))) (.cse1 ((_ to_fp 8 24) RNE 5.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from true [2018-11-10 04:26:52,248 WARN L179 SmtUtils]: Spent 11.02 s on a formula simplification that was a NOOP. DAG size: 20 [2018-11-10 04:27:41,036 WARN L179 SmtUtils]: Spent 12.12 s on a formula simplification that was a NOOP. DAG size: 19 [2018-11-10 04:27:43,074 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0))) (.cse5 ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0))) (.cse6 ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0))) (.cse3 ((_ to_fp 8 24) RNE 5.0))) (let ((.cse1 (fp.neg .cse3)) (.cse0 (fp.add RNE (fp.add RNE (fp.mul RNE .cse4 c_~I~0) (fp.mul RNE .cse5 c_~I~0)) (fp.mul RNE .cse6 c_~I~0)))) (or (not (fp.geq .cse0 .cse1)) (let ((.cse2 (fp.add RNE (fp.add RNE (fp.mul RNE .cse4 c_~X~0) (fp.mul RNE .cse5 c_~X~0)) (fp.mul RNE .cse6 c_~Y~0)))) (and (fp.leq .cse2 .cse3) (fp.geq .cse2 .cse1))) (not (fp.leq .cse0 .cse3))))) is different from false [2018-11-10 04:27:45,108 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0))) (.cse5 ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0))) (.cse6 ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0))) (.cse3 ((_ to_fp 8 24) RNE 5.0))) (let ((.cse1 (fp.neg .cse3)) (.cse0 (fp.add RNE (fp.add RNE (fp.mul RNE .cse4 c_~I~0) (fp.mul RNE .cse5 c_~I~0)) (fp.mul RNE .cse6 c_~I~0)))) (or (not (fp.geq .cse0 .cse1)) (let ((.cse2 (fp.add RNE (fp.add RNE (fp.mul RNE .cse4 c_~X~0) (fp.mul RNE .cse5 c_~X~0)) (fp.mul RNE .cse6 c_~Y~0)))) (and (fp.leq .cse2 .cse3) (fp.geq .cse2 .cse1))) (not (fp.leq .cse0 .cse3))))) is different from true [2018-11-10 04:27:50,285 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) |c_main_#t~ret2|) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) |c_main_#t~ret2|)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) |c_main_#t~ret2|))) (.cse1 ((_ to_fp 8 24) RNE 5.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from false [2018-11-10 04:28:02,953 WARN L832 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_3 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) RNE 1.0))) (or (not (fp.leq v_prenex_3 .cse0)) (not (fp.geq v_prenex_3 (fp.neg .cse0))) (fp.geq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) v_prenex_3) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) v_prenex_3)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) v_prenex_3)) (fp.neg ((_ to_fp 8 24) RNE 5.0)))))) (forall ((v_RANDOM_INPUT_~x~0_14 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 8 24) RNE 1.0))) (or (not (fp.leq v_RANDOM_INPUT_~x~0_14 .cse1)) (not (fp.geq v_RANDOM_INPUT_~x~0_14 (fp.neg .cse1))) (fp.leq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) v_RANDOM_INPUT_~x~0_14) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) v_RANDOM_INPUT_~x~0_14)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) v_RANDOM_INPUT_~x~0_14)) ((_ to_fp 8 24) RNE 5.0)))))) is different from false [2018-11-10 04:28:04,985 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_3 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) RNE 1.0))) (or (not (fp.leq v_prenex_3 .cse0)) (not (fp.geq v_prenex_3 (fp.neg .cse0))) (fp.geq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) v_prenex_3) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) v_prenex_3)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) v_prenex_3)) (fp.neg ((_ to_fp 8 24) RNE 5.0)))))) (forall ((v_RANDOM_INPUT_~x~0_14 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 8 24) RNE 1.0))) (or (not (fp.leq v_RANDOM_INPUT_~x~0_14 .cse1)) (not (fp.geq v_RANDOM_INPUT_~x~0_14 (fp.neg .cse1))) (fp.leq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) v_RANDOM_INPUT_~x~0_14) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) v_RANDOM_INPUT_~x~0_14)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) v_RANDOM_INPUT_~x~0_14)) ((_ to_fp 8 24) RNE 5.0)))))) is different from true [2018-11-10 04:28:04,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:28:04,995 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_90686f4c-f71f-4885-b8b1-3330c1835a0a/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 04:28:05,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:28:17,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2018-11-10 04:28:17,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-10 04:28:17,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-11-10 04:28:17,128 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 04:28:17,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 04:28:17,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=123, Unknown=42, NotChecked=210, Total=420 [2018-11-10 04:28:17,129 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 12 states. [2018-11-10 04:28:51,812 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) RNE 1.0))) (let ((.cse0 (fp.neg .cse1))) (and (fp.geq c_~Z~0 .cse0) (= c_~I~0 c_~Y~0) (fp.leq c_~Z~0 .cse1) (fp.leq c_~I~0 .cse1) (= c_~I~0 c_~X~0) (= c_~X~0 c_~Z~0) (= c_~X~0 c_~Y~0) (let ((.cse3 (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (or (= (bvadd |c___VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32)) (and (exists ((~Y~0 (_ FloatingPoint 8 24))) (let ((.cse2 ((_ to_fp 8 24) RNE 1.0))) (and (not (fp.geq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) ~Y~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) ~Y~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) ~Y~0)) (fp.neg ((_ to_fp 8 24) RNE 5.0)))) (fp.leq ~Y~0 .cse2) (fp.geq ~Y~0 (fp.neg .cse2))))) .cse3) (and (exists ((v_prenex_2 (_ FloatingPoint 8 24))) (let ((.cse4 ((_ to_fp 8 24) RNE 1.0))) (and (fp.leq v_prenex_2 .cse4) (fp.geq v_prenex_2 (fp.neg .cse4)) (not (fp.leq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) v_prenex_2) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) v_prenex_2)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) v_prenex_2)) ((_ to_fp 8 24) RNE 5.0)))))) .cse3))) (fp.geq c_~I~0 .cse0)))) is different from false [2018-11-10 04:28:53,856 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) RNE 1.0))) (and (= c_~I~0 c_~Y~0) (fp.leq c_~I~0 .cse0) (= c_~I~0 c_~X~0) (let ((.cse1 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (or (and .cse1 (exists ((v_prenex_2 (_ FloatingPoint 8 24))) (let ((.cse2 ((_ to_fp 8 24) RNE 1.0))) (and (fp.leq v_prenex_2 .cse2) (fp.geq v_prenex_2 (fp.neg .cse2)) (not (fp.leq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) v_prenex_2) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) v_prenex_2)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) v_prenex_2)) ((_ to_fp 8 24) RNE 5.0))))))) (= (bvadd c___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (and (exists ((~Y~0 (_ FloatingPoint 8 24))) (let ((.cse3 ((_ to_fp 8 24) RNE 1.0))) (and (not (fp.geq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) ~Y~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) ~Y~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) ~Y~0)) (fp.neg ((_ to_fp 8 24) RNE 5.0)))) (fp.leq ~Y~0 .cse3) (fp.geq ~Y~0 (fp.neg .cse3))))) .cse1))) (fp.geq c_~I~0 (fp.neg .cse0)))) is different from false [2018-11-10 04:29:08,349 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 (exists ((~Y~0 (_ FloatingPoint 8 24))) (let ((.cse5 ((_ to_fp 8 24) RNE 1.0))) (and (not (fp.geq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) ~Y~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) ~Y~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) ~Y~0)) (fp.neg ((_ to_fp 8 24) RNE 5.0)))) (fp.leq ~Y~0 .cse5) (fp.geq ~Y~0 (fp.neg .cse5)))))) (.cse1 (exists ((v_prenex_2 (_ FloatingPoint 8 24))) (let ((.cse4 ((_ to_fp 8 24) RNE 1.0))) (and (fp.leq v_prenex_2 .cse4) (fp.geq v_prenex_2 (fp.neg .cse4)) (not (fp.leq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) v_prenex_2) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) v_prenex_2)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) v_prenex_2)) ((_ to_fp 8 24) RNE 5.0)))))))) (and (let ((.cse0 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (or (and .cse0 .cse1) (= (bvadd c___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (and .cse2 .cse0))) (let ((.cse3 (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (or (= (bvadd |c___VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32)) (and .cse2 .cse3) (and .cse1 .cse3))))) is different from false [2018-11-10 04:29:08,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:29:08,380 INFO L93 Difference]: Finished difference Result 96 states and 109 transitions. [2018-11-10 04:29:08,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 04:29:08,381 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-11-10 04:29:08,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:29:08,382 INFO L225 Difference]: With dead ends: 96 [2018-11-10 04:29:08,382 INFO L226 Difference]: Without dead ends: 94 [2018-11-10 04:29:08,383 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 205.3s TimeCoverageRelationStatistics Valid=85, Invalid=200, Unknown=61, NotChecked=410, Total=756 [2018-11-10 04:29:08,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-10 04:29:08,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-11-10 04:29:08,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-10 04:29:08,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 107 transitions. [2018-11-10 04:29:08,399 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 107 transitions. Word has length 56 [2018-11-10 04:29:08,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:29:08,399 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 107 transitions. [2018-11-10 04:29:08,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 04:29:08,399 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 107 transitions. [2018-11-10 04:29:08,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-10 04:29:08,400 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:29:08,400 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:29:08,401 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:29:08,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:29:08,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1162764683, now seen corresponding path program 2 times [2018-11-10 04:29:08,401 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 04:29:08,401 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_90686f4c-f71f-4885-b8b1-3330c1835a0a/bin-2019/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-11-10 04:29:08,412 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-10 04:29:08,731 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 04:29:08,731 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 04:29:08,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:29:10,900 WARN L832 $PredicateComparison]: unable to prove that (exists ((~Y~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) RNE 1.0))) (and (fp.leq ~Y~0 .cse0) (fp.geq ~Y~0 (fp.neg .cse0)) (= c_~X~0 (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) ~Y~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) ~Y~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) ~Y~0)))))) is different from false [2018-11-10 04:29:12,924 WARN L854 $PredicateComparison]: unable to prove that (exists ((~Y~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) RNE 1.0))) (and (fp.leq ~Y~0 .cse0) (fp.geq ~Y~0 (fp.neg .cse0)) (= c_~X~0 (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) ~Y~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) ~Y~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) ~Y~0)))))) is different from true [2018-11-10 04:29:27,015 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (or (= (bvadd |c___VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32)) (and (exists ((~Y~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) RNE 1.0))) (and (not (fp.geq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) ~Y~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) ~Y~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) ~Y~0)) (fp.neg ((_ to_fp 8 24) RNE 5.0)))) (fp.leq ~Y~0 .cse0) (fp.geq ~Y~0 (fp.neg .cse0))))) .cse1) (and .cse1 (exists ((v_prenex_5 (_ FloatingPoint 8 24))) (let ((.cse2 ((_ to_fp 8 24) RNE 1.0))) (and (not (fp.leq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) v_prenex_5) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) v_prenex_5)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) v_prenex_5)) ((_ to_fp 8 24) RNE 5.0))) (fp.leq v_prenex_5 .cse2) (fp.geq v_prenex_5 (fp.neg .cse2)))))))) is different from false [2018-11-10 04:29:37,139 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (or (= (bvadd c___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (and (exists ((~Y~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) RNE 1.0))) (and (not (fp.geq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) ~Y~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) ~Y~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) ~Y~0)) (fp.neg ((_ to_fp 8 24) RNE 5.0)))) (fp.leq ~Y~0 .cse0) (fp.geq ~Y~0 (fp.neg .cse0))))) .cse1) (and .cse1 (exists ((v_prenex_5 (_ FloatingPoint 8 24))) (let ((.cse2 ((_ to_fp 8 24) RNE 1.0))) (and (not (fp.leq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) v_prenex_5) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) v_prenex_5)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) v_prenex_5)) ((_ to_fp 8 24) RNE 5.0))) (fp.leq v_prenex_5 .cse2) (fp.geq v_prenex_5 (fp.neg .cse2)))))))) is different from false [2018-11-10 04:29:47,244 WARN L832 $PredicateComparison]: unable to prove that (or (exists ((~Y~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) RNE 1.0))) (and (not (fp.geq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) ~Y~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) ~Y~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) ~Y~0)) (fp.neg ((_ to_fp 8 24) RNE 5.0)))) (fp.leq ~Y~0 .cse0) (fp.geq ~Y~0 (fp.neg .cse0))))) (exists ((v_prenex_5 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 8 24) RNE 1.0))) (and (not (fp.leq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) v_prenex_5) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) v_prenex_5)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) v_prenex_5)) ((_ to_fp 8 24) RNE 5.0))) (fp.leq v_prenex_5 .cse1) (fp.geq v_prenex_5 (fp.neg .cse1)))))) is different from false [2018-11-10 04:29:49,259 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((~Y~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) RNE 1.0))) (and (not (fp.geq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) ~Y~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) ~Y~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) ~Y~0)) (fp.neg ((_ to_fp 8 24) RNE 5.0)))) (fp.leq ~Y~0 .cse0) (fp.geq ~Y~0 (fp.neg .cse0))))) (exists ((v_prenex_5 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 8 24) RNE 1.0))) (and (not (fp.leq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) v_prenex_5) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) v_prenex_5)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) v_prenex_5)) ((_ to_fp 8 24) RNE 5.0))) (fp.leq v_prenex_5 .cse1) (fp.geq v_prenex_5 (fp.neg .cse1)))))) is different from true [2018-11-10 04:29:49,273 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 72 proven. 16 refuted. 0 times theorem prover too weak. 31 trivial. 3 not checked. [2018-11-10 04:29:49,273 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 04:29:51,343 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) c_~Y~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) c_~Z~0))) (.cse1 ((_ to_fp 8 24) RNE 5.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from false [2018-11-10 04:29:53,361 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) c_~Y~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) c_~Z~0))) (.cse1 ((_ to_fp 8 24) RNE 5.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from true [2018-11-10 04:29:55,383 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) c_~X~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) c_~Y~0))) (.cse1 ((_ to_fp 8 24) RNE 5.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from false [2018-11-10 04:29:59,205 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) c_~I~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) c_~I~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) c_~I~0))) (.cse1 ((_ to_fp 8 24) RNE 5.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from false [2018-11-10 04:30:01,974 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0))) (.cse5 ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0))) (.cse6 ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0))) (.cse3 ((_ to_fp 8 24) RNE 5.0))) (let ((.cse1 (fp.neg .cse3)) (.cse0 (fp.add RNE (fp.add RNE (fp.mul RNE .cse4 c_~I~0) (fp.mul RNE .cse5 c_~I~0)) (fp.mul RNE .cse6 c_~I~0)))) (or (not (fp.geq .cse0 .cse1)) (let ((.cse2 (fp.add RNE (fp.add RNE (fp.mul RNE .cse4 c_~X~0) (fp.mul RNE .cse5 c_~X~0)) (fp.mul RNE .cse6 c_~Y~0)))) (and (fp.leq .cse2 .cse3) (fp.geq .cse2 .cse1))) (not (fp.leq .cse0 .cse3))))) is different from false [2018-11-10 04:30:04,008 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0))) (.cse5 ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0))) (.cse6 ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0))) (.cse3 ((_ to_fp 8 24) RNE 5.0))) (let ((.cse1 (fp.neg .cse3)) (.cse0 (fp.add RNE (fp.add RNE (fp.mul RNE .cse4 c_~I~0) (fp.mul RNE .cse5 c_~I~0)) (fp.mul RNE .cse6 c_~I~0)))) (or (not (fp.geq .cse0 .cse1)) (let ((.cse2 (fp.add RNE (fp.add RNE (fp.mul RNE .cse4 c_~X~0) (fp.mul RNE .cse5 c_~X~0)) (fp.mul RNE .cse6 c_~Y~0)))) (and (fp.leq .cse2 .cse3) (fp.geq .cse2 .cse1))) (not (fp.leq .cse0 .cse3))))) is different from true [2018-11-10 04:30:06,045 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) RNE 5.0)) (.cse8 ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0))) (.cse9 ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0))) (.cse10 ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)))) (let ((.cse6 (fp.add RNE (fp.add RNE (fp.mul RNE .cse8 c_~X~0) (fp.mul RNE .cse9 c_~X~0)) (fp.mul RNE .cse10 c_~Y~0))) (.cse4 (fp.add RNE (fp.add RNE (fp.mul RNE .cse8 c_~I~0) (fp.mul RNE .cse9 c_~I~0)) (fp.mul RNE .cse10 c_~I~0))) (.cse7 (fp.neg .cse5))) (let ((.cse1 (fp.geq .cse4 .cse7)) (.cse3 (fp.leq .cse6 .cse5)) (.cse2 (fp.geq .cse6 .cse7)) (.cse0 (fp.leq .cse4 .cse5))) (or (and .cse0 .cse1 (or (not .cse2) (not .cse3))) (not .cse1) (and .cse3 .cse2) (not .cse0))))) is different from false [2018-11-10 04:30:08,975 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) |c_main_#t~ret6|) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) |c_main_#t~ret6|)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) |c_main_#t~ret6|))) (.cse1 ((_ to_fp 8 24) RNE 5.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from false [2018-11-10 04:30:21,497 WARN L832 $PredicateComparison]: unable to prove that (and (forall ((v_RANDOM_INPUT_~x~0_26 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) RNE 1.0))) (or (not (fp.leq v_RANDOM_INPUT_~x~0_26 .cse0)) (not (fp.geq v_RANDOM_INPUT_~x~0_26 (fp.neg .cse0))) (fp.geq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) v_RANDOM_INPUT_~x~0_26) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) v_RANDOM_INPUT_~x~0_26)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) v_RANDOM_INPUT_~x~0_26)) (fp.neg ((_ to_fp 8 24) RNE 5.0)))))) (forall ((v_prenex_6 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 8 24) RNE 1.0))) (or (not (fp.leq v_prenex_6 .cse1)) (fp.leq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) v_prenex_6) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) v_prenex_6)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) v_prenex_6)) ((_ to_fp 8 24) RNE 5.0)) (not (fp.geq v_prenex_6 (fp.neg .cse1))))))) is different from false [2018-11-10 04:30:23,533 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_RANDOM_INPUT_~x~0_26 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) RNE 1.0))) (or (not (fp.leq v_RANDOM_INPUT_~x~0_26 .cse0)) (not (fp.geq v_RANDOM_INPUT_~x~0_26 (fp.neg .cse0))) (fp.geq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) v_RANDOM_INPUT_~x~0_26) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) v_RANDOM_INPUT_~x~0_26)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) v_RANDOM_INPUT_~x~0_26)) (fp.neg ((_ to_fp 8 24) RNE 5.0)))))) (forall ((v_prenex_6 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 8 24) RNE 1.0))) (or (not (fp.leq v_prenex_6 .cse1)) (fp.leq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) v_prenex_6) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) v_prenex_6)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) v_prenex_6)) ((_ to_fp 8 24) RNE 5.0)) (not (fp.geq v_prenex_6 (fp.neg .cse1))))))) is different from true [2018-11-10 04:30:23,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:30:23,543 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_90686f4c-f71f-4885-b8b1-3330c1835a0a/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 04:30:23,548 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 04:30:37,509 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 04:30:37,510 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2018-11-10 04:30:37,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-10 04:30:37,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-11-10 04:30:37,566 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 04:30:37,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 04:30:37,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=90, Unknown=15, NotChecked=270, Total=420 [2018-11-10 04:30:37,567 INFO L87 Difference]: Start difference. First operand 94 states and 107 transitions. Second operand 12 states. [2018-11-10 04:30:42,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:30:42,109 INFO L93 Difference]: Finished difference Result 109 states and 127 transitions. [2018-11-10 04:30:42,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-10 04:30:42,109 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 87 [2018-11-10 04:30:42,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:30:42,110 INFO L225 Difference]: With dead ends: 109 [2018-11-10 04:30:42,111 INFO L226 Difference]: Without dead ends: 107 [2018-11-10 04:30:42,111 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 112 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 36.5s TimeCoverageRelationStatistics Valid=89, Invalid=208, Unknown=15, NotChecked=390, Total=702 [2018-11-10 04:30:42,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-10 04:30:42,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 83. [2018-11-10 04:30:42,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-10 04:30:42,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 95 transitions. [2018-11-10 04:30:42,125 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 95 transitions. Word has length 87 [2018-11-10 04:30:42,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:30:42,126 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 95 transitions. [2018-11-10 04:30:42,126 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 04:30:42,126 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 95 transitions. [2018-11-10 04:30:42,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-10 04:30:42,127 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:30:42,127 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:30:42,127 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:30:42,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:30:42,127 INFO L82 PathProgramCache]: Analyzing trace with hash 768397897, now seen corresponding path program 3 times [2018-11-10 04:30:42,127 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 04:30:42,127 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_90686f4c-f71f-4885-b8b1-3330c1835a0a/bin-2019/uautomizer/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-11-10 04:30:42,130 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-10 04:30:43,272 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-10 04:30:43,272 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 04:30:43,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:30:45,434 WARN L832 $PredicateComparison]: unable to prove that (and (exists ((~Z~0 (_ FloatingPoint 8 24))) (= c_~X~0 (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) c_~Y~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) c_~Y~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) ~Z~0)))) (= |c_old(~X~0)| c_~Y~0)) is different from false [2018-11-10 04:31:04,783 WARN L179 SmtUtils]: Spent 2.24 s on a formula simplification that was a NOOP. DAG size: 17 [2018-11-10 04:31:06,805 WARN L832 $PredicateComparison]: unable to prove that (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (exists ((~Z~0 (_ FloatingPoint 8 24))) (= c_~X~0 (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) c_~Y~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) c_~Y~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) ~Z~0))))) is different from false [2018-11-10 04:31:28,227 WARN L179 SmtUtils]: Spent 5.91 s on a formula simplification that was a NOOP. DAG size: 22 [2018-11-10 04:31:30,254 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) RNE 5.0))) (and (exists ((~Z~0 (_ FloatingPoint 8 24))) (= c_~X~0 (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) c_~Y~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) c_~Y~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) ~Z~0)))) (= |c_old(~X~0)| c_~Y~0) (fp.geq c_~X~0 (fp.neg .cse0)) (fp.leq c_~X~0 .cse0))) is different from false [2018-11-10 04:31:32,283 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) RNE 1.0)) (.cse1 ((_ to_fp 8 24) RNE 5.0))) (and (exists ((~Z~0 (_ FloatingPoint 8 24))) (= c_~X~0 (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) c_~Y~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) c_~Y~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) ~Z~0)))) (fp.leq c_~Y~0 .cse0) (fp.geq c_~Y~0 (fp.neg .cse0)) (fp.geq c_~X~0 (fp.neg .cse1)) (fp.leq c_~X~0 .cse1))) is different from false [2018-11-10 04:31:34,330 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) RNE 1.0)) (.cse1 ((_ to_fp 8 24) RNE 5.0))) (and (fp.geq c_~Z~0 (fp.neg .cse0)) (fp.leq c_~Z~0 .cse0) (fp.geq c_~X~0 (fp.neg .cse1)) (= c_~X~0 c_~Y~0) (exists ((v_subst_1 (_ FloatingPoint 8 24))) (= (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) c_~Z~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) c_~Z~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) v_subst_1)) c_~X~0)) (fp.leq c_~X~0 .cse1))) is different from false [2018-11-10 04:31:36,374 WARN L832 $PredicateComparison]: unable to prove that (exists ((v_subst_1 (_ FloatingPoint 8 24)) (~Z~0 (_ FloatingPoint 8 24))) (let ((.cse3 ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0))) (.cse4 ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0))) (.cse5 ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)))) (let ((.cse1 ((_ to_fp 8 24) RNE 5.0)) (.cse2 ((_ to_fp 8 24) RNE 1.0)) (.cse0 (fp.add RNE (fp.add RNE (fp.mul RNE .cse3 ~Z~0) (fp.mul RNE .cse4 ~Z~0)) (fp.mul RNE .cse5 v_subst_1)))) (and (fp.leq .cse0 .cse1) (fp.geq ~Z~0 (fp.neg .cse2)) (fp.geq .cse0 (fp.neg .cse1)) (fp.leq ~Z~0 .cse2) (= c_~X~0 (fp.add RNE (fp.add RNE (fp.mul RNE .cse3 .cse0) (fp.mul RNE .cse4 .cse0)) (fp.mul RNE .cse5 ~Z~0))))))) is different from false [2018-11-10 04:31:38,412 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_subst_1 (_ FloatingPoint 8 24)) (~Z~0 (_ FloatingPoint 8 24))) (let ((.cse3 ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0))) (.cse4 ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0))) (.cse5 ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)))) (let ((.cse1 ((_ to_fp 8 24) RNE 5.0)) (.cse2 ((_ to_fp 8 24) RNE 1.0)) (.cse0 (fp.add RNE (fp.add RNE (fp.mul RNE .cse3 ~Z~0) (fp.mul RNE .cse4 ~Z~0)) (fp.mul RNE .cse5 v_subst_1)))) (and (fp.leq .cse0 .cse1) (fp.geq ~Z~0 (fp.neg .cse2)) (fp.geq .cse0 (fp.neg .cse1)) (fp.leq ~Z~0 .cse2) (= c_~X~0 (fp.add RNE (fp.add RNE (fp.mul RNE .cse3 .cse0) (fp.mul RNE .cse4 .cse0)) (fp.mul RNE .cse5 ~Z~0))))))) is different from true [2018-11-10 04:31:54,755 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse7 (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (or (and (exists ((v_prenex_11 (_ FloatingPoint 8 24)) (v_prenex_10 (_ FloatingPoint 8 24))) (let ((.cse6 ((_ to_fp 8 24) RNE 5.0)) (.cse1 ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0))) (.cse3 ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0))) (.cse4 ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE 1.0)) (.cse2 (fp.add RNE (fp.add RNE (fp.mul RNE .cse1 v_prenex_11) (fp.mul RNE .cse3 v_prenex_11)) (fp.mul RNE .cse4 v_prenex_10))) (.cse5 (fp.neg .cse6))) (and (fp.leq v_prenex_11 .cse0) (not (fp.geq (fp.add RNE (fp.add RNE (fp.mul RNE .cse1 .cse2) (fp.mul RNE .cse3 .cse2)) (fp.mul RNE .cse4 v_prenex_11)) .cse5)) (fp.geq v_prenex_11 (fp.neg .cse0)) (fp.leq .cse2 .cse6) (fp.geq .cse2 .cse5))))) .cse7) (and (exists ((v_prenex_7 (_ FloatingPoint 8 24)) (v_prenex_8 (_ FloatingPoint 8 24))) (let ((.cse11 ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0))) (.cse12 ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0))) (.cse13 ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)))) (let ((.cse10 ((_ to_fp 8 24) RNE 1.0)) (.cse8 (fp.add RNE (fp.add RNE (fp.mul RNE .cse11 v_prenex_8) (fp.mul RNE .cse12 v_prenex_8)) (fp.mul RNE .cse13 v_prenex_7))) (.cse9 ((_ to_fp 8 24) RNE 5.0))) (and (fp.leq .cse8 .cse9) (fp.geq v_prenex_8 (fp.neg .cse10)) (fp.geq .cse8 (fp.neg .cse9)) (fp.leq v_prenex_8 .cse10) (not (fp.leq (fp.add RNE (fp.add RNE (fp.mul RNE .cse11 .cse8) (fp.mul RNE .cse12 .cse8)) (fp.mul RNE .cse13 v_prenex_8)) .cse9)))))) .cse7) (and (= (bvadd |c___VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32)) (exists ((v_subst_1 (_ FloatingPoint 8 24)) (~Z~0 (_ FloatingPoint 8 24))) (let ((.cse19 ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0))) (.cse20 ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0))) (.cse21 ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)))) (let ((.cse15 ((_ to_fp 8 24) RNE 5.0)) (.cse14 (fp.add RNE (fp.add RNE (fp.mul RNE .cse19 ~Z~0) (fp.mul RNE .cse20 ~Z~0)) (fp.mul RNE .cse21 v_subst_1)))) (let ((.cse16 ((_ to_fp 8 24) RNE 1.0)) (.cse18 (fp.add RNE (fp.add RNE (fp.mul RNE .cse19 .cse14) (fp.mul RNE .cse20 .cse14)) (fp.mul RNE .cse21 ~Z~0))) (.cse17 (fp.neg .cse15))) (and (fp.leq .cse14 .cse15) (fp.geq ~Z~0 (fp.neg .cse16)) (fp.geq .cse14 .cse17) (fp.leq ~Z~0 .cse16) (fp.leq .cse18 .cse15) (fp.geq .cse18 .cse17))))))))) is different from false [2018-11-10 04:32:09,127 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse8 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (or (and (exists ((v_subst_1 (_ FloatingPoint 8 24)) (~Z~0 (_ FloatingPoint 8 24))) (let ((.cse5 ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0))) (.cse6 ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0))) (.cse7 ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)))) (let ((.cse1 ((_ to_fp 8 24) RNE 5.0)) (.cse0 (fp.add RNE (fp.add RNE (fp.mul RNE .cse5 ~Z~0) (fp.mul RNE .cse6 ~Z~0)) (fp.mul RNE .cse7 v_subst_1)))) (let ((.cse2 ((_ to_fp 8 24) RNE 1.0)) (.cse4 (fp.add RNE (fp.add RNE (fp.mul RNE .cse5 .cse0) (fp.mul RNE .cse6 .cse0)) (fp.mul RNE .cse7 ~Z~0))) (.cse3 (fp.neg .cse1))) (and (fp.leq .cse0 .cse1) (fp.geq ~Z~0 (fp.neg .cse2)) (fp.geq .cse0 .cse3) (fp.leq ~Z~0 .cse2) (fp.leq .cse4 .cse1) (fp.geq .cse4 .cse3)))))) (= (bvadd c___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))) (and .cse8 (exists ((v_prenex_7 (_ FloatingPoint 8 24)) (v_prenex_8 (_ FloatingPoint 8 24))) (let ((.cse12 ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0))) (.cse13 ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0))) (.cse14 ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)))) (let ((.cse11 ((_ to_fp 8 24) RNE 1.0)) (.cse9 (fp.add RNE (fp.add RNE (fp.mul RNE .cse12 v_prenex_8) (fp.mul RNE .cse13 v_prenex_8)) (fp.mul RNE .cse14 v_prenex_7))) (.cse10 ((_ to_fp 8 24) RNE 5.0))) (and (fp.leq .cse9 .cse10) (fp.geq v_prenex_8 (fp.neg .cse11)) (fp.geq .cse9 (fp.neg .cse10)) (fp.leq v_prenex_8 .cse11) (not (fp.leq (fp.add RNE (fp.add RNE (fp.mul RNE .cse12 .cse9) (fp.mul RNE .cse13 .cse9)) (fp.mul RNE .cse14 v_prenex_8)) .cse10))))))) (and .cse8 (exists ((v_prenex_11 (_ FloatingPoint 8 24)) (v_prenex_10 (_ FloatingPoint 8 24))) (let ((.cse21 ((_ to_fp 8 24) RNE 5.0)) (.cse16 ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0))) (.cse18 ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0))) (.cse19 ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)))) (let ((.cse15 ((_ to_fp 8 24) RNE 1.0)) (.cse17 (fp.add RNE (fp.add RNE (fp.mul RNE .cse16 v_prenex_11) (fp.mul RNE .cse18 v_prenex_11)) (fp.mul RNE .cse19 v_prenex_10))) (.cse20 (fp.neg .cse21))) (and (fp.leq v_prenex_11 .cse15) (not (fp.geq (fp.add RNE (fp.add RNE (fp.mul RNE .cse16 .cse17) (fp.mul RNE .cse18 .cse17)) (fp.mul RNE .cse19 v_prenex_11)) .cse20)) (fp.geq v_prenex_11 (fp.neg .cse15)) (fp.leq .cse17 .cse21) (fp.geq .cse17 .cse20)))))))) is different from false [2018-11-10 04:32:19,367 WARN L832 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_7 (_ FloatingPoint 8 24)) (v_prenex_8 (_ FloatingPoint 8 24))) (let ((.cse3 ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0))) (.cse4 ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0))) (.cse5 ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)))) (let ((.cse2 ((_ to_fp 8 24) RNE 1.0)) (.cse0 (fp.add RNE (fp.add RNE (fp.mul RNE .cse3 v_prenex_8) (fp.mul RNE .cse4 v_prenex_8)) (fp.mul RNE .cse5 v_prenex_7))) (.cse1 ((_ to_fp 8 24) RNE 5.0))) (and (fp.leq .cse0 .cse1) (fp.geq v_prenex_8 (fp.neg .cse2)) (fp.geq .cse0 (fp.neg .cse1)) (fp.leq v_prenex_8 .cse2) (not (fp.leq (fp.add RNE (fp.add RNE (fp.mul RNE .cse3 .cse0) (fp.mul RNE .cse4 .cse0)) (fp.mul RNE .cse5 v_prenex_8)) .cse1)))))) (exists ((v_prenex_11 (_ FloatingPoint 8 24)) (v_prenex_10 (_ FloatingPoint 8 24))) (let ((.cse12 ((_ to_fp 8 24) RNE 5.0)) (.cse7 ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0))) (.cse9 ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0))) (.cse10 ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)))) (let ((.cse6 ((_ to_fp 8 24) RNE 1.0)) (.cse8 (fp.add RNE (fp.add RNE (fp.mul RNE .cse7 v_prenex_11) (fp.mul RNE .cse9 v_prenex_11)) (fp.mul RNE .cse10 v_prenex_10))) (.cse11 (fp.neg .cse12))) (and (fp.leq v_prenex_11 .cse6) (not (fp.geq (fp.add RNE (fp.add RNE (fp.mul RNE .cse7 .cse8) (fp.mul RNE .cse9 .cse8)) (fp.mul RNE .cse10 v_prenex_11)) .cse11)) (fp.geq v_prenex_11 (fp.neg .cse6)) (fp.leq .cse8 .cse12) (fp.geq .cse8 .cse11)))))) is different from false [2018-11-10 04:32:21,410 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_7 (_ FloatingPoint 8 24)) (v_prenex_8 (_ FloatingPoint 8 24))) (let ((.cse3 ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0))) (.cse4 ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0))) (.cse5 ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)))) (let ((.cse2 ((_ to_fp 8 24) RNE 1.0)) (.cse0 (fp.add RNE (fp.add RNE (fp.mul RNE .cse3 v_prenex_8) (fp.mul RNE .cse4 v_prenex_8)) (fp.mul RNE .cse5 v_prenex_7))) (.cse1 ((_ to_fp 8 24) RNE 5.0))) (and (fp.leq .cse0 .cse1) (fp.geq v_prenex_8 (fp.neg .cse2)) (fp.geq .cse0 (fp.neg .cse1)) (fp.leq v_prenex_8 .cse2) (not (fp.leq (fp.add RNE (fp.add RNE (fp.mul RNE .cse3 .cse0) (fp.mul RNE .cse4 .cse0)) (fp.mul RNE .cse5 v_prenex_8)) .cse1)))))) (exists ((v_prenex_11 (_ FloatingPoint 8 24)) (v_prenex_10 (_ FloatingPoint 8 24))) (let ((.cse12 ((_ to_fp 8 24) RNE 5.0)) (.cse7 ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0))) (.cse9 ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0))) (.cse10 ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)))) (let ((.cse6 ((_ to_fp 8 24) RNE 1.0)) (.cse8 (fp.add RNE (fp.add RNE (fp.mul RNE .cse7 v_prenex_11) (fp.mul RNE .cse9 v_prenex_11)) (fp.mul RNE .cse10 v_prenex_10))) (.cse11 (fp.neg .cse12))) (and (fp.leq v_prenex_11 .cse6) (not (fp.geq (fp.add RNE (fp.add RNE (fp.mul RNE .cse7 .cse8) (fp.mul RNE .cse9 .cse8)) (fp.mul RNE .cse10 v_prenex_11)) .cse11)) (fp.geq v_prenex_11 (fp.neg .cse6)) (fp.leq .cse8 .cse12) (fp.geq .cse8 .cse11)))))) is different from true [2018-11-10 04:32:21,432 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 26 proven. 14 refuted. 0 times theorem prover too weak. 19 trivial. 63 not checked. [2018-11-10 04:32:21,432 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 04:32:32,365 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) c_~Y~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) c_~Z~0))) (.cse1 ((_ to_fp 8 24) RNE 5.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from false [2018-11-10 04:32:34,392 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) c_~Y~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) c_~Z~0))) (.cse1 ((_ to_fp 8 24) RNE 5.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from true [2018-11-10 04:33:29,514 WARN L179 SmtUtils]: Spent 11.22 s on a formula simplification that was a NOOP. DAG size: 20 [2018-11-10 04:33:46,915 WARN L179 SmtUtils]: Spent 17.37 s on a formula simplification that was a NOOP. DAG size: 34 [2018-11-10 04:33:58,931 WARN L179 SmtUtils]: Spent 12.02 s on a formula simplification that was a NOOP. DAG size: 30 [2018-11-10 04:34:19,440 WARN L179 SmtUtils]: Spent 20.51 s on a formula simplification that was a NOOP. DAG size: 34 [2018-11-10 04:34:35,901 WARN L179 SmtUtils]: Spent 16.46 s on a formula simplification that was a NOOP. DAG size: 32 [2018-11-10 04:34:37,921 WARN L832 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_13 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0))) (.cse2 ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0))) (.cse3 ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0))) (.cse5 ((_ to_fp 8 24) RNE 5.0))) (let ((.cse4 (fp.neg .cse5)) (.cse1 (fp.add RNE (fp.add RNE (fp.mul RNE .cse0 c_~X~0) (fp.mul RNE .cse2 c_~X~0)) (fp.mul RNE .cse3 v_prenex_13)))) (or (fp.geq (fp.add RNE (fp.add RNE (fp.mul RNE .cse0 .cse1) (fp.mul RNE .cse2 .cse1)) (fp.mul RNE .cse3 c_~X~0)) .cse4) (not (fp.geq .cse1 .cse4)) (not (fp.leq .cse1 .cse5)))))) (forall ((v_~Z~0_29 (_ FloatingPoint 8 24))) (let ((.cse8 ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0))) (.cse9 ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0))) (.cse10 ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)))) (let ((.cse6 (fp.add RNE (fp.add RNE (fp.mul RNE .cse8 c_~X~0) (fp.mul RNE .cse9 c_~X~0)) (fp.mul RNE .cse10 v_~Z~0_29))) (.cse7 ((_ to_fp 8 24) RNE 5.0))) (or (not (fp.leq .cse6 .cse7)) (fp.leq (fp.add RNE (fp.add RNE (fp.mul RNE .cse8 .cse6) (fp.mul RNE .cse9 .cse6)) (fp.mul RNE .cse10 c_~X~0)) .cse7) (not (fp.geq .cse6 (fp.neg .cse7)))))))) is different from false [2018-11-10 04:34:39,984 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_13 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0))) (.cse2 ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0))) (.cse3 ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0))) (.cse5 ((_ to_fp 8 24) RNE 5.0))) (let ((.cse4 (fp.neg .cse5)) (.cse1 (fp.add RNE (fp.add RNE (fp.mul RNE .cse0 c_~X~0) (fp.mul RNE .cse2 c_~X~0)) (fp.mul RNE .cse3 v_prenex_13)))) (or (fp.geq (fp.add RNE (fp.add RNE (fp.mul RNE .cse0 .cse1) (fp.mul RNE .cse2 .cse1)) (fp.mul RNE .cse3 c_~X~0)) .cse4) (not (fp.geq .cse1 .cse4)) (not (fp.leq .cse1 .cse5)))))) (forall ((v_~Z~0_29 (_ FloatingPoint 8 24))) (let ((.cse8 ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0))) (.cse9 ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0))) (.cse10 ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)))) (let ((.cse6 (fp.add RNE (fp.add RNE (fp.mul RNE .cse8 c_~X~0) (fp.mul RNE .cse9 c_~X~0)) (fp.mul RNE .cse10 v_~Z~0_29))) (.cse7 ((_ to_fp 8 24) RNE 5.0))) (or (not (fp.leq .cse6 .cse7)) (fp.leq (fp.add RNE (fp.add RNE (fp.mul RNE .cse8 .cse6) (fp.mul RNE .cse9 .cse6)) (fp.mul RNE .cse10 c_~X~0)) .cse7) (not (fp.geq .cse6 (fp.neg .cse7)))))))) is different from true [2018-11-10 04:34:39,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:34:39,996 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_90686f4c-f71f-4885-b8b1-3330c1835a0a/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 04:34:40,001 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 04:35:30,890 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-10 04:35:30,890 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2018-11-10 04:35:30,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-10 04:35:30,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-11-10 04:35:30,975 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-10 04:35:30,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-10 04:35:30,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=162, Unknown=36, NotChecked=396, Total=650 [2018-11-10 04:35:30,975 INFO L87 Difference]: Start difference. First operand 83 states and 95 transitions. Second operand 20 states. [2018-11-10 04:35:34,039 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) RNE 1.0))) (and (exists ((~Z~0 (_ FloatingPoint 8 24))) (= c_~X~0 (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) c_~Y~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) c_~Y~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) ~Z~0)))) (fp.leq c_~I~0 .cse0) (= c_~I~0 c_~X~0) (fp.geq c_~I~0 (fp.neg .cse0)))) is different from false [2018-11-10 04:36:16,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:36:16,013 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. No stderr output. 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:893) 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.getOrConstructPredicateForConjunction(PredicateUnifier.java:382) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:673) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) 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) ... 43 more [2018-11-10 04:36:16,015 INFO L168 Benchmark]: Toolchain (without parser) took 705260.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 171.4 MB). Free memory was 953.2 MB in the beginning and 935.1 MB in the end (delta: 18.2 MB). Peak memory consumption was 189.6 MB. Max. memory is 11.5 GB. [2018-11-10 04:36:16,016 INFO L168 Benchmark]: CDTParser took 0.15 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-10 04:36:16,016 INFO L168 Benchmark]: CACSL2BoogieTranslator took 176.10 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 942.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 04:36:16,016 INFO L168 Benchmark]: Boogie Preprocessor took 26.35 ms. Allocated memory is still 1.0 GB. Free memory was 942.5 MB in the beginning and 937.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-10 04:36:16,017 INFO L168 Benchmark]: RCFGBuilder took 601.00 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 87.0 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -123.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. [2018-11-10 04:36:16,017 INFO L168 Benchmark]: TraceAbstraction took 704454.32 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 84.4 MB). Free memory was 1.1 GB in the beginning and 935.1 MB in the end (delta: 125.1 MB). Peak memory consumption was 209.5 MB. Max. memory is 11.5 GB. [2018-11-10 04:36:16,019 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.15 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 176.10 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 942.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.35 ms. Allocated memory is still 1.0 GB. Free memory was 942.5 MB in the beginning and 937.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 601.00 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 87.0 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -123.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 704454.32 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 84.4 MB). Free memory was 1.1 GB in the beginning and 935.1 MB in the end (delta: 125.1 MB). Peak memory consumption was 209.5 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. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output.: 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...