./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad_false-unreach-call.i.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_78a36061-e085-4d37-afb1-1f428abe0068/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_78a36061-e085-4d37-afb1-1f428abe0068/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_78a36061-e085-4d37-afb1-1f428abe0068/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_78a36061-e085-4d37-afb1-1f428abe0068/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad_false-unreach-call.i.p+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_78a36061-e085-4d37-afb1-1f428abe0068/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_78a36061-e085-4d37-afb1-1f428abe0068/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c3b46b0a01de4b9e0cf3e5cf7ccb067d9e1dbfad ......................................................................................................................................................................................................................................................... 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_78a36061-e085-4d37-afb1-1f428abe0068/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_78a36061-e085-4d37-afb1-1f428abe0068/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_78a36061-e085-4d37-afb1-1f428abe0068/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_78a36061-e085-4d37-afb1-1f428abe0068/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad_false-unreach-call.i.p+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_78a36061-e085-4d37-afb1-1f428abe0068/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_78a36061-e085-4d37-afb1-1f428abe0068/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c3b46b0a01de4b9e0cf3e5cf7ccb067d9e1dbfad ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 00:06:15,020 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 00:06:15,021 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 00:06:15,027 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 00:06:15,027 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 00:06:15,028 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 00:06:15,028 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 00:06:15,029 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 00:06:15,030 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 00:06:15,030 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 00:06:15,031 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 00:06:15,031 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 00:06:15,031 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 00:06:15,032 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 00:06:15,032 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 00:06:15,032 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 00:06:15,033 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 00:06:15,034 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 00:06:15,035 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 00:06:15,035 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 00:06:15,036 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 00:06:15,036 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 00:06:15,037 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 00:06:15,038 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 00:06:15,038 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 00:06:15,038 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 00:06:15,039 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 00:06:15,039 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 00:06:15,039 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 00:06:15,040 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 00:06:15,040 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 00:06:15,040 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 00:06:15,040 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 00:06:15,040 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 00:06:15,041 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 00:06:15,041 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 00:06:15,041 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_78a36061-e085-4d37-afb1-1f428abe0068/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 00:06:15,048 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 00:06:15,048 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 00:06:15,049 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 00:06:15,049 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 00:06:15,049 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 00:06:15,049 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 00:06:15,049 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 00:06:15,049 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 00:06:15,050 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 00:06:15,050 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 00:06:15,050 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 00:06:15,050 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 00:06:15,050 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 00:06:15,050 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 00:06:15,050 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 00:06:15,050 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 00:06:15,051 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 00:06:15,051 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 00:06:15,051 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 00:06:15,051 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 00:06:15,051 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 00:06:15,051 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 00:06:15,051 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 00:06:15,051 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 00:06:15,051 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 00:06:15,051 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 00:06:15,051 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 00:06:15,051 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 00:06:15,052 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 00:06:15,052 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 00:06:15,052 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 00:06:15,052 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 00:06:15,052 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 00:06:15,052 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 00:06:15,052 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 00:06:15,052 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 00:06:15,052 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_78a36061-e085-4d37-afb1-1f428abe0068/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c3b46b0a01de4b9e0cf3e5cf7ccb067d9e1dbfad [2018-12-09 00:06:15,069 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 00:06:15,076 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 00:06:15,077 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 00:06:15,078 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 00:06:15,079 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 00:06:15,079 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_78a36061-e085-4d37-afb1-1f428abe0068/bin-2019/utaipan/../../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad_false-unreach-call.i.p+cfa-reducer.c [2018-12-09 00:06:15,113 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_78a36061-e085-4d37-afb1-1f428abe0068/bin-2019/utaipan/data/39d60d6bd/e9c4f31b8409494192a41f17d55e8986/FLAG5ba8c256f [2018-12-09 00:06:15,502 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 00:06:15,502 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_78a36061-e085-4d37-afb1-1f428abe0068/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad_false-unreach-call.i.p+cfa-reducer.c [2018-12-09 00:06:15,506 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_78a36061-e085-4d37-afb1-1f428abe0068/bin-2019/utaipan/data/39d60d6bd/e9c4f31b8409494192a41f17d55e8986/FLAG5ba8c256f [2018-12-09 00:06:15,514 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_78a36061-e085-4d37-afb1-1f428abe0068/bin-2019/utaipan/data/39d60d6bd/e9c4f31b8409494192a41f17d55e8986 [2018-12-09 00:06:15,516 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 00:06:15,517 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 00:06:15,518 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 00:06:15,518 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 00:06:15,521 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 00:06:15,522 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:06:15" (1/1) ... [2018-12-09 00:06:15,524 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44a63a5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:06:15, skipping insertion in model container [2018-12-09 00:06:15,524 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:06:15" (1/1) ... [2018-12-09 00:06:15,528 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 00:06:15,539 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 00:06:15,627 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:06:15,630 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 00:06:15,638 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:06:15,646 INFO L195 MainTranslator]: Completed translation [2018-12-09 00:06:15,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:06:15 WrapperNode [2018-12-09 00:06:15,646 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 00:06:15,646 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 00:06:15,646 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 00:06:15,647 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 00:06:15,651 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:06:15" (1/1) ... [2018-12-09 00:06:15,654 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:06:15" (1/1) ... [2018-12-09 00:06:15,658 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 00:06:15,658 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 00:06:15,658 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 00:06:15,658 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 00:06:15,663 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:06:15" (1/1) ... [2018-12-09 00:06:15,663 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:06:15" (1/1) ... [2018-12-09 00:06:15,663 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:06:15" (1/1) ... [2018-12-09 00:06:15,664 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:06:15" (1/1) ... [2018-12-09 00:06:15,666 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:06:15" (1/1) ... [2018-12-09 00:06:15,667 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:06:15" (1/1) ... [2018-12-09 00:06:15,668 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:06:15" (1/1) ... [2018-12-09 00:06:15,668 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 00:06:15,669 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 00:06:15,669 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 00:06:15,669 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 00:06:15,669 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:06:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_78a36061-e085-4d37-afb1-1f428abe0068/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 00:06:15,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 00:06:15,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 00:06:15,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 00:06:15,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 00:06:15,729 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 00:06:15,729 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 00:06:15,810 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 00:06:15,810 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-09 00:06:15,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:06:15 BoogieIcfgContainer [2018-12-09 00:06:15,810 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 00:06:15,811 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 00:06:15,811 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 00:06:15,812 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 00:06:15,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 12:06:15" (1/3) ... [2018-12-09 00:06:15,813 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c910191 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:06:15, skipping insertion in model container [2018-12-09 00:06:15,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:06:15" (2/3) ... [2018-12-09 00:06:15,813 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c910191 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:06:15, skipping insertion in model container [2018-12-09 00:06:15,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:06:15" (3/3) ... [2018-12-09 00:06:15,814 INFO L112 eAbstractionObserver]: Analyzing ICFG Float_div_bad_false-unreach-call.i.p+cfa-reducer.c [2018-12-09 00:06:15,819 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 00:06:15,823 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 00:06:15,831 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 00:06:15,848 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 00:06:15,848 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 00:06:15,848 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 00:06:15,848 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 00:06:15,848 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 00:06:15,849 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 00:06:15,849 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 00:06:15,849 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 00:06:15,858 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2018-12-09 00:06:15,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-09 00:06:15,861 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:06:15,862 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:06:15,863 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:06:15,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:06:15,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1301230683, now seen corresponding path program 1 times [2018-12-09 00:06:15,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:06:15,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:06:15,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:06:15,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:06:15,896 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:06:15,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:06:15,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:06:15,932 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 00:06:15,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 12:06:15 BoogieIcfgContainer [2018-12-09 00:06:15,946 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 00:06:15,946 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 00:06:15,946 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 00:06:15,946 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 00:06:15,947 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:06:15" (3/4) ... [2018-12-09 00:06:15,949 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 00:06:15,949 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 00:06:15,950 INFO L168 Benchmark]: Toolchain (without parser) took 433.34 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -141.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:06:15,951 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:06:15,951 INFO L168 Benchmark]: CACSL2BoogieTranslator took 128.21 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 939.0 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-12-09 00:06:15,952 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.49 ms. Allocated memory is still 1.0 GB. Free memory is still 939.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:06:15,952 INFO L168 Benchmark]: Boogie Preprocessor took 10.47 ms. Allocated memory is still 1.0 GB. Free memory is still 939.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:06:15,952 INFO L168 Benchmark]: RCFGBuilder took 141.65 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 939.0 MB in the beginning and 1.1 GB in the end (delta: -166.5 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-12-09 00:06:15,953 INFO L168 Benchmark]: TraceAbstraction took 135.48 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-12-09 00:06:15,953 INFO L168 Benchmark]: Witness Printer took 3.15 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:06:15,955 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 128.21 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 939.0 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.49 ms. Allocated memory is still 1.0 GB. Free memory is still 939.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.47 ms. Allocated memory is still 1.0 GB. Free memory is still 939.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 141.65 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 939.0 MB in the beginning and 1.1 GB in the end (delta: -166.5 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 135.48 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.15 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 25]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 10, overapproximation of someBinaryArithmeticDOUBLEoperation at line 8. Possible FailurePath: [L1] int __return_main; VAL [\old(__return_main)=2, __return_main=0] [L7] float main__x = 1.0; [L8] float main__x1 = main__x / 1.600000023841858; VAL [__return_main=0, main__x=1] [L10] COND FALSE !(main__x1 != main__x) [L19] int __tmp_1; [L20] __tmp_1 = main__x == 0 [L21] int __VERIFIER_assert__cond; [L22] __VERIFIER_assert__cond = __tmp_1 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main__x=1] [L23] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main__x=1] [L25] __VERIFIER_error() VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main__x=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 14 locations, 1 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 9 NumberOfCodeBlocks, 9 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-09 00:06:17,252 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 00:06:17,253 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 00:06:17,259 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 00:06:17,259 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 00:06:17,260 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 00:06:17,260 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 00:06:17,261 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 00:06:17,262 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 00:06:17,262 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 00:06:17,263 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 00:06:17,263 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 00:06:17,263 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 00:06:17,264 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 00:06:17,264 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 00:06:17,265 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 00:06:17,265 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 00:06:17,266 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 00:06:17,267 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 00:06:17,267 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 00:06:17,268 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 00:06:17,269 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 00:06:17,270 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 00:06:17,270 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 00:06:17,270 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 00:06:17,270 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 00:06:17,271 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 00:06:17,271 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 00:06:17,272 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 00:06:17,272 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 00:06:17,272 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 00:06:17,273 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 00:06:17,273 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 00:06:17,273 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 00:06:17,273 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 00:06:17,273 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 00:06:17,274 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_78a36061-e085-4d37-afb1-1f428abe0068/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-12-09 00:06:17,281 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 00:06:17,281 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 00:06:17,282 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 00:06:17,282 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 00:06:17,282 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 00:06:17,282 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 00:06:17,282 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 00:06:17,282 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 00:06:17,282 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 00:06:17,282 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 00:06:17,283 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 00:06:17,283 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 00:06:17,283 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 00:06:17,283 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 00:06:17,283 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 00:06:17,283 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 00:06:17,283 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 00:06:17,283 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-09 00:06:17,283 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-09 00:06:17,283 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 00:06:17,283 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 00:06:17,283 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 00:06:17,283 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 00:06:17,284 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 00:06:17,284 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 00:06:17,284 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 00:06:17,284 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 00:06:17,284 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 00:06:17,284 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 00:06:17,284 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 00:06:17,284 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 00:06:17,284 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-09 00:06:17,284 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 00:06:17,284 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-09 00:06:17,284 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-09 00:06:17,284 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_78a36061-e085-4d37-afb1-1f428abe0068/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c3b46b0a01de4b9e0cf3e5cf7ccb067d9e1dbfad [2018-12-09 00:06:17,303 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 00:06:17,312 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 00:06:17,315 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 00:06:17,316 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 00:06:17,317 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 00:06:17,317 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_78a36061-e085-4d37-afb1-1f428abe0068/bin-2019/utaipan/../../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad_false-unreach-call.i.p+cfa-reducer.c [2018-12-09 00:06:17,362 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_78a36061-e085-4d37-afb1-1f428abe0068/bin-2019/utaipan/data/91fab83ee/d731587dc1224af6a365c600c17e8b01/FLAGabab59811 [2018-12-09 00:06:17,748 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 00:06:17,749 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_78a36061-e085-4d37-afb1-1f428abe0068/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad_false-unreach-call.i.p+cfa-reducer.c [2018-12-09 00:06:17,752 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_78a36061-e085-4d37-afb1-1f428abe0068/bin-2019/utaipan/data/91fab83ee/d731587dc1224af6a365c600c17e8b01/FLAGabab59811 [2018-12-09 00:06:17,762 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_78a36061-e085-4d37-afb1-1f428abe0068/bin-2019/utaipan/data/91fab83ee/d731587dc1224af6a365c600c17e8b01 [2018-12-09 00:06:17,765 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 00:06:17,766 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 00:06:17,767 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 00:06:17,767 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 00:06:17,770 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 00:06:17,771 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:06:17" (1/1) ... [2018-12-09 00:06:17,773 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cf430f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:06:17, skipping insertion in model container [2018-12-09 00:06:17,773 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:06:17" (1/1) ... [2018-12-09 00:06:17,779 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 00:06:17,792 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 00:06:17,877 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:06:17,881 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 00:06:17,891 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:06:17,899 INFO L195 MainTranslator]: Completed translation [2018-12-09 00:06:17,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:06:17 WrapperNode [2018-12-09 00:06:17,900 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 00:06:17,900 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 00:06:17,900 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 00:06:17,900 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 00:06:17,905 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:06:17" (1/1) ... [2018-12-09 00:06:17,909 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:06:17" (1/1) ... [2018-12-09 00:06:17,913 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 00:06:17,913 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 00:06:17,914 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 00:06:17,914 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 00:06:17,919 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:06:17" (1/1) ... [2018-12-09 00:06:17,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:06:17" (1/1) ... [2018-12-09 00:06:17,920 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:06:17" (1/1) ... [2018-12-09 00:06:17,920 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:06:17" (1/1) ... [2018-12-09 00:06:17,924 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:06:17" (1/1) ... [2018-12-09 00:06:17,925 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:06:17" (1/1) ... [2018-12-09 00:06:17,926 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:06:17" (1/1) ... [2018-12-09 00:06:17,929 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 00:06:17,929 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 00:06:17,929 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 00:06:17,929 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 00:06:17,930 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:06:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_78a36061-e085-4d37-afb1-1f428abe0068/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 00:06:18,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 00:06:18,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 00:06:18,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 00:06:18,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 00:06:18,021 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 00:06:18,021 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 00:06:20,277 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 00:06:20,277 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-09 00:06:20,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:06:20 BoogieIcfgContainer [2018-12-09 00:06:20,278 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 00:06:20,278 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 00:06:20,279 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 00:06:20,281 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 00:06:20,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 12:06:17" (1/3) ... [2018-12-09 00:06:20,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c895735 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:06:20, skipping insertion in model container [2018-12-09 00:06:20,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:06:17" (2/3) ... [2018-12-09 00:06:20,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c895735 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:06:20, skipping insertion in model container [2018-12-09 00:06:20,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:06:20" (3/3) ... [2018-12-09 00:06:20,283 INFO L112 eAbstractionObserver]: Analyzing ICFG Float_div_bad_false-unreach-call.i.p+cfa-reducer.c [2018-12-09 00:06:20,289 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 00:06:20,293 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 00:06:20,303 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 00:06:20,321 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 00:06:20,321 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 00:06:20,321 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 00:06:20,321 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 00:06:20,321 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 00:06:20,321 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 00:06:20,322 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 00:06:20,322 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 00:06:20,322 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 00:06:20,331 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2018-12-09 00:06:20,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-09 00:06:20,334 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:06:20,335 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:06:20,336 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:06:20,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:06:20,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1301230683, now seen corresponding path program 1 times [2018-12-09 00:06:20,342 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-09 00:06:20,342 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_78a36061-e085-4d37-afb1-1f428abe0068/bin-2019/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-12-09 00:06:20,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:06:20,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:06:20,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:06:22,800 WARN L854 $PredicateComparison]: unable to prove that (and (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x~0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) c_main_~main__x1~0) (= c_main_~main__x~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)))) is different from true [2018-12-09 00:06:22,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:06:22,808 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 00:06:22,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:06:22,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:06:22,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:06:22,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:06:22,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-12-09 00:06:22,834 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 3 states. [2018-12-09 00:06:22,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:06:22,846 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-12-09 00:06:22,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:06:22,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-12-09 00:06:22,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:06:22,852 INFO L225 Difference]: With dead ends: 22 [2018-12-09 00:06:22,852 INFO L226 Difference]: Without dead ends: 11 [2018-12-09 00:06:22,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-12-09 00:06:22,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-09 00:06:22,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-09 00:06:22,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-09 00:06:22,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-12-09 00:06:22,874 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-12-09 00:06:22,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:06:22,874 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-12-09 00:06:22,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:06:22,874 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-09 00:06:22,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 00:06:22,874 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:06:22,874 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:06:22,875 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:06:22,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:06:22,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1683383028, now seen corresponding path program 1 times [2018-12-09 00:06:22,875 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-09 00:06:22,875 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_78a36061-e085-4d37-afb1-1f428abe0068/bin-2019/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-12-09 00:06:22,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:06:23,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:06:23,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:06:31,431 WARN L180 SmtUtils]: Spent 4.78 s on a formula simplification that was a NOOP. DAG size: 17 [2018-12-09 00:06:31,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:06:31,436 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:06:35,865 WARN L832 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) c_main_~main__x1~0)) is different from false [2018-12-09 00:06:37,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2018-12-09 00:06:37,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:06:37,370 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_78a36061-e085-4d37-afb1-1f428abe0068/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:06:37,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:06:49,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2018-12-09 00:06:49,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:06:49,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-12-09 00:06:49,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:06:49,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:06:49,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=11, Unknown=3, NotChecked=6, Total=30 [2018-12-09 00:06:49,837 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 6 states. [2018-12-09 00:06:52,065 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0)) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0)) c_main_~main__x1~0) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse0)) c_main_~main__x1~0)))) is different from true [2018-12-09 00:06:58,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:06:58,575 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-12-09 00:06:58,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:06:58,576 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-12-09 00:06:58,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:06:58,577 INFO L225 Difference]: With dead ends: 15 [2018-12-09 00:06:58,577 INFO L226 Difference]: Without dead ends: 12 [2018-12-09 00:06:58,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=12, Invalid=12, Unknown=4, NotChecked=14, Total=42 [2018-12-09 00:06:58,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-09 00:06:58,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-09 00:06:58,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-09 00:06:58,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-12-09 00:06:58,581 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-12-09 00:06:58,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:06:58,581 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-12-09 00:06:58,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:06:58,581 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-09 00:06:58,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 00:06:58,582 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:06:58,582 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:06:58,582 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:06:58,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:06:58,582 INFO L82 PathProgramCache]: Analyzing trace with hash 645203835, now seen corresponding path program 2 times [2018-12-09 00:06:58,583 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-09 00:06:58,583 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_78a36061-e085-4d37-afb1-1f428abe0068/bin-2019/utaipan/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-12-09 00:06:58,587 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-09 00:06:59,251 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 00:06:59,252 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 00:06:59,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:07:10,002 WARN L180 SmtUtils]: Spent 5.30 s on a formula simplification that was a NOOP. DAG size: 20 [2018-12-09 00:07:10,010 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:07:10,010 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:07:16,426 WARN L832 $PredicateComparison]: unable to prove that (or (fp.eq c_main_~main__x1~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) c_main_~main__x1~0))) is different from false [2018-12-09 00:07:18,652 WARN L854 $PredicateComparison]: unable to prove that (or (fp.eq c_main_~main__x1~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) c_main_~main__x1~0))) is different from true [2018-12-09 00:07:21,058 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) is different from false [2018-12-09 00:07:23,475 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) is different from true [2018-12-09 00:07:23,489 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-12-09 00:07:23,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:07:23,505 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_78a36061-e085-4d37-afb1-1f428abe0068/bin-2019/utaipan/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-12-09 00:07:23,513 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 00:07:37,994 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 00:07:37,994 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2018-12-09 00:07:38,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:07:38,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-12-09 00:07:38,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 00:07:38,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 00:07:38,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=28, Unknown=6, NotChecked=22, Total=72 [2018-12-09 00:07:38,673 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 9 states. [2018-12-09 00:07:41,117 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (or (fp.eq c_main_~main__x~0 .cse0) (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse1)) c_main_~main__x1~0) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse2) .cse1)) .cse2)) (fp.eq .cse2 .cse0))))) is different from true [2018-12-09 00:07:52,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:07:52,197 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-12-09 00:07:52,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:07:52,198 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2018-12-09 00:07:52,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:07:52,198 INFO L225 Difference]: With dead ends: 16 [2018-12-09 00:07:52,198 INFO L226 Difference]: Without dead ends: 13 [2018-12-09 00:07:52,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 28.3s TimeCoverageRelationStatistics Valid=18, Invalid=29, Unknown=7, NotChecked=36, Total=90 [2018-12-09 00:07:52,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-09 00:07:52,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-09 00:07:52,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-09 00:07:52,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-12-09 00:07:52,202 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-12-09 00:07:52,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:07:52,202 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-12-09 00:07:52,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 00:07:52,202 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-12-09 00:07:52,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-09 00:07:52,203 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:07:52,203 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:07:52,203 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:07:52,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:07:52,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1473580076, now seen corresponding path program 3 times [2018-12-09 00:07:52,203 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-09 00:07:52,204 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_78a36061-e085-4d37-afb1-1f428abe0068/bin-2019/utaipan/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-12-09 00:07:52,207 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-12-09 00:07:53,176 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 00:07:53,176 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 00:07:53,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:08:04,846 WARN L180 SmtUtils]: Spent 3.55 s on a formula simplification that was a NOOP. DAG size: 23 [2018-12-09 00:08:04,851 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:08:04,851 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:08:11,575 WARN L832 $PredicateComparison]: unable to prove that (or (fp.eq c_main_~main__x1~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) c_main_~main__x1~0))) is different from false [2018-12-09 00:08:13,801 WARN L854 $PredicateComparison]: unable to prove that (or (fp.eq c_main_~main__x1~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) c_main_~main__x1~0))) is different from true [2018-12-09 00:08:16,237 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) is different from false [2018-12-09 00:08:18,689 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) is different from true [2018-12-09 00:08:21,322 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) is different from false [2018-12-09 00:08:23,959 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) is different from true [2018-12-09 00:08:23,975 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2018-12-09 00:08:23,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:08:23,993 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_78a36061-e085-4d37-afb1-1f428abe0068/bin-2019/utaipan/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-12-09 00:08:24,000 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 00:08:50,500 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 00:08:50,501 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2018-12-09 00:08:51,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:08:51,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2018-12-09 00:08:51,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 00:08:51,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 00:08:51,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=39, Unknown=9, NotChecked=42, Total=110 [2018-12-09 00:08:51,388 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 11 states. [2018-12-09 00:08:54,070 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (or (fp.eq c_main_~main__x~0 .cse0) (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse1)) c_main_~main__x1~0) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse2) .cse1)) .cse2)) (fp.eq .cse2 .cse0))))) is different from true [2018-12-09 00:08:56,525 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0)) c_main_~main__x1~0) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse0)))) (or (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) .cse0)) .cse1)) (fp.eq .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))))) is different from true [2018-12-09 00:08:58,761 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (or (fp.eq c_main_~main__x1~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse0)) c_main_~main__x1~0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))) .cse0)) c_main_~main__x1~0))) is different from true [2018-12-09 00:09:08,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:09:08,702 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-12-09 00:09:08,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:09:08,702 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 12 [2018-12-09 00:09:08,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:09:08,703 INFO L225 Difference]: With dead ends: 17 [2018-12-09 00:09:08,703 INFO L226 Difference]: Without dead ends: 14 [2018-12-09 00:09:08,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 38.0s TimeCoverageRelationStatistics Valid=26, Invalid=42, Unknown=12, NotChecked=102, Total=182 [2018-12-09 00:09:08,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-09 00:09:08,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-09 00:09:08,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-09 00:09:08,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-12-09 00:09:08,707 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-12-09 00:09:08,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:09:08,707 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-12-09 00:09:08,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 00:09:08,707 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-12-09 00:09:08,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-09 00:09:08,708 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:09:08,708 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:09:08,708 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:09:08,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:09:08,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1563595419, now seen corresponding path program 4 times [2018-12-09 00:09:08,708 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-09 00:09:08,708 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_78a36061-e085-4d37-afb1-1f428abe0068/bin-2019/utaipan/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-12-09 00:09:08,713 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 00:09:09,811 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 00:09:09,811 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 00:09:09,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:09:12,157 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (= c_main_~main__x~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x~0) .cse0)) c_main_~main__x1~0))) is different from true [2018-12-09 00:09:12,161 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2018-12-09 00:09:12,161 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:09:14,410 WARN L832 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) c_main_~main__x1~0)) is different from false [2018-12-09 00:09:18,377 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from false [2018-12-09 00:09:20,819 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from true [2018-12-09 00:09:23,489 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from false [2018-12-09 00:09:26,147 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from true [2018-12-09 00:09:28,994 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from false [2018-12-09 00:09:31,840 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from true [2018-12-09 00:09:31,858 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2018-12-09 00:09:31,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:09:31,879 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_78a36061-e085-4d37-afb1-1f428abe0068/bin-2019/utaipan/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-12-09 00:09:31,886 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 00:09:55,892 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 00:09:55,893 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2018-12-09 00:09:56,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:09:56,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-12-09 00:09:56,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 00:09:56,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 00:09:56,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=33, Unknown=8, NotChecked=70, Total=132 [2018-12-09 00:09:56,987 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 12 states. [2018-12-09 00:09:59,903 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0)) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0)) c_main_~main__x1~0) (not (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse0))) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) .cse0)) .cse1))))) is different from true [2018-12-09 00:10:02,577 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (not (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse1))) .cse1)) c_main_~main__x1~0))) is different from true [2018-12-09 00:10:05,032 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (not (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse1))) .cse1))) .cse1)) c_main_~main__x1~0))) is different from true [2018-12-09 00:10:07,261 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse0)) c_main_~main__x1~0)) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))) .cse0))) .cse0)) c_main_~main__x1~0))) is different from true [2018-12-09 00:10:09,492 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0)) (= c_main_~main__x~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x~0) .cse0)) c_main_~main__x1~0))) is different from true [2018-12-09 00:10:10,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:10:10,974 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-12-09 00:10:10,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:10:10,975 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 13 [2018-12-09 00:10:10,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:10:10,975 INFO L225 Difference]: With dead ends: 18 [2018-12-09 00:10:10,975 INFO L226 Difference]: Without dead ends: 15 [2018-12-09 00:10:10,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 34.4s TimeCoverageRelationStatistics Valid=31, Invalid=38, Unknown=13, NotChecked=190, Total=272 [2018-12-09 00:10:10,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-09 00:10:10,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-09 00:10:10,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-09 00:10:10,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-12-09 00:10:10,980 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-12-09 00:10:10,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:10:10,981 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-12-09 00:10:10,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 00:10:10,981 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-12-09 00:10:10,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 00:10:10,981 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:10:10,981 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:10:10,981 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:10:10,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:10:10,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1226755252, now seen corresponding path program 5 times [2018-12-09 00:10:10,982 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-09 00:10:10,982 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_78a36061-e085-4d37-afb1-1f428abe0068/bin-2019/utaipan/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2018-12-09 00:10:10,987 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2018-12-09 00:10:12,665 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-12-09 00:10:12,665 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 00:10:12,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:10:15,057 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (= c_main_~main__x~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x~0) .cse0)) c_main_~main__x1~0))) is different from true [2018-12-09 00:10:15,061 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2018-12-09 00:10:15,061 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:10:17,323 WARN L832 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) c_main_~main__x1~0)) is different from false [2018-12-09 00:10:21,278 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from false [2018-12-09 00:10:23,730 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from true [2018-12-09 00:10:26,398 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from false [2018-12-09 00:10:29,075 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from true [2018-12-09 00:10:31,980 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from false [2018-12-09 00:10:34,897 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from true [2018-12-09 00:10:38,011 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from false [2018-12-09 00:10:41,132 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from true [2018-12-09 00:10:41,153 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2018-12-09 00:10:41,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:10:41,176 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_78a36061-e085-4d37-afb1-1f428abe0068/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:10:41,183 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-09 00:11:21,722 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-12-09 00:11:21,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (12)] Forcibly destroying the process [2018-12-09 00:11:23,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:11:23,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-12-09 00:11:23,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 00:11:23,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 00:11:23,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=45, Unknown=10, NotChecked=102, Total=182 [2018-12-09 00:11:23,068 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2018-12-09 00:11:26,169 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0)) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0)) c_main_~main__x1~0) (not (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse0))) .cse0))) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) .cse0)) .cse1))))) is different from true [2018-12-09 00:11:29,079 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0)) c_main_~main__x1~0) (not (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse0))) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) .cse0)) .cse1))))) is different from true [2018-12-09 00:11:31,770 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (not (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse1))) .cse1))) .cse1)) c_main_~main__x1~0))) is different from true [2018-12-09 00:11:34,234 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (not (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse1))) .cse1))) .cse1))) .cse1)) c_main_~main__x1~0))) is different from true [2018-12-09 00:11:48,613 WARN L180 SmtUtils]: Spent 6.85 s on a formula simplification that was a NOOP. DAG size: 31 [2018-12-09 00:11:53,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:11:53,713 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-12-09 00:11:53,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 00:11:53,714 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-12-09 00:11:53,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:11:53,714 INFO L225 Difference]: With dead ends: 19 [2018-12-09 00:11:53,714 INFO L226 Difference]: Without dead ends: 16 [2018-12-09 00:11:53,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 51.6s TimeCoverageRelationStatistics Valid=36, Invalid=61, Unknown=15, NotChecked=230, Total=342 [2018-12-09 00:11:53,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-09 00:11:53,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-09 00:11:53,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-09 00:11:53,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-12-09 00:11:53,719 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-12-09 00:11:53,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:11:53,719 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-12-09 00:11:53,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 00:11:53,720 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-12-09 00:11:53,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 00:11:53,720 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:11:53,720 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:11:53,720 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:11:53,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:11:53,720 INFO L82 PathProgramCache]: Analyzing trace with hash -625355333, now seen corresponding path program 6 times [2018-12-09 00:11:53,721 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-09 00:11:53,721 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_78a36061-e085-4d37-afb1-1f428abe0068/bin-2019/utaipan/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2018-12-09 00:11:53,724 INFO L101 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2018-12-09 00:11:55,377 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-12-09 00:11:55,378 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 00:11:55,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:12:14,936 WARN L180 SmtUtils]: Spent 6.00 s on a formula simplification that was a NOOP. DAG size: 32 [2018-12-09 00:12:14,940 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:12:14,940 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:12:21,417 WARN L832 $PredicateComparison]: unable to prove that (or (fp.eq c_main_~main__x1~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) c_main_~main__x1~0))) is different from false [2018-12-09 00:12:25,956 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) is different from false [2018-12-09 00:12:28,404 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) is different from true [2018-12-09 00:12:31,091 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) is different from false [2018-12-09 00:12:33,773 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) is different from true [2018-12-09 00:12:36,680 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0))))) is different from false [2018-12-09 00:12:39,593 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0))))) is different from true [2018-12-09 00:12:42,735 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) is different from false [2018-12-09 00:12:45,850 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) is different from true [2018-12-09 00:12:49,219 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) is different from false [2018-12-09 00:12:52,595 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) is different from true [2018-12-09 00:12:52,620 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 21 not checked. [2018-12-09 00:12:52,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:12:52,645 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_78a36061-e085-4d37-afb1-1f428abe0068/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:12:52,652 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-09 00:13:31,179 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-12-09 00:13:31,179 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (14)] Forcibly destroying the process [2018-12-09 00:13:32,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:13:32,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2018-12-09 00:13:32,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-09 00:13:32,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 00:13:32,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=86, Unknown=16, NotChecked=138, Total=272 [2018-12-09 00:13:32,691 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 17 states. [2018-12-09 00:13:36,098 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (or (fp.eq c_main_~main__x~0 .cse0) (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0))) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse2))) .cse2))) .cse2))) .cse2))) .cse2)))) (or (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) .cse2)) .cse1)) (fp.eq .cse1 .cse0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse2)) c_main_~main__x1~0))) is different from true [2018-12-09 00:13:39,263 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse1))) .cse1)) c_main_~main__x1~0))) is different from true [2018-12-09 00:13:42,217 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))) .cse0)) c_main_~main__x1~0) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse0))) .cse0))) .cse0)))) (or (fp.eq .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) .cse0)) .cse1)))))) is different from true [2018-12-09 00:13:44,928 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse1))) .cse1))) .cse1))) .cse1)) c_main_~main__x1~0))) is different from true [2018-12-09 00:13:47,392 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)) c_main_~main__x1~0) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse0)))) (or (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) .cse0)) .cse1)) (fp.eq .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))))) is different from true [2018-12-09 00:13:49,637 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)) c_main_~main__x1~0) (or (fp.eq c_main_~main__x1~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse0)) c_main_~main__x1~0))))) is different from true [2018-12-09 00:13:57,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:13:57,022 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-12-09 00:13:57,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 00:13:57,022 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 15 [2018-12-09 00:13:57,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:13:57,023 INFO L225 Difference]: With dead ends: 20 [2018-12-09 00:13:57,023 INFO L226 Difference]: Without dead ends: 17 [2018-12-09 00:13:57,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 74.0s TimeCoverageRelationStatistics Valid=44, Invalid=92, Unknown=22, NotChecked=348, Total=506 [2018-12-09 00:13:57,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-09 00:13:57,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-09 00:13:57,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-09 00:13:57,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-12-09 00:13:57,029 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-12-09 00:13:57,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:13:57,030 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-12-09 00:13:57,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-09 00:13:57,030 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-12-09 00:13:57,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-09 00:13:57,030 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:13:57,031 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:13:57,031 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:13:57,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:57,031 INFO L82 PathProgramCache]: Analyzing trace with hash 2088758676, now seen corresponding path program 7 times [2018-12-09 00:13:57,032 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-09 00:13:57,032 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_78a36061-e085-4d37-afb1-1f428abe0068/bin-2019/utaipan/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2018-12-09 00:13:57,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:13:58,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:58,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:14:01,316 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (= c_main_~main__x~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x~0) .cse0)) c_main_~main__x1~0))) is different from true [2018-12-09 00:14:01,320 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2018-12-09 00:14:01,320 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:14:03,579 WARN L832 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) c_main_~main__x1~0)) is different from false [2018-12-09 00:14:05,811 WARN L854 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) c_main_~main__x1~0)) is different from true [2018-12-09 00:14:08,262 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from false [2018-12-09 00:14:10,724 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from true [2018-12-09 00:14:13,415 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from false [2018-12-09 00:14:16,103 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from true [2018-12-09 00:14:19,030 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from false [2018-12-09 00:14:21,950 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from true [2018-12-09 00:14:25,134 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from false [2018-12-09 00:14:28,293 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from true [2018-12-09 00:14:31,690 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from false [2018-12-09 00:14:35,086 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from true [2018-12-09 00:14:37,296 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-12-09 00:14:37,497 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2018-12-09 00:14:37,499 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:823) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:767) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:339) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 40 more [2018-12-09 00:14:37,506 INFO L168 Benchmark]: Toolchain (without parser) took 499740.61 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.8 MB). Free memory was 943.4 MB in the beginning and 776.8 MB in the end (delta: 166.6 MB). Peak memory consumption was 270.4 MB. Max. memory is 11.5 GB. [2018-12-09 00:14:37,508 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:14:37,509 INFO L168 Benchmark]: CACSL2BoogieTranslator took 132.86 ms. Allocated memory is still 1.0 GB. Free memory was 943.4 MB in the beginning and 931.3 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2018-12-09 00:14:37,511 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.34 ms. Allocated memory is still 1.0 GB. Free memory is still 931.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:14:37,511 INFO L168 Benchmark]: Boogie Preprocessor took 15.50 ms. Allocated memory is still 1.0 GB. Free memory was 931.3 MB in the beginning and 925.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 00:14:37,513 INFO L168 Benchmark]: RCFGBuilder took 2348.65 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.8 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -142.9 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2018-12-09 00:14:37,514 INFO L168 Benchmark]: TraceAbstraction took 497226.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 776.8 MB in the end (delta: 292.0 MB). Peak memory consumption was 292.0 MB. Max. memory is 11.5 GB. [2018-12-09 00:14:37,521 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 132.86 ms. Allocated memory is still 1.0 GB. Free memory was 943.4 MB in the beginning and 931.3 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 13.34 ms. Allocated memory is still 1.0 GB. Free memory is still 931.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.50 ms. Allocated memory is still 1.0 GB. Free memory was 931.3 MB in the beginning and 925.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2348.65 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.8 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -142.9 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 497226.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 776.8 MB in the end (delta: 292.0 MB). Peak memory consumption was 292.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...