./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_0663b_true-unreach-call.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_34bb83d7-369d-4d03-84cd-996c4ff53ea1/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_34bb83d7-369d-4d03-84cd-996c4ff53ea1/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_34bb83d7-369d-4d03-84cd-996c4ff53ea1/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_34bb83d7-369d-4d03-84cd-996c4ff53ea1/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_0663b_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_34bb83d7-369d-4d03-84cd-996c4ff53ea1/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_34bb83d7-369d-4d03-84cd-996c4ff53ea1/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0cca6d33f0772631e27f925c9516a89b4af2326a ................................................................................................................................................................................................................................................................................................................................................................... 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_34bb83d7-369d-4d03-84cd-996c4ff53ea1/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_34bb83d7-369d-4d03-84cd-996c4ff53ea1/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_34bb83d7-369d-4d03-84cd-996c4ff53ea1/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_34bb83d7-369d-4d03-84cd-996c4ff53ea1/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_0663b_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_34bb83d7-369d-4d03-84cd-996c4ff53ea1/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_34bb83d7-369d-4d03-84cd-996c4ff53ea1/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0cca6d33f0772631e27f925c9516a89b4af2326a ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-02 04:22:28,604 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 04:22:28,605 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 04:22:28,611 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 04:22:28,611 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 04:22:28,611 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 04:22:28,612 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 04:22:28,613 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 04:22:28,614 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 04:22:28,614 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 04:22:28,614 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 04:22:28,615 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 04:22:28,615 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 04:22:28,616 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 04:22:28,616 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 04:22:28,617 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 04:22:28,617 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 04:22:28,618 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 04:22:28,619 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 04:22:28,620 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 04:22:28,620 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 04:22:28,621 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 04:22:28,622 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 04:22:28,622 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 04:22:28,622 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 04:22:28,623 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 04:22:28,623 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 04:22:28,623 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 04:22:28,624 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 04:22:28,624 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 04:22:28,625 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 04:22:28,625 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 04:22:28,625 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 04:22:28,625 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 04:22:28,626 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 04:22:28,626 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 04:22:28,627 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_34bb83d7-369d-4d03-84cd-996c4ff53ea1/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-02 04:22:28,634 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 04:22:28,634 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 04:22:28,634 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 04:22:28,635 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 04:22:28,635 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 04:22:28,635 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 04:22:28,635 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 04:22:28,635 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 04:22:28,635 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 04:22:28,635 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 04:22:28,635 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 04:22:28,635 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 04:22:28,636 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 04:22:28,636 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 04:22:28,636 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 04:22:28,636 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 04:22:28,636 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 04:22:28,636 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 04:22:28,636 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 04:22:28,636 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 04:22:28,636 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 04:22:28,636 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 04:22:28,636 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 04:22:28,637 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 04:22:28,637 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 04:22:28,637 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 04:22:28,637 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 04:22:28,637 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 04:22:28,637 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 04:22:28,637 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 04:22:28,637 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_34bb83d7-369d-4d03-84cd-996c4ff53ea1/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0cca6d33f0772631e27f925c9516a89b4af2326a [2018-12-02 04:22:28,655 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 04:22:28,662 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 04:22:28,664 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 04:22:28,664 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 04:22:28,665 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 04:22:28,665 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_34bb83d7-369d-4d03-84cd-996c4ff53ea1/bin-2019/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_0663b_true-unreach-call.c [2018-12-02 04:22:28,700 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_34bb83d7-369d-4d03-84cd-996c4ff53ea1/bin-2019/uautomizer/data/80644f088/ff4c73343d2d405faf634dfa94acf295/FLAG733499658 [2018-12-02 04:22:29,070 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 04:22:29,070 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_34bb83d7-369d-4d03-84cd-996c4ff53ea1/sv-benchmarks/c/float-newlib/double_req_bl_0663b_true-unreach-call.c [2018-12-02 04:22:29,074 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_34bb83d7-369d-4d03-84cd-996c4ff53ea1/bin-2019/uautomizer/data/80644f088/ff4c73343d2d405faf634dfa94acf295/FLAG733499658 [2018-12-02 04:22:29,431 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_34bb83d7-369d-4d03-84cd-996c4ff53ea1/bin-2019/uautomizer/data/80644f088/ff4c73343d2d405faf634dfa94acf295 [2018-12-02 04:22:29,434 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 04:22:29,435 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 04:22:29,436 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 04:22:29,436 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 04:22:29,439 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 04:22:29,440 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:22:29" (1/1) ... [2018-12-02 04:22:29,442 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7962e2d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:22:29, skipping insertion in model container [2018-12-02 04:22:29,442 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:22:29" (1/1) ... [2018-12-02 04:22:29,448 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 04:22:29,470 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 04:22:29,612 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 04:22:29,616 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 04:22:29,650 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 04:22:29,699 INFO L195 MainTranslator]: Completed translation [2018-12-02 04:22:29,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:22:29 WrapperNode [2018-12-02 04:22:29,699 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 04:22:29,700 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 04:22:29,700 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 04:22:29,700 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 04:22:29,706 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:22:29" (1/1) ... [2018-12-02 04:22:29,714 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:22:29" (1/1) ... [2018-12-02 04:22:29,718 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 04:22:29,718 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 04:22:29,719 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 04:22:29,719 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 04:22:29,724 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:22:29" (1/1) ... [2018-12-02 04:22:29,724 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:22:29" (1/1) ... [2018-12-02 04:22:29,727 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:22:29" (1/1) ... [2018-12-02 04:22:29,727 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:22:29" (1/1) ... [2018-12-02 04:22:29,740 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:22:29" (1/1) ... [2018-12-02 04:22:29,745 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:22:29" (1/1) ... [2018-12-02 04:22:29,747 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:22:29" (1/1) ... [2018-12-02 04:22:29,749 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 04:22:29,749 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 04:22:29,749 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 04:22:29,749 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 04:22:29,749 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:22:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34bb83d7-369d-4d03-84cd-996c4ff53ea1/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 04:22:29,780 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 04:22:29,780 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 04:22:29,780 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_atan2 [2018-12-02 04:22:29,780 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_atan2 [2018-12-02 04:22:29,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-12-02 04:22:29,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 04:22:29,780 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_double [2018-12-02 04:22:29,780 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_double [2018-12-02 04:22:29,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 04:22:29,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 04:22:29,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-12-02 04:22:29,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 04:22:29,780 INFO L130 BoogieDeclarations]: Found specification of procedure atan_double [2018-12-02 04:22:29,781 INFO L138 BoogieDeclarations]: Found implementation of procedure atan_double [2018-12-02 04:22:29,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 04:22:29,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 04:22:29,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 04:22:29,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2018-12-02 04:22:29,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 04:22:30,077 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 04:22:30,077 INFO L280 CfgBuilder]: Removed 16 assue(true) statements. [2018-12-02 04:22:30,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:22:30 BoogieIcfgContainer [2018-12-02 04:22:30,077 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 04:22:30,078 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 04:22:30,078 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 04:22:30,080 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 04:22:30,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 04:22:29" (1/3) ... [2018-12-02 04:22:30,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68bd0b35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 04:22:30, skipping insertion in model container [2018-12-02 04:22:30,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:22:29" (2/3) ... [2018-12-02 04:22:30,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68bd0b35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 04:22:30, skipping insertion in model container [2018-12-02 04:22:30,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:22:30" (3/3) ... [2018-12-02 04:22:30,083 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0663b_true-unreach-call.c [2018-12-02 04:22:30,088 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 04:22:30,093 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 04:22:30,101 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 04:22:30,118 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 04:22:30,118 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 04:22:30,118 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 04:22:30,118 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 04:22:30,118 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 04:22:30,118 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 04:22:30,119 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 04:22:30,119 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 04:22:30,119 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 04:22:30,129 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2018-12-02 04:22:30,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-02 04:22:30,133 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:22:30,133 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:22:30,134 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:22:30,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:22:30,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1380022172, now seen corresponding path program 1 times [2018-12-02 04:22:30,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:22:30,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:22:30,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:22:30,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:22:30,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:22:30,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:22:30,244 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-02 04:22:30,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:22:30,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 04:22:30,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-02 04:22:30,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 04:22:30,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 04:22:30,256 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 2 states. [2018-12-02 04:22:30,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:22:30,275 INFO L93 Difference]: Finished difference Result 197 states and 314 transitions. [2018-12-02 04:22:30,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 04:22:30,276 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-12-02 04:22:30,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:22:30,282 INFO L225 Difference]: With dead ends: 197 [2018-12-02 04:22:30,282 INFO L226 Difference]: Without dead ends: 98 [2018-12-02 04:22:30,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 04:22:30,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-02 04:22:30,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-12-02 04:22:30,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-02 04:22:30,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 137 transitions. [2018-12-02 04:22:30,310 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 137 transitions. Word has length 19 [2018-12-02 04:22:30,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:22:30,310 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 137 transitions. [2018-12-02 04:22:30,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-02 04:22:30,311 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 137 transitions. [2018-12-02 04:22:30,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 04:22:30,311 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:22:30,311 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:22:30,311 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:22:30,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:22:30,312 INFO L82 PathProgramCache]: Analyzing trace with hash 959017453, now seen corresponding path program 1 times [2018-12-02 04:22:30,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:22:30,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:22:30,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:22:30,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:22:30,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:22:30,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:22:30,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:22:30,388 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 04:22:30,405 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 97 could not be translated for associated CType ARRAY#_11_~DOUBLE# [2018-12-02 04:22:30,406 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 108 could not be translated for associated CType ARRAY#_4_~DOUBLE# [2018-12-02 04:22:30,406 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 100 could not be translated for associated CType ARRAY#_4_~DOUBLE# [2018-12-02 04:22:30,406 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 119 could not be translated for associated CType ARRAY#_4_~DOUBLE# [2018-12-02 04:22:30,407 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 92 could not be translated for associated CType ARRAY#_4_~DOUBLE# [2018-12-02 04:22:30,407 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 104 could not be translated for associated CType ARRAY#_11_~DOUBLE# [2018-12-02 04:22:30,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 04:22:30 BoogieIcfgContainer [2018-12-02 04:22:30,415 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 04:22:30,415 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 04:22:30,415 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 04:22:30,415 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 04:22:30,415 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:22:30" (3/4) ... [2018-12-02 04:22:30,418 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 04:22:30,418 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 04:22:30,418 INFO L168 Benchmark]: Toolchain (without parser) took 984.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 956.0 MB in the beginning and 1.0 GB in the end (delta: -93.1 MB). Peak memory consumption was 52.1 MB. Max. memory is 11.5 GB. [2018-12-02 04:22:30,419 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 04:22:30,419 INFO L168 Benchmark]: CACSL2BoogieTranslator took 263.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -180.9 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2018-12-02 04:22:30,420 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-12-02 04:22:30,420 INFO L168 Benchmark]: Boogie Preprocessor took 30.17 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 04:22:30,420 INFO L168 Benchmark]: RCFGBuilder took 328.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 11.5 GB. [2018-12-02 04:22:30,421 INFO L168 Benchmark]: TraceAbstraction took 336.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 40.7 MB). Peak memory consumption was 40.7 MB. Max. memory is 11.5 GB. [2018-12-02 04:22:30,421 INFO L168 Benchmark]: Witness Printer took 2.83 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 04:22:30,423 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 263.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -180.9 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.17 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 328.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 336.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 40.7 MB). Peak memory consumption was 40.7 MB. Max. memory is 11.5 GB. * Witness Printer took 2.83 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 97 could not be translated for associated CType ARRAY#_11_~DOUBLE# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 108 could not be translated for associated CType ARRAY#_4_~DOUBLE# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 100 could not be translated for associated CType ARRAY#_4_~DOUBLE# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 119 could not be translated for associated CType ARRAY#_4_~DOUBLE# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 92 could not be translated for associated CType ARRAY#_4_~DOUBLE# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 104 could not be translated for associated CType ARRAY#_11_~DOUBLE# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 260]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 162, overapproximation of someUnaryDOUBLEoperation at line 52, overapproximation of bitwiseAnd at line 160, overapproximation of someBinaryArithmeticDOUBLEoperation at line 163, overapproximation of someBinaryDOUBLEComparisonOperation at line 259. Possible FailurePath: [L37-L42] static const double atanhi_atan[] = { 4.63647609000806093515e-01, 7.85398163397448278999e-01, 9.82793723247329054082e-01, 1.57079632679489655800e+00, }; [L44-L49] static const double atanlo_atan[] = { 2.26987774529616870924e-17, 3.06161699786838301793e-17, 1.39033110312309984516e-17, 6.12323399573676603587e-17, }; [L51-L58] static const double aT_atan[] = { 3.33333333333329318027e-01, -1.99999999998764832476e-01, 1.42857142725034663711e-01, -1.11111104054623557880e-01, 9.09088713343650656196e-02, -7.69187620504482999495e-02, 6.66107313738753120669e-02, -5.83357013379057348645e-02, 4.97687799461593236017e-02, -3.65315727442169155270e-02, 1.62858201153657823623e-02, }; [L60-L62] static const double one_atan = 1.0, pi_o_4 = 7.8539816339744827900E-01, pi_o_2 = 1.5707963267948965580E+00, pi = 3.1415926535897931160E+00, huge_atan = 1.0e300; [L139-L140] static const double tiny_atan2 = 1.0e-300, zero_atan2 = 0.0, pi_lo_atan2 = 1.2246467991473531772E-16; VAL [\old(aT_atan)=null, \old(aT_atan)=null, \old(atanhi_atan)=null, \old(atanhi_atan)=null, \old(atanlo_atan)=null, \old(atanlo_atan)=null, \old(huge_atan)=116, \old(one_atan)=105, \old(pi)=111, \old(pi_lo_atan2)=103, \old(pi_o_2)=89, \old(pi_o_4)=107, \old(tiny_atan2)=118, \old(zero_atan2)=96, aT_atan={99:0}, atanhi_atan={101:0}, atanlo_atan={90:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L251] double x = 0.0; [L252] double y = __VERIFIER_nondet_double(); [L254] COND TRUE y > 0.0 VAL [aT_atan={99:0}, atanhi_atan={101:0}, atanlo_atan={90:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0, y=117, zero_atan2=0] [L256] CALL, EXPR __ieee754_atan2(y, x) VAL [\old(x)=0, \old(y)=117, aT_atan={99:0}, atanhi_atan={101:0}, atanlo_atan={90:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L143] double z; [L144] __int32_t k, m, hx, hy, ix, iy; [L145] __uint32_t lx, ly; VAL [\old(x)=0, \old(y)=117, aT_atan={99:0}, atanhi_atan={101:0}, atanlo_atan={90:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0, y=117, zero_atan2=0] [L148] ieee_double_shape_type ew_u; [L149] ew_u.value = (x) [L150] EXPR ew_u.parts.msw [L150] (hx) = ew_u.parts.msw [L151] EXPR ew_u.parts.lsw [L151] (lx) = ew_u.parts.lsw [L153] ix = hx & 0x7fffffff VAL [\old(x)=0, \old(y)=117, aT_atan={99:0}, atanhi_atan={101:0}, atanlo_atan={90:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=5, lx=112, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0, y=117, zero_atan2=0] [L155] ieee_double_shape_type ew_u; [L156] ew_u.value = (y) [L157] EXPR ew_u.parts.msw [L157] (hy) = ew_u.parts.msw [L158] EXPR ew_u.parts.lsw [L158] (ly) = ew_u.parts.lsw [L160] iy = hy & 0x7fffffff VAL [\old(x)=0, \old(y)=117, aT_atan={99:0}, atanhi_atan={101:0}, atanlo_atan={90:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=5, hy=2, lx=112, ly=93, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0, y=117, zero_atan2=0] [L161-L162] COND TRUE ((ix | ((lx | -lx) >> 31)) > 0x7ff00000) || ((iy | ((ly | -ly) >> 31)) > 0x7ff00000) [L163] return x + y; VAL [\old(x)=0, \old(y)=117, aT_atan={99:0}, atanhi_atan={101:0}, atanlo_atan={90:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=5, hy=2, lx=112, ly=93, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0, y=117, zero_atan2=0] [L256] RET, EXPR __ieee754_atan2(y, x) VAL [__ieee754_atan2(y, x)=110, aT_atan={99:0}, atanhi_atan={101:0}, atanlo_atan={90:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0, y=117, zero_atan2=0] [L256] double res = __ieee754_atan2(y, x); [L259] COND TRUE res != pi_o_2 VAL [aT_atan={99:0}, atanhi_atan={101:0}, atanlo_atan={90:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, res=110, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0, y=117, zero_atan2=0] [L260] __VERIFIER_error() VAL [aT_atan={99:0}, atanhi_atan={101:0}, atanlo_atan={90:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, res=110, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0, y=117, zero_atan2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 103 locations, 1 error locations. UNSAFE Result, 0.3s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 143 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 40 NumberOfCodeBlocks, 40 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 18 ConstructedInterpolants, 0 QuantifiedInterpolants, 324 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-02 04:22:31,665 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 04:22:31,666 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 04:22:31,675 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 04:22:31,675 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 04:22:31,676 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 04:22:31,677 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 04:22:31,678 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 04:22:31,679 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 04:22:31,680 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 04:22:31,680 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 04:22:31,680 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 04:22:31,681 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 04:22:31,682 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 04:22:31,682 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 04:22:31,683 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 04:22:31,683 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 04:22:31,685 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 04:22:31,686 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 04:22:31,687 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 04:22:31,688 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 04:22:31,689 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 04:22:31,690 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 04:22:31,690 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 04:22:31,691 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 04:22:31,691 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 04:22:31,692 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 04:22:31,692 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 04:22:31,693 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 04:22:31,694 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 04:22:31,694 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 04:22:31,694 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 04:22:31,695 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 04:22:31,695 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 04:22:31,695 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 04:22:31,696 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 04:22:31,696 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_34bb83d7-369d-4d03-84cd-996c4ff53ea1/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-12-02 04:22:31,706 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 04:22:31,706 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 04:22:31,707 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 04:22:31,707 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 04:22:31,707 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 04:22:31,707 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 04:22:31,707 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 04:22:31,708 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 04:22:31,708 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 04:22:31,708 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 04:22:31,708 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 04:22:31,708 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 04:22:31,708 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 04:22:31,708 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 04:22:31,709 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-02 04:22:31,709 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-02 04:22:31,709 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 04:22:31,709 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 04:22:31,709 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 04:22:31,709 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 04:22:31,709 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 04:22:31,709 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 04:22:31,710 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 04:22:31,710 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 04:22:31,710 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 04:22:31,710 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 04:22:31,710 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 04:22:31,710 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 04:22:31,710 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-12-02 04:22:31,710 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 04:22:31,711 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-02 04:22:31,711 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-02 04:22:31,711 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_34bb83d7-369d-4d03-84cd-996c4ff53ea1/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0cca6d33f0772631e27f925c9516a89b4af2326a [2018-12-02 04:22:31,734 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 04:22:31,743 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 04:22:31,746 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 04:22:31,747 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 04:22:31,748 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 04:22:31,748 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_34bb83d7-369d-4d03-84cd-996c4ff53ea1/bin-2019/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_0663b_true-unreach-call.c [2018-12-02 04:22:31,783 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_34bb83d7-369d-4d03-84cd-996c4ff53ea1/bin-2019/uautomizer/data/e59757747/812ff86b71fb4d2fbca9ca94465a36f4/FLAGc578e2e69 [2018-12-02 04:22:32,118 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 04:22:32,118 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_34bb83d7-369d-4d03-84cd-996c4ff53ea1/sv-benchmarks/c/float-newlib/double_req_bl_0663b_true-unreach-call.c [2018-12-02 04:22:32,123 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_34bb83d7-369d-4d03-84cd-996c4ff53ea1/bin-2019/uautomizer/data/e59757747/812ff86b71fb4d2fbca9ca94465a36f4/FLAGc578e2e69 [2018-12-02 04:22:32,521 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_34bb83d7-369d-4d03-84cd-996c4ff53ea1/bin-2019/uautomizer/data/e59757747/812ff86b71fb4d2fbca9ca94465a36f4 [2018-12-02 04:22:32,524 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 04:22:32,525 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 04:22:32,526 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 04:22:32,526 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 04:22:32,528 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 04:22:32,529 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:22:32" (1/1) ... [2018-12-02 04:22:32,531 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b97ddff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:22:32, skipping insertion in model container [2018-12-02 04:22:32,531 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:22:32" (1/1) ... [2018-12-02 04:22:32,535 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 04:22:32,549 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 04:22:32,668 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 04:22:32,674 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 04:22:32,708 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 04:22:32,727 INFO L195 MainTranslator]: Completed translation [2018-12-02 04:22:32,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:22:32 WrapperNode [2018-12-02 04:22:32,727 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 04:22:32,728 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 04:22:32,728 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 04:22:32,728 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 04:22:32,732 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:22:32" (1/1) ... [2018-12-02 04:22:32,770 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:22:32" (1/1) ... [2018-12-02 04:22:32,775 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 04:22:32,775 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 04:22:32,775 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 04:22:32,775 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 04:22:32,781 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:22:32" (1/1) ... [2018-12-02 04:22:32,781 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:22:32" (1/1) ... [2018-12-02 04:22:32,784 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:22:32" (1/1) ... [2018-12-02 04:22:32,784 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:22:32" (1/1) ... [2018-12-02 04:22:32,798 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:22:32" (1/1) ... [2018-12-02 04:22:32,803 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:22:32" (1/1) ... [2018-12-02 04:22:32,805 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:22:32" (1/1) ... [2018-12-02 04:22:32,807 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 04:22:32,807 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 04:22:32,807 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 04:22:32,808 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 04:22:32,808 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:22:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34bb83d7-369d-4d03-84cd-996c4ff53ea1/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 04:22:32,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-12-02 04:22:32,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-12-02 04:22:32,838 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 04:22:32,838 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 04:22:32,838 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_atan2 [2018-12-02 04:22:32,838 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_atan2 [2018-12-02 04:22:32,839 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_double [2018-12-02 04:22:32,839 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_double [2018-12-02 04:22:32,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 04:22:32,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 04:22:32,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2018-12-02 04:22:32,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 04:22:32,839 INFO L130 BoogieDeclarations]: Found specification of procedure atan_double [2018-12-02 04:22:32,839 INFO L138 BoogieDeclarations]: Found implementation of procedure atan_double [2018-12-02 04:22:32,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-02 04:22:32,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 04:22:32,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 04:22:32,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-02 04:22:32,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 04:22:33,409 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:22:33,593 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:22:33,663 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:22:33,692 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:22:34,638 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:22:34,654 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:22:34,693 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:22:34,714 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:22:39,731 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:22:50,951 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 04:22:50,952 INFO L280 CfgBuilder]: Removed 16 assue(true) statements. [2018-12-02 04:22:50,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:22:50 BoogieIcfgContainer [2018-12-02 04:22:50,952 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 04:22:50,953 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 04:22:50,953 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 04:22:50,955 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 04:22:50,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 04:22:32" (1/3) ... [2018-12-02 04:22:50,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1921e755 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 04:22:50, skipping insertion in model container [2018-12-02 04:22:50,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:22:32" (2/3) ... [2018-12-02 04:22:50,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1921e755 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 04:22:50, skipping insertion in model container [2018-12-02 04:22:50,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:22:50" (3/3) ... [2018-12-02 04:22:50,957 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0663b_true-unreach-call.c [2018-12-02 04:22:50,963 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 04:22:50,968 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 04:22:50,978 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 04:22:50,995 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 04:22:50,995 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 04:22:50,995 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 04:22:50,996 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 04:22:50,996 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 04:22:50,996 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 04:22:50,996 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 04:22:50,996 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 04:22:50,996 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 04:22:51,006 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2018-12-02 04:22:51,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-02 04:22:51,009 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:22:51,010 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:22:51,011 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:22:51,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:22:51,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1380022172, now seen corresponding path program 1 times [2018-12-02 04:22:51,017 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-02 04:22:51,017 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34bb83d7-369d-4d03-84cd-996c4ff53ea1/bin-2019/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-12-02 04:22:51,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:22:51,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:22:51,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:22:51,241 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-02 04:22:51,241 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 04:22:51,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:22:51,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 04:22:51,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-02 04:22:51,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 04:22:51,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 04:22:51,265 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 2 states. [2018-12-02 04:22:51,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:22:51,284 INFO L93 Difference]: Finished difference Result 197 states and 314 transitions. [2018-12-02 04:22:51,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 04:22:51,285 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-12-02 04:22:51,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:22:51,294 INFO L225 Difference]: With dead ends: 197 [2018-12-02 04:22:51,294 INFO L226 Difference]: Without dead ends: 98 [2018-12-02 04:22:51,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 04:22:51,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-02 04:22:51,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-12-02 04:22:51,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-02 04:22:51,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 137 transitions. [2018-12-02 04:22:51,332 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 137 transitions. Word has length 19 [2018-12-02 04:22:51,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:22:51,332 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 137 transitions. [2018-12-02 04:22:51,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-02 04:22:51,332 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 137 transitions. [2018-12-02 04:22:51,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 04:22:51,333 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:22:51,333 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:22:51,333 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:22:51,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:22:51,333 INFO L82 PathProgramCache]: Analyzing trace with hash 959017453, now seen corresponding path program 1 times [2018-12-02 04:22:51,334 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-02 04:22:51,334 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34bb83d7-369d-4d03-84cd-996c4ff53ea1/bin-2019/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-12-02 04:22:51,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:22:51,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:22:51,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:22:51,831 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 04:22:51,833 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 04:22:51,834 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 04:22:51,835 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 04:22:51,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 98 [2018-12-02 04:22:51,960 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 04:22:51,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 68 [2018-12-02 04:22:52,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-12-02 04:22:52,070 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 04:22:52,111 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:22:52,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-12-02 04:22:52,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 4 [2018-12-02 04:22:52,174 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 04:22:52,180 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:22:52,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-12-02 04:22:52,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 5 [2018-12-02 04:22:52,219 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 04:22:52,224 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:22:52,235 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:22:52,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 04:22:52,265 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:97, output treesize:38 [2018-12-02 04:22:52,560 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-02 04:22:52,560 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 04:22:52,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:22:52,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 04:22:52,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 04:22:52,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 04:22:52,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-12-02 04:22:52,573 INFO L87 Difference]: Start difference. First operand 98 states and 137 transitions. Second operand 10 states. [2018-12-02 04:22:54,037 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2018-12-02 04:22:58,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:22:58,710 INFO L93 Difference]: Finished difference Result 123 states and 171 transitions. [2018-12-02 04:22:58,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 04:22:58,711 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-12-02 04:22:58,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:22:58,712 INFO L225 Difference]: With dead ends: 123 [2018-12-02 04:22:58,713 INFO L226 Difference]: Without dead ends: 87 [2018-12-02 04:22:58,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-12-02 04:22:58,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-02 04:22:58,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-12-02 04:22:58,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-02 04:22:58,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 115 transitions. [2018-12-02 04:22:58,723 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 115 transitions. Word has length 21 [2018-12-02 04:22:58,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:22:58,723 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 115 transitions. [2018-12-02 04:22:58,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 04:22:58,723 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 115 transitions. [2018-12-02 04:22:58,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 04:22:58,724 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:22:58,724 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:22:58,724 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:22:58,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:22:58,724 INFO L82 PathProgramCache]: Analyzing trace with hash -322982793, now seen corresponding path program 1 times [2018-12-02 04:22:58,724 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-02 04:22:58,724 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34bb83d7-369d-4d03-84cd-996c4ff53ea1/bin-2019/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-12-02 04:22:58,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:22:58,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:22:58,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:22:58,998 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 04:22:58,999 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 04:22:59,002 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 04:22:59,003 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 04:22:59,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 85 [2018-12-02 04:22:59,111 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2018-12-02 04:22:59,111 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:22:59,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2018-12-02 04:22:59,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2018-12-02 04:22:59,147 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 04:22:59,161 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:22:59,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-12-02 04:22:59,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-12-02 04:22:59,177 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 04:22:59,178 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:22:59,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:22:59,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 04:22:59,203 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:71, output treesize:27 [2018-12-02 04:22:59,320 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-02 04:22:59,320 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 04:22:59,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:22:59,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 04:22:59,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 04:22:59,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 04:22:59,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 04:22:59,337 INFO L87 Difference]: Start difference. First operand 87 states and 115 transitions. Second operand 7 states. [2018-12-02 04:23:02,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:23:02,259 INFO L93 Difference]: Finished difference Result 118 states and 157 transitions. [2018-12-02 04:23:02,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 04:23:02,261 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-12-02 04:23:02,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:23:02,261 INFO L225 Difference]: With dead ends: 118 [2018-12-02 04:23:02,262 INFO L226 Difference]: Without dead ends: 81 [2018-12-02 04:23:02,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-12-02 04:23:02,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-02 04:23:02,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-12-02 04:23:02,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-02 04:23:02,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 104 transitions. [2018-12-02 04:23:02,269 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 104 transitions. Word has length 26 [2018-12-02 04:23:02,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:23:02,270 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 104 transitions. [2018-12-02 04:23:02,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 04:23:02,270 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 104 transitions. [2018-12-02 04:23:02,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 04:23:02,270 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:23:02,271 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:23:02,271 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:23:02,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:23:02,271 INFO L82 PathProgramCache]: Analyzing trace with hash -442139595, now seen corresponding path program 1 times [2018-12-02 04:23:02,271 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-02 04:23:02,272 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34bb83d7-369d-4d03-84cd-996c4ff53ea1/bin-2019/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-12-02 04:23:02,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:23:02,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:23:02,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:23:02,546 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-02 04:23:02,546 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 04:23:02,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:23:02,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 04:23:02,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 04:23:02,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 04:23:02,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 04:23:02,557 INFO L87 Difference]: Start difference. First operand 81 states and 104 transitions. Second operand 6 states. [2018-12-02 04:23:05,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:23:05,314 INFO L93 Difference]: Finished difference Result 89 states and 111 transitions. [2018-12-02 04:23:05,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 04:23:05,315 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-12-02 04:23:05,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:23:05,316 INFO L225 Difference]: With dead ends: 89 [2018-12-02 04:23:05,316 INFO L226 Difference]: Without dead ends: 81 [2018-12-02 04:23:05,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 04:23:05,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-02 04:23:05,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-12-02 04:23:05,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-02 04:23:05,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 102 transitions. [2018-12-02 04:23:05,324 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 102 transitions. Word has length 26 [2018-12-02 04:23:05,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:23:05,324 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 102 transitions. [2018-12-02 04:23:05,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 04:23:05,324 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 102 transitions. [2018-12-02 04:23:05,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 04:23:05,325 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:23:05,325 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:23:05,325 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:23:05,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:23:05,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1332867767, now seen corresponding path program 1 times [2018-12-02 04:23:05,326 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-02 04:23:05,326 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34bb83d7-369d-4d03-84cd-996c4ff53ea1/bin-2019/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-12-02 04:23:05,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:23:05,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:23:05,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:23:06,090 WARN L180 SmtUtils]: Spent 364.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-12-02 04:23:06,442 WARN L180 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-12-02 04:23:06,572 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-12-02 04:23:07,014 WARN L180 SmtUtils]: Spent 356.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-12-02 04:23:07,016 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-02 04:23:07,016 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 04:23:07,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:23:07,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 04:23:07,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 04:23:07,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 04:23:07,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 04:23:07,027 INFO L87 Difference]: Start difference. First operand 81 states and 102 transitions. Second operand 7 states. [2018-12-02 04:23:08,086 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-12-02 04:23:08,474 WARN L180 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-12-02 04:23:12,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:23:12,369 INFO L93 Difference]: Finished difference Result 87 states and 107 transitions. [2018-12-02 04:23:12,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 04:23:12,369 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-12-02 04:23:12,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:23:12,370 INFO L225 Difference]: With dead ends: 87 [2018-12-02 04:23:12,370 INFO L226 Difference]: Without dead ends: 79 [2018-12-02 04:23:12,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-02 04:23:12,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-02 04:23:12,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-12-02 04:23:12,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-02 04:23:12,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 99 transitions. [2018-12-02 04:23:12,379 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 99 transitions. Word has length 26 [2018-12-02 04:23:12,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:23:12,379 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 99 transitions. [2018-12-02 04:23:12,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 04:23:12,379 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 99 transitions. [2018-12-02 04:23:12,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 04:23:12,379 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:23:12,380 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:23:12,380 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:23:12,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:23:12,380 INFO L82 PathProgramCache]: Analyzing trace with hash 759779339, now seen corresponding path program 1 times [2018-12-02 04:23:12,380 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-02 04:23:12,380 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34bb83d7-369d-4d03-84cd-996c4ff53ea1/bin-2019/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-12-02 04:23:12,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:23:12,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:23:12,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:23:12,855 WARN L180 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-12-02 04:23:13,263 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-12-02 04:23:13,732 WARN L180 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-12-02 04:23:13,736 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-02 04:23:13,736 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 04:23:13,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:23:13,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 04:23:13,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 04:23:13,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 04:23:13,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 04:23:13,747 INFO L87 Difference]: Start difference. First operand 79 states and 99 transitions. Second operand 7 states. [2018-12-02 04:23:17,362 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-12-02 04:23:17,944 WARN L180 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-12-02 04:23:21,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:23:21,719 INFO L93 Difference]: Finished difference Result 85 states and 104 transitions. [2018-12-02 04:23:21,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 04:23:21,720 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-12-02 04:23:21,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:23:21,721 INFO L225 Difference]: With dead ends: 85 [2018-12-02 04:23:21,721 INFO L226 Difference]: Without dead ends: 77 [2018-12-02 04:23:21,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-02 04:23:21,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-02 04:23:21,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-12-02 04:23:21,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-02 04:23:21,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 96 transitions. [2018-12-02 04:23:21,727 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 96 transitions. Word has length 28 [2018-12-02 04:23:21,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:23:21,728 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 96 transitions. [2018-12-02 04:23:21,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 04:23:21,728 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 96 transitions. [2018-12-02 04:23:21,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 04:23:21,728 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:23:21,728 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:23:21,728 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:23:21,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:23:21,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1854768899, now seen corresponding path program 1 times [2018-12-02 04:23:21,729 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-02 04:23:21,729 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34bb83d7-369d-4d03-84cd-996c4ff53ea1/bin-2019/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-12-02 04:23:21,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:23:21,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:23:22,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:23:22,680 WARN L180 SmtUtils]: Spent 640.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-02 04:23:23,892 WARN L180 SmtUtils]: Spent 1.04 s on a formula simplification that was a NOOP. DAG size: 16 [2018-12-02 04:23:24,171 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-02 04:23:24,290 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-02 04:23:24,293 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-02 04:23:24,293 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 04:23:24,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:23:24,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 04:23:24,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 04:23:24,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 04:23:24,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 04:23:24,305 INFO L87 Difference]: Start difference. First operand 77 states and 96 transitions. Second operand 7 states. [2018-12-02 04:23:26,851 WARN L180 SmtUtils]: Spent 1.56 s on a formula simplification that was a NOOP. DAG size: 18 [2018-12-02 04:23:30,099 WARN L180 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-02 04:23:30,823 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-02 04:23:36,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:23:36,500 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2018-12-02 04:23:36,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 04:23:36,501 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-12-02 04:23:36,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:23:36,503 INFO L225 Difference]: With dead ends: 94 [2018-12-02 04:23:36,503 INFO L226 Difference]: Without dead ends: 88 [2018-12-02 04:23:36,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-12-02 04:23:36,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-02 04:23:36,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 79. [2018-12-02 04:23:36,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-02 04:23:36,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 98 transitions. [2018-12-02 04:23:36,516 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 98 transitions. Word has length 29 [2018-12-02 04:23:36,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:23:36,516 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 98 transitions. [2018-12-02 04:23:36,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 04:23:36,516 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 98 transitions. [2018-12-02 04:23:36,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 04:23:36,517 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:23:36,517 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:23:36,517 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:23:36,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:23:36,517 INFO L82 PathProgramCache]: Analyzing trace with hash 89007903, now seen corresponding path program 1 times [2018-12-02 04:23:36,517 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-02 04:23:36,518 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34bb83d7-369d-4d03-84cd-996c4ff53ea1/bin-2019/uautomizer/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-12-02 04:23:36,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:23:36,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:23:36,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:23:36,726 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-02 04:23:36,726 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 04:23:36,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:23:36,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 04:23:36,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 04:23:36,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 04:23:36,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 04:23:36,736 INFO L87 Difference]: Start difference. First operand 79 states and 98 transitions. Second operand 6 states. [2018-12-02 04:23:38,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:23:38,761 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2018-12-02 04:23:38,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 04:23:38,761 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-12-02 04:23:38,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:23:38,762 INFO L225 Difference]: With dead ends: 96 [2018-12-02 04:23:38,762 INFO L226 Difference]: Without dead ends: 79 [2018-12-02 04:23:38,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 04:23:38,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-02 04:23:38,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-12-02 04:23:38,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-02 04:23:38,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 97 transitions. [2018-12-02 04:23:38,772 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 97 transitions. Word has length 30 [2018-12-02 04:23:38,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:23:38,773 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 97 transitions. [2018-12-02 04:23:38,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 04:23:38,773 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2018-12-02 04:23:38,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-02 04:23:38,774 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:23:38,774 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:23:38,774 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:23:38,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:23:38,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1404759961, now seen corresponding path program 1 times [2018-12-02 04:23:38,775 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-02 04:23:38,775 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34bb83d7-369d-4d03-84cd-996c4ff53ea1/bin-2019/uautomizer/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2018-12-02 04:23:38,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:23:39,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:23:39,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:23:39,571 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-02 04:23:39,571 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 04:23:39,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:23:39,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 04:23:39,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 04:23:39,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 04:23:39,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-12-02 04:23:39,584 INFO L87 Difference]: Start difference. First operand 79 states and 97 transitions. Second operand 10 states. [2018-12-02 04:23:40,641 WARN L180 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2018-12-02 04:23:41,105 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2018-12-02 04:23:43,238 WARN L180 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2018-12-02 04:23:48,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:23:48,533 INFO L93 Difference]: Finished difference Result 87 states and 104 transitions. [2018-12-02 04:23:48,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 04:23:48,535 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-12-02 04:23:48,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:23:48,535 INFO L225 Difference]: With dead ends: 87 [2018-12-02 04:23:48,535 INFO L226 Difference]: Without dead ends: 70 [2018-12-02 04:23:48,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-12-02 04:23:48,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-02 04:23:48,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2018-12-02 04:23:48,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-02 04:23:48,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 81 transitions. [2018-12-02 04:23:48,542 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 81 transitions. Word has length 31 [2018-12-02 04:23:48,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:23:48,543 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 81 transitions. [2018-12-02 04:23:48,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 04:23:48,543 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2018-12-02 04:23:48,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-02 04:23:48,543 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:23:48,543 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:23:48,543 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:23:48,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:23:48,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1356254058, now seen corresponding path program 1 times [2018-12-02 04:23:48,544 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-02 04:23:48,544 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34bb83d7-369d-4d03-84cd-996c4ff53ea1/bin-2019/uautomizer/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-02 04:23:48,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:23:48,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:23:48,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:23:48,823 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-02 04:23:48,823 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 04:23:48,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:23:48,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 04:23:48,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 04:23:48,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 04:23:48,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 04:23:48,835 INFO L87 Difference]: Start difference. First operand 68 states and 81 transitions. Second operand 6 states. [2018-12-02 04:23:49,066 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-12-02 04:23:51,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:23:51,087 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2018-12-02 04:23:51,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 04:23:51,089 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-12-02 04:23:51,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:23:51,089 INFO L225 Difference]: With dead ends: 74 [2018-12-02 04:23:51,089 INFO L226 Difference]: Without dead ends: 66 [2018-12-02 04:23:51,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 04:23:51,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-02 04:23:51,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-02 04:23:51,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-02 04:23:51,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2018-12-02 04:23:51,096 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 34 [2018-12-02 04:23:51,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:23:51,096 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 77 transitions. [2018-12-02 04:23:51,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 04:23:51,096 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2018-12-02 04:23:51,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-02 04:23:51,097 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:23:51,097 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:23:51,097 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:23:51,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:23:51,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1205883235, now seen corresponding path program 1 times [2018-12-02 04:23:51,097 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-02 04:23:51,097 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34bb83d7-369d-4d03-84cd-996c4ff53ea1/bin-2019/uautomizer/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2018-12-02 04:23:51,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:23:51,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:23:51,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:23:52,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-12-02 04:23:52,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-12-02 04:23:52,028 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 04:23:52,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 04:23:52,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 04:23:52,043 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:64, output treesize:34 [2018-12-02 04:24:07,749 WARN L180 SmtUtils]: Spent 2.16 s on a formula simplification that was a NOOP. DAG size: 23 [2018-12-02 04:24:20,267 WARN L832 $PredicateComparison]: unable to prove that (exists ((v_prenex_60 (_ BitVec 64)) (v_arrayElimCell_8 (_ BitVec 32)) (|v_q#valueAsBitvector_18| (_ BitVec 64)) (__ieee754_atan2_~y (_ FloatingPoint 11 53))) (and (= (let ((.cse0 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_18|)) v_arrayElimCell_8))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp ((_ extract 63 63) v_prenex_60) ((_ extract 62 52) v_prenex_60) ((_ extract 51 0) v_prenex_60))) (not (bvsge (bvand (_ bv2147483647 32) ((_ extract 63 32) v_prenex_60)) (_ bv1141899264 32))) (= (fp.div roundNearestTiesToEven __ieee754_atan2_~y |c___ieee754_atan2_#in~x|) (fp ((_ extract 63 63) |v_q#valueAsBitvector_18|) ((_ extract 62 52) |v_q#valueAsBitvector_18|) ((_ extract 51 0) |v_q#valueAsBitvector_18|))))) is different from false [2018-12-02 04:24:20,287 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-02 04:24:20,287 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 04:24:20,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:24:20,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-02 04:24:20,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 04:24:20,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 04:24:20,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=127, Unknown=8, NotChecked=22, Total=182 [2018-12-02 04:24:20,306 INFO L87 Difference]: Start difference. First operand 66 states and 77 transitions. Second operand 14 states. [2018-12-02 04:24:31,814 WARN L832 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_8 (_ BitVec 32)) (|v_q#valueAsBitvector_18| (_ BitVec 64)) (__ieee754_atan2_~y (_ FloatingPoint 11 53))) (and (= |c___ieee754_atan2_#t~ret41| (let ((.cse0 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_18|)) v_arrayElimCell_8))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0)))) (= (fp.div roundNearestTiesToEven __ieee754_atan2_~y |c___ieee754_atan2_#in~x|) (fp ((_ extract 63 63) |v_q#valueAsBitvector_18|) ((_ extract 62 52) |v_q#valueAsBitvector_18|) ((_ extract 51 0) |v_q#valueAsBitvector_18|))))) (= c___ieee754_atan2_~x |c___ieee754_atan2_#in~x|)) is different from false [2018-12-02 04:24:52,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:24:52,425 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2018-12-02 04:24:52,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 04:24:52,739 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 51 [2018-12-02 04:24:52,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:24:52,739 INFO L225 Difference]: With dead ends: 81 [2018-12-02 04:24:52,740 INFO L226 Difference]: Without dead ends: 70 [2018-12-02 04:24:52,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 32.2s TimeCoverageRelationStatistics Valid=65, Invalid=314, Unknown=9, NotChecked=74, Total=462 [2018-12-02 04:24:52,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-02 04:24:52,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2018-12-02 04:24:52,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-02 04:24:52,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2018-12-02 04:24:52,752 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 51 [2018-12-02 04:24:52,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:24:52,754 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2018-12-02 04:24:52,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 04:24:52,754 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2018-12-02 04:24:52,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-02 04:24:52,755 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:24:52,755 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:24:52,755 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:24:52,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:24:52,756 INFO L82 PathProgramCache]: Analyzing trace with hash -757299736, now seen corresponding path program 1 times [2018-12-02 04:24:52,756 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-02 04:24:52,756 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34bb83d7-369d-4d03-84cd-996c4ff53ea1/bin-2019/uautomizer/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-02 04:24:52,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:24:53,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:24:53,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:24:54,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 60 [2018-12-02 04:24:54,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 55 [2018-12-02 04:24:54,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2018-12-02 04:24:54,424 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 04:24:54,428 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:24:54,432 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:24:54,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 04:24:54,448 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:85, output treesize:46 [2018-12-02 04:24:56,974 WARN L832 $PredicateComparison]: unable to prove that (and (exists ((|v_q#valueAsBitvector_22| (_ BitVec 64)) (|v_q#valueAsBitvector_21| (_ BitVec 64))) (let ((.cse0 (fp.div roundNearestTiesToEven |c___ieee754_atan2_#in~y| |c___ieee754_atan2_#in~x|))) (and (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_22|) ((_ extract 62 52) |v_q#valueAsBitvector_22|) ((_ extract 51 0) |v_q#valueAsBitvector_22|)) .cse0) (= .cse0 (fp ((_ extract 63 63) |v_q#valueAsBitvector_21|) ((_ extract 62 52) |v_q#valueAsBitvector_21|) ((_ extract 51 0) |v_q#valueAsBitvector_21|))) (= |c___ieee754_atan2_#t~ret41| (let ((.cse1 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_21|)) ((_ extract 31 0) |v_q#valueAsBitvector_22|)))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))))))) (exists ((|v_q#valueAsBitvector_20| (_ BitVec 64)) (|v_q#valueAsBitvector_19| (_ BitVec 64))) (and (= |c___ieee754_atan2_#in~y| (fp ((_ extract 63 63) |v_q#valueAsBitvector_20|) ((_ extract 62 52) |v_q#valueAsBitvector_20|) ((_ extract 51 0) |v_q#valueAsBitvector_20|))) (not (bvsgt (bvashr (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_20|)) (bvneg (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_19|)))) (_ bv20 32)) (_ bv60 32))) (= |c___ieee754_atan2_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_19|) ((_ extract 62 52) |v_q#valueAsBitvector_19|) ((_ extract 51 0) |v_q#valueAsBitvector_19|)))))) is different from false [2018-12-02 04:25:03,950 WARN L832 $PredicateComparison]: unable to prove that (exists ((|v_q#valueAsBitvector_22| (_ BitVec 64)) (|v_q#valueAsBitvector_21| (_ BitVec 64)) (|v_q#valueAsBitvector_20| (_ BitVec 64)) (|v_q#valueAsBitvector_19| (_ BitVec 64))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp ((_ extract 63 63) |v_q#valueAsBitvector_20|) ((_ extract 62 52) |v_q#valueAsBitvector_20|) ((_ extract 51 0) |v_q#valueAsBitvector_20|)) (fp ((_ extract 63 63) |v_q#valueAsBitvector_19|) ((_ extract 62 52) |v_q#valueAsBitvector_19|) ((_ extract 51 0) |v_q#valueAsBitvector_19|))))) (and (not (bvsgt (bvashr (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_20|)) (bvneg (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_19|)))) (_ bv20 32)) (_ bv60 32))) (= .cse0 (fp ((_ extract 63 63) |v_q#valueAsBitvector_22|) ((_ extract 62 52) |v_q#valueAsBitvector_22|) ((_ extract 51 0) |v_q#valueAsBitvector_22|))) (= .cse0 (fp ((_ extract 63 63) |v_q#valueAsBitvector_21|) ((_ extract 62 52) |v_q#valueAsBitvector_21|) ((_ extract 51 0) |v_q#valueAsBitvector_21|)))))) is different from false [2018-12-02 04:25:06,228 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_q#valueAsBitvector_22| (_ BitVec 64)) (|v_q#valueAsBitvector_21| (_ BitVec 64)) (|v_q#valueAsBitvector_20| (_ BitVec 64)) (|v_q#valueAsBitvector_19| (_ BitVec 64))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp ((_ extract 63 63) |v_q#valueAsBitvector_20|) ((_ extract 62 52) |v_q#valueAsBitvector_20|) ((_ extract 51 0) |v_q#valueAsBitvector_20|)) (fp ((_ extract 63 63) |v_q#valueAsBitvector_19|) ((_ extract 62 52) |v_q#valueAsBitvector_19|) ((_ extract 51 0) |v_q#valueAsBitvector_19|))))) (and (not (bvsgt (bvashr (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_20|)) (bvneg (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_19|)))) (_ bv20 32)) (_ bv60 32))) (= .cse0 (fp ((_ extract 63 63) |v_q#valueAsBitvector_22|) ((_ extract 62 52) |v_q#valueAsBitvector_22|) ((_ extract 51 0) |v_q#valueAsBitvector_22|))) (= .cse0 (fp ((_ extract 63 63) |v_q#valueAsBitvector_21|) ((_ extract 62 52) |v_q#valueAsBitvector_21|) ((_ extract 51 0) |v_q#valueAsBitvector_21|)))))) is different from true [2018-12-02 04:25:13,209 WARN L832 $PredicateComparison]: unable to prove that (and (= c_atan_double_~x |c_atan_double_#in~x|) (exists ((|v_q#valueAsBitvector_22| (_ BitVec 64)) (|v_q#valueAsBitvector_21| (_ BitVec 64)) (|v_q#valueAsBitvector_20| (_ BitVec 64)) (|v_q#valueAsBitvector_19| (_ BitVec 64))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp ((_ extract 63 63) |v_q#valueAsBitvector_20|) ((_ extract 62 52) |v_q#valueAsBitvector_20|) ((_ extract 51 0) |v_q#valueAsBitvector_20|)) (fp ((_ extract 63 63) |v_q#valueAsBitvector_19|) ((_ extract 62 52) |v_q#valueAsBitvector_19|) ((_ extract 51 0) |v_q#valueAsBitvector_19|))))) (and (not (bvsgt (bvashr (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_20|)) (bvneg (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_19|)))) (_ bv20 32)) (_ bv60 32))) (= .cse0 (fp ((_ extract 63 63) |v_q#valueAsBitvector_22|) ((_ extract 62 52) |v_q#valueAsBitvector_22|) ((_ extract 51 0) |v_q#valueAsBitvector_22|))) (= .cse0 (fp ((_ extract 63 63) |v_q#valueAsBitvector_21|) ((_ extract 62 52) |v_q#valueAsBitvector_21|) ((_ extract 51 0) |v_q#valueAsBitvector_21|))))))) is different from false [2018-12-02 04:25:44,260 WARN L180 SmtUtils]: Spent 11.70 s on a formula simplification that was a NOOP. DAG size: 53 [2018-12-02 04:26:00,117 WARN L832 $PredicateComparison]: unable to prove that (and (exists ((|v_q#valueAsBitvector_20| (_ BitVec 64)) (|v_q#valueAsBitvector_19| (_ BitVec 64))) (and (= |c___ieee754_atan2_#in~y| (fp ((_ extract 63 63) |v_q#valueAsBitvector_20|) ((_ extract 62 52) |v_q#valueAsBitvector_20|) ((_ extract 51 0) |v_q#valueAsBitvector_20|))) (not (bvsgt (bvashr (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_20|)) (bvneg (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_19|)))) (_ bv20 32)) (_ bv60 32))) (= |c___ieee754_atan2_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_19|) ((_ extract 62 52) |v_q#valueAsBitvector_19|) ((_ extract 51 0) |v_q#valueAsBitvector_19|))))) (exists ((|v_q#valueAsBitvector_22| (_ BitVec 64)) (|v_q#valueAsBitvector_21| (_ BitVec 64)) (v_prenex_62 (_ BitVec 64)) (v_prenex_61 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) v_prenex_61) ((_ extract 62 52) v_prenex_61) ((_ extract 51 0) v_prenex_61))) (.cse2 (fp.div roundNearestTiesToEven |c___ieee754_atan2_#in~y| |c___ieee754_atan2_#in~x|))) (and (= (let ((.cse0 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_21|)) ((_ extract 31 0) |v_q#valueAsBitvector_22|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) .cse1) (= .cse1 (fp ((_ extract 63 63) v_prenex_62) ((_ extract 62 52) v_prenex_62) ((_ extract 51 0) v_prenex_62))) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_22|) ((_ extract 62 52) |v_q#valueAsBitvector_22|) ((_ extract 51 0) |v_q#valueAsBitvector_22|)) .cse2) (= (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) v_prenex_61)) (_ bv2148532224 32)) (_ bv0 32)) (= .cse2 (fp ((_ extract 63 63) |v_q#valueAsBitvector_21|) ((_ extract 62 52) |v_q#valueAsBitvector_21|) ((_ extract 51 0) |v_q#valueAsBitvector_21|))) (not (= ((_ extract 31 0) v_prenex_62) (_ bv0 32))))))) is different from false [2018-12-02 04:26:02,401 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_q#valueAsBitvector_20| (_ BitVec 64)) (|v_q#valueAsBitvector_19| (_ BitVec 64))) (and (= |c___ieee754_atan2_#in~y| (fp ((_ extract 63 63) |v_q#valueAsBitvector_20|) ((_ extract 62 52) |v_q#valueAsBitvector_20|) ((_ extract 51 0) |v_q#valueAsBitvector_20|))) (not (bvsgt (bvashr (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_20|)) (bvneg (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_19|)))) (_ bv20 32)) (_ bv60 32))) (= |c___ieee754_atan2_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_19|) ((_ extract 62 52) |v_q#valueAsBitvector_19|) ((_ extract 51 0) |v_q#valueAsBitvector_19|))))) (exists ((|v_q#valueAsBitvector_22| (_ BitVec 64)) (|v_q#valueAsBitvector_21| (_ BitVec 64)) (v_prenex_62 (_ BitVec 64)) (v_prenex_61 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) v_prenex_61) ((_ extract 62 52) v_prenex_61) ((_ extract 51 0) v_prenex_61))) (.cse2 (fp.div roundNearestTiesToEven |c___ieee754_atan2_#in~y| |c___ieee754_atan2_#in~x|))) (and (= (let ((.cse0 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_21|)) ((_ extract 31 0) |v_q#valueAsBitvector_22|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) .cse1) (= .cse1 (fp ((_ extract 63 63) v_prenex_62) ((_ extract 62 52) v_prenex_62) ((_ extract 51 0) v_prenex_62))) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_22|) ((_ extract 62 52) |v_q#valueAsBitvector_22|) ((_ extract 51 0) |v_q#valueAsBitvector_22|)) .cse2) (= (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) v_prenex_61)) (_ bv2148532224 32)) (_ bv0 32)) (= .cse2 (fp ((_ extract 63 63) |v_q#valueAsBitvector_21|) ((_ extract 62 52) |v_q#valueAsBitvector_21|) ((_ extract 51 0) |v_q#valueAsBitvector_21|))) (not (= ((_ extract 31 0) v_prenex_62) (_ bv0 32))))))) is different from true [2018-12-02 04:26:02,435 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-02 04:26:02,435 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 04:26:02,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:26:02,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2018-12-02 04:26:02,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-02 04:26:02,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-02 04:26:02,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=327, Unknown=13, NotChecked=156, Total=552 [2018-12-02 04:26:02,453 INFO L87 Difference]: Start difference. First operand 66 states and 76 transitions. Second operand 24 states. [2018-12-02 04:26:04,825 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-12-02 04:26:05,165 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-12-02 04:26:25,296 WARN L832 $PredicateComparison]: unable to prove that (and (exists ((|v_q#valueAsBitvector_19| (_ BitVec 64))) (and (= c___ieee754_atan2_~ix~1 (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_19|))) (= c___ieee754_atan2_~x (fp ((_ extract 63 63) |v_q#valueAsBitvector_19|) ((_ extract 62 52) |v_q#valueAsBitvector_19|) ((_ extract 51 0) |v_q#valueAsBitvector_19|))))) (= c___ieee754_atan2_~y |c___ieee754_atan2_#in~y|) (exists ((|v_q#valueAsBitvector_22| (_ BitVec 64)) (|v_q#valueAsBitvector_21| (_ BitVec 64))) (let ((.cse0 (fp.div roundNearestTiesToEven |c___ieee754_atan2_#in~y| |c___ieee754_atan2_#in~x|))) (and (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_22|) ((_ extract 62 52) |v_q#valueAsBitvector_22|) ((_ extract 51 0) |v_q#valueAsBitvector_22|)) .cse0) (= .cse0 (fp ((_ extract 63 63) |v_q#valueAsBitvector_21|) ((_ extract 62 52) |v_q#valueAsBitvector_21|) ((_ extract 51 0) |v_q#valueAsBitvector_21|))) (= |c___ieee754_atan2_#t~ret41| (let ((.cse1 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_21|)) ((_ extract 31 0) |v_q#valueAsBitvector_22|)))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))))))) (exists ((|v_q#valueAsBitvector_20| (_ BitVec 64)) (|v_q#valueAsBitvector_19| (_ BitVec 64))) (and (= c___ieee754_atan2_~y (fp ((_ extract 63 63) |v_q#valueAsBitvector_20|) ((_ extract 62 52) |v_q#valueAsBitvector_20|) ((_ extract 51 0) |v_q#valueAsBitvector_20|))) (not (bvsgt (bvashr (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_20|)) (bvneg (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_19|)))) (_ bv20 32)) (_ bv60 32))) (= c___ieee754_atan2_~x (fp ((_ extract 63 63) |v_q#valueAsBitvector_19|) ((_ extract 62 52) |v_q#valueAsBitvector_19|) ((_ extract 51 0) |v_q#valueAsBitvector_19|))))) (exists ((|v_q#valueAsBitvector_19| (_ BitVec 64))) (and (= c___ieee754_atan2_~hx~1 ((_ extract 63 32) |v_q#valueAsBitvector_19|)) (= c___ieee754_atan2_~x (fp ((_ extract 63 63) |v_q#valueAsBitvector_19|) ((_ extract 62 52) |v_q#valueAsBitvector_19|) ((_ extract 51 0) |v_q#valueAsBitvector_19|))))) (exists ((|v_q#valueAsBitvector_20| (_ BitVec 64)) (|v_q#valueAsBitvector_19| (_ BitVec 64))) (and (= |c___ieee754_atan2_#in~y| (fp ((_ extract 63 63) |v_q#valueAsBitvector_20|) ((_ extract 62 52) |v_q#valueAsBitvector_20|) ((_ extract 51 0) |v_q#valueAsBitvector_20|))) (not (bvsgt (bvashr (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_20|)) (bvneg (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_19|)))) (_ bv20 32)) (_ bv60 32))) (= |c___ieee754_atan2_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_19|) ((_ extract 62 52) |v_q#valueAsBitvector_19|) ((_ extract 51 0) |v_q#valueAsBitvector_19|))))) (= c___ieee754_atan2_~x |c___ieee754_atan2_#in~x|) (exists ((|v_q#valueAsBitvector_20| (_ BitVec 64)) (|v_q#valueAsBitvector_19| (_ BitVec 64))) (and (= (bvashr (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_20|)) (bvneg (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_19|)))) (_ bv20 32)) c___ieee754_atan2_~k~0) (= c___ieee754_atan2_~y (fp ((_ extract 63 63) |v_q#valueAsBitvector_20|) ((_ extract 62 52) |v_q#valueAsBitvector_20|) ((_ extract 51 0) |v_q#valueAsBitvector_20|))) (= c___ieee754_atan2_~x (fp ((_ extract 63 63) |v_q#valueAsBitvector_19|) ((_ extract 62 52) |v_q#valueAsBitvector_19|) ((_ extract 51 0) |v_q#valueAsBitvector_19|)))))) is different from false [2018-12-02 04:27:19,058 WARN L180 SmtUtils]: Spent 10.13 s on a formula simplification that was a NOOP. DAG size: 58 [2018-12-02 04:27:33,735 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2018-12-02 04:27:50,569 WARN L180 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2018-12-02 04:28:22,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:28:22,543 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2018-12-02 04:28:22,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-02 04:28:22,863 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 51 [2018-12-02 04:28:22,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:28:22,864 INFO L225 Difference]: With dead ends: 81 [2018-12-02 04:28:22,864 INFO L226 Difference]: Without dead ends: 70 [2018-12-02 04:28:22,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 112.6s TimeCoverageRelationStatistics Valid=122, Invalid=682, Unknown=28, NotChecked=290, Total=1122 [2018-12-02 04:28:22,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-02 04:28:22,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2018-12-02 04:28:22,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-02 04:28:22,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2018-12-02 04:28:22,876 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 51 [2018-12-02 04:28:22,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:28:22,876 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2018-12-02 04:28:22,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-02 04:28:22,876 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2018-12-02 04:28:22,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-02 04:28:22,877 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:28:22,877 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:28:22,877 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:28:22,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:28:22,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1185722385, now seen corresponding path program 1 times [2018-12-02 04:28:22,878 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-02 04:28:22,878 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34bb83d7-369d-4d03-84cd-996c4ff53ea1/bin-2019/uautomizer/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2018-12-02 04:28:22,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:28:23,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:28:24,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:28:24,035 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 04:28:24,037 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 04:28:24,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2018-12-02 04:28:24,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-12-02 04:28:24,091 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:28:24,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2018-12-02 04:28:24,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 9 [2018-12-02 04:28:24,119 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 04:28:24,124 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:28:24,131 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:28:24,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 04:28:24,139 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:57, output treesize:18 [2018-12-02 04:28:24,231 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-02 04:28:24,231 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 04:28:24,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:28:24,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 04:28:24,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 04:28:24,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 04:28:24,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 04:28:24,252 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand 7 states. [2018-12-02 04:28:25,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:28:25,413 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2018-12-02 04:28:25,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 04:28:25,414 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2018-12-02 04:28:25,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:28:25,414 INFO L225 Difference]: With dead ends: 66 [2018-12-02 04:28:25,414 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 04:28:25,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-12-02 04:28:25,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 04:28:25,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 04:28:25,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 04:28:25,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 04:28:25,415 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2018-12-02 04:28:25,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:28:25,415 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 04:28:25,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 04:28:25,415 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 04:28:25,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 04:28:25,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-02 04:28:31,926 WARN L180 SmtUtils]: Spent 6.42 s on a formula simplification. DAG size of input: 202 DAG size of output: 182 [2018-12-02 04:29:00,399 WARN L180 SmtUtils]: Spent 28.41 s on a formula simplification. DAG size of input: 90 DAG size of output: 75 [2018-12-02 04:29:39,560 WARN L180 SmtUtils]: Spent 39.16 s on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2018-12-02 04:30:30,521 WARN L180 SmtUtils]: Spent 50.92 s on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2018-12-02 04:30:39,054 WARN L180 SmtUtils]: Spent 8.53 s on a formula simplification. DAG size of input: 63 DAG size of output: 1 [2018-12-02 04:30:51,226 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-12-02 04:30:51,227 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.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:621) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:122) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:187) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:151) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.simplifyWithStatistics(SmtUtils.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter(HoareAnnotationComposer.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.(HoareAnnotationComposer.java:105) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeCFGHoareAnnotation(BasicCegarLoop.java:1009) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:346) 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) ... 31 more [2018-12-02 04:30:51,229 INFO L168 Benchmark]: Toolchain (without parser) took 498704.88 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 223.3 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -178.1 MB). Peak memory consumption was 332.9 MB. Max. memory is 11.5 GB. [2018-12-02 04:30:51,230 INFO L168 Benchmark]: CDTParser took 0.12 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-02 04:30:51,230 INFO L168 Benchmark]: CACSL2BoogieTranslator took 201.67 ms. Allocated memory is still 1.0 GB. Free memory was 943.4 MB in the beginning and 921.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-12-02 04:30:51,231 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 921.9 MB in the beginning and 1.1 GB in the end (delta: -198.1 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-12-02 04:30:51,231 INFO L168 Benchmark]: Boogie Preprocessor took 31.91 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 04:30:51,231 INFO L168 Benchmark]: RCFGBuilder took 18144.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 11.5 GB. [2018-12-02 04:30:51,232 INFO L168 Benchmark]: TraceAbstraction took 480276.22 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 90.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -51.9 MB). Peak memory consumption was 326.0 MB. Max. memory is 11.5 GB. [2018-12-02 04:30:51,234 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 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 201.67 ms. Allocated memory is still 1.0 GB. Free memory was 943.4 MB in the beginning and 921.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 921.9 MB in the beginning and 1.1 GB in the end (delta: -198.1 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.91 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 18144.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 480276.22 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 90.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -51.9 MB). Peak memory consumption was 326.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 260]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - 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...