./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/float_req_bl_1251.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_f9b4dd95-baf3-4ece-b0cc-28844a20f76e/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f9b4dd95-baf3-4ece-b0cc-28844a20f76e/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f9b4dd95-baf3-4ece-b0cc-28844a20f76e/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f9b4dd95-baf3-4ece-b0cc-28844a20f76e/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1251.c -s /tmp/vcloud-vcloud-master/worker/run_dir_f9b4dd95-baf3-4ece-b0cc-28844a20f76e/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f9b4dd95-baf3-4ece-b0cc-28844a20f76e/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash df3954142d6b55c98b13b60b9fbaf053d4d402ff ......................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_f9b4dd95-baf3-4ece-b0cc-28844a20f76e/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f9b4dd95-baf3-4ece-b0cc-28844a20f76e/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f9b4dd95-baf3-4ece-b0cc-28844a20f76e/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f9b4dd95-baf3-4ece-b0cc-28844a20f76e/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1251.c -s /tmp/vcloud-vcloud-master/worker/run_dir_f9b4dd95-baf3-4ece-b0cc-28844a20f76e/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f9b4dd95-baf3-4ece-b0cc-28844a20f76e/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash df3954142d6b55c98b13b60b9fbaf053d4d402ff .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-26 02:54:38,605 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:54:38,606 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:54:38,617 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:54:38,617 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:54:38,618 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:54:38,623 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:54:38,625 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:54:38,627 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:54:38,627 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:54:38,628 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:54:38,630 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:54:38,630 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:54:38,631 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:54:38,632 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:54:38,633 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:54:38,634 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:54:38,635 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:54:38,644 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:54:38,650 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:54:38,655 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:54:38,659 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:54:38,661 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:54:38,661 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:54:38,666 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:54:38,667 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:54:38,667 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:54:38,668 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:54:38,669 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:54:38,670 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:54:38,670 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:54:38,671 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:54:38,672 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:54:38,672 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:54:38,673 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:54:38,673 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:54:38,674 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:54:38,674 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:54:38,674 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:54:38,675 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:54:38,676 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:54:38,677 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f9b4dd95-baf3-4ece-b0cc-28844a20f76e/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 02:54:38,706 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:54:38,707 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:54:38,707 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:54:38,707 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:54:38,708 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:54:38,708 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:54:38,708 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:54:38,708 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:54:38,708 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:54:38,709 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:54:38,709 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:54:38,709 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:54:38,709 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:54:38,709 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:54:38,709 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:54:38,710 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:54:38,710 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:54:38,710 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:54:38,711 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:54:38,711 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:54:38,711 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:54:38,711 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:54:38,711 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:54:38,711 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:54:38,712 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:54:38,712 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:54:38,712 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:54:38,712 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:54:38,712 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:54:38,713 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:54:38,713 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:54:38,713 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:54:38,713 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:54:38,713 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:54:38,714 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:54:38,714 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:54:38,714 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:54:38,714 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_f9b4dd95-baf3-4ece-b0cc-28844a20f76e/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> df3954142d6b55c98b13b60b9fbaf053d4d402ff [2019-11-26 02:54:38,892 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:54:38,902 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:54:38,904 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:54:38,905 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:54:38,906 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:54:38,906 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f9b4dd95-baf3-4ece-b0cc-28844a20f76e/bin/utaipan/../../sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2019-11-26 02:54:38,962 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f9b4dd95-baf3-4ece-b0cc-28844a20f76e/bin/utaipan/data/269c8fda0/48e88a12fa994593a579bdc3e69c097d/FLAG202b6c95c [2019-11-26 02:54:39,376 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:54:39,377 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f9b4dd95-baf3-4ece-b0cc-28844a20f76e/sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2019-11-26 02:54:39,383 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f9b4dd95-baf3-4ece-b0cc-28844a20f76e/bin/utaipan/data/269c8fda0/48e88a12fa994593a579bdc3e69c097d/FLAG202b6c95c [2019-11-26 02:54:39,397 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f9b4dd95-baf3-4ece-b0cc-28844a20f76e/bin/utaipan/data/269c8fda0/48e88a12fa994593a579bdc3e69c097d [2019-11-26 02:54:39,400 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:54:39,401 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:54:39,405 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:54:39,405 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:54:39,409 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:54:39,409 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:54:39" (1/1) ... [2019-11-26 02:54:39,412 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b9c5727 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:54:39, skipping insertion in model container [2019-11-26 02:54:39,412 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:54:39" (1/1) ... [2019-11-26 02:54:39,418 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:54:39,438 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:54:39,661 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:54:39,664 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:54:39,689 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:54:39,709 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:54:39,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:54:39 WrapperNode [2019-11-26 02:54:39,710 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:54:39,711 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:54:39,711 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:54:39,711 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:54:39,719 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:54:39" (1/1) ... [2019-11-26 02:54:39,727 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:54:39" (1/1) ... [2019-11-26 02:54:39,756 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:54:39,756 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:54:39,756 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:54:39,757 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:54:39,766 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:54:39" (1/1) ... [2019-11-26 02:54:39,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:54:39" (1/1) ... [2019-11-26 02:54:39,769 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:54:39" (1/1) ... [2019-11-26 02:54:39,769 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:54:39" (1/1) ... [2019-11-26 02:54:39,779 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:54:39" (1/1) ... [2019-11-26 02:54:39,784 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:54:39" (1/1) ... [2019-11-26 02:54:39,786 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:54:39" (1/1) ... [2019-11-26 02:54:39,789 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:54:39,790 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:54:39,790 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:54:39,790 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:54:39,791 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:54:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9b4dd95-baf3-4ece-b0cc-28844a20f76e/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:54:39,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-26 02:54:39,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-11-26 02:54:39,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:54:39,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:54:39,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-26 02:54:39,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-26 02:54:40,674 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:54:40,675 INFO L284 CfgBuilder]: Removed 30 assume(true) statements. [2019-11-26 02:54:40,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:54:40 BoogieIcfgContainer [2019-11-26 02:54:40,676 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:54:40,677 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:54:40,677 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:54:40,681 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:54:40,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:54:39" (1/3) ... [2019-11-26 02:54:40,683 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1823734 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:54:40, skipping insertion in model container [2019-11-26 02:54:40,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:54:39" (2/3) ... [2019-11-26 02:54:40,684 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1823734 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:54:40, skipping insertion in model container [2019-11-26 02:54:40,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:54:40" (3/3) ... [2019-11-26 02:54:40,686 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1251.c [2019-11-26 02:54:40,694 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:54:40,702 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-26 02:54:40,711 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-11-26 02:54:40,736 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:54:40,736 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:54:40,737 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:54:40,737 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:54:40,737 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:54:40,737 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:54:40,737 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:54:40,737 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:54:40,751 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-11-26 02:54:40,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-26 02:54:40,759 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:54:40,760 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:54:40,760 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:54:40,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:54:40,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1273882480, now seen corresponding path program 1 times [2019-11-26 02:54:40,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:54:40,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472455218] [2019-11-26 02:54:40,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:54:40,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:54:40,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:54:40,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472455218] [2019-11-26 02:54:40,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:54:40,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:54:40,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846542582] [2019-11-26 02:54:40,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-26 02:54:40,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:54:40,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-26 02:54:40,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-26 02:54:40,939 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2019-11-26 02:54:40,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:54:40,953 INFO L93 Difference]: Finished difference Result 36 states and 49 transitions. [2019-11-26 02:54:40,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-26 02:54:40,954 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-26 02:54:40,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:54:40,961 INFO L225 Difference]: With dead ends: 36 [2019-11-26 02:54:40,961 INFO L226 Difference]: Without dead ends: 16 [2019-11-26 02:54:40,964 INFO L630 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 [2019-11-26 02:54:40,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-11-26 02:54:40,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-11-26 02:54:40,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-26 02:54:40,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-11-26 02:54:40,992 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 8 [2019-11-26 02:54:40,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:54:40,993 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-11-26 02:54:40,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-26 02:54:40,993 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-11-26 02:54:40,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-26 02:54:40,994 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:54:40,994 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:54:40,994 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:54:40,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:54:40,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1290433896, now seen corresponding path program 1 times [2019-11-26 02:54:40,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:54:40,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066914153] [2019-11-26 02:54:40,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:54:41,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 02:54:41,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 02:54:41,234 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-11-26 02:54:41,235 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-26 02:54:41,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:54:41 BoogieIcfgContainer [2019-11-26 02:54:41,269 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:54:41,269 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:54:41,269 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:54:41,270 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:54:41,270 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:54:40" (3/4) ... [2019-11-26 02:54:41,273 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-26 02:54:41,273 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:54:41,275 INFO L168 Benchmark]: Toolchain (without parser) took 1873.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 950.1 MB in the beginning and 1.0 GB in the end (delta: -92.4 MB). Peak memory consumption was 61.2 MB. Max. memory is 11.5 GB. [2019-11-26 02:54:41,275 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:54:41,276 INFO L168 Benchmark]: CACSL2BoogieTranslator took 305.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -195.1 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-26 02:54:41,277 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.52 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. [2019-11-26 02:54:41,277 INFO L168 Benchmark]: Boogie Preprocessor took 33.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-26 02:54:41,278 INFO L168 Benchmark]: RCFGBuilder took 886.48 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: 69.4 MB). Peak memory consumption was 69.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:54:41,279 INFO L168 Benchmark]: TraceAbstraction took 592.19 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: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. [2019-11-26 02:54:41,279 INFO L168 Benchmark]: Witness Printer took 4.20 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. [2019-11-26 02:54:41,282 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 305.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -195.1 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.52 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. * Boogie Preprocessor took 33.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 886.48 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: 69.4 MB). Peak memory consumption was 69.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 592.19 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: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. * Witness Printer took 4.20 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.traceabstraction: - UnprovableResult [Line: 74]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 73. Possible FailurePath: [L64] float x = __VERIFIER_nondet_float(); [L65] float y = __VERIFIER_nondet_float(); [L55] return x != x; [L67] EXPR isnan_float(x) && !isnan_float(y) [L55] return x != x; [L67] EXPR isnan_float(x) && !isnan_float(y) [L67-L68] (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) [L55] return x != x; [L68] EXPR !isnan_float(x) && isnan_float(y) [L55] return x != x; [L68] EXPR !isnan_float(x) && isnan_float(y) [L67-L68] (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) [L67-L68] COND TRUE (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) [L21] __uint32_t w; [L24] ieee_float_shape_type gf_u; [L25] gf_u.value = (x) [L26] EXPR gf_u.word [L26] (w) = gf_u.word [L29] COND FALSE !(w == 0x00000000 || w == 0x80000000) [L31-L32] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) [L34-L35] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) [L37] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L40] return 0; [L44] COND TRUE __fpclassify_float(x) == 0 [L45] return y; [L70] float res = fmax_float(x, y); [L55] return x != x; [L73] EXPR isnan_float(x) && !isnan_float(y) [L55] return x != x; [L73] EXPR isnan_float(x) && !isnan_float(y) [L73] COND TRUE isnan_float(x) && !isnan_float(y) && res != y [L74] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 2 error locations. Result: UNSAFE, OverallTime: 0.5s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 20 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 17 NumberOfCodeBlocks, 17 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 7 ConstructedInterpolants, 0 QuantifiedInterpolants, 49 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-6b5699a [2019-11-26 02:54:43,085 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:54:43,088 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:54:43,103 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:54:43,104 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:54:43,105 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:54:43,107 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:54:43,116 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:54:43,131 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:54:43,132 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:54:43,133 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:54:43,134 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:54:43,134 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:54:43,135 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:54:43,135 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:54:43,136 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:54:43,137 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:54:43,138 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:54:43,139 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:54:43,141 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:54:43,142 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:54:43,143 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:54:43,144 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:54:43,144 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:54:43,146 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:54:43,147 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:54:43,147 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:54:43,152 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:54:43,152 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:54:43,153 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:54:43,154 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:54:43,155 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:54:43,156 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:54:43,157 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:54:43,158 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:54:43,158 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:54:43,160 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:54:43,160 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:54:43,160 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:54:43,161 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:54:43,162 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:54:43,163 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f9b4dd95-baf3-4ece-b0cc-28844a20f76e/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2019-11-26 02:54:43,188 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:54:43,196 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:54:43,198 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:54:43,199 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:54:43,199 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:54:43,200 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:54:43,200 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:54:43,200 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:54:43,200 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:54:43,201 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:54:43,201 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:54:43,201 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:54:43,202 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:54:43,202 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:54:43,202 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:54:43,203 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:54:43,203 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-26 02:54:43,203 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-26 02:54:43,204 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-26 02:54:43,204 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:54:43,204 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:54:43,204 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-26 02:54:43,205 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:54:43,205 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:54:43,205 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-26 02:54:43,206 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:54:43,206 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:54:43,206 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:54:43,207 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:54:43,207 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:54:43,207 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:54:43,208 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-11-26 02:54:43,208 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-26 02:54:43,208 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:54:43,208 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:54:43,209 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_f9b4dd95-baf3-4ece-b0cc-28844a20f76e/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> df3954142d6b55c98b13b60b9fbaf053d4d402ff [2019-11-26 02:54:43,506 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:54:43,515 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:54:43,518 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:54:43,519 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:54:43,520 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:54:43,520 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f9b4dd95-baf3-4ece-b0cc-28844a20f76e/bin/utaipan/../../sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2019-11-26 02:54:43,570 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f9b4dd95-baf3-4ece-b0cc-28844a20f76e/bin/utaipan/data/101efea57/3e44d194fe774e7aa48ac4cf33cd701f/FLAG6ab12bee0 [2019-11-26 02:54:43,931 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:54:43,932 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f9b4dd95-baf3-4ece-b0cc-28844a20f76e/sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2019-11-26 02:54:43,937 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f9b4dd95-baf3-4ece-b0cc-28844a20f76e/bin/utaipan/data/101efea57/3e44d194fe774e7aa48ac4cf33cd701f/FLAG6ab12bee0 [2019-11-26 02:54:44,380 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f9b4dd95-baf3-4ece-b0cc-28844a20f76e/bin/utaipan/data/101efea57/3e44d194fe774e7aa48ac4cf33cd701f [2019-11-26 02:54:44,382 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:54:44,383 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:54:44,384 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:54:44,385 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:54:44,388 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:54:44,388 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:54:44" (1/1) ... [2019-11-26 02:54:44,395 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61677559 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:54:44, skipping insertion in model container [2019-11-26 02:54:44,395 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:54:44" (1/1) ... [2019-11-26 02:54:44,403 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:54:44,425 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:54:44,600 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:54:44,605 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:54:44,630 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:54:44,661 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:54:44,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:54:44 WrapperNode [2019-11-26 02:54:44,662 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:54:44,662 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:54:44,662 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:54:44,663 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:54:44,740 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:54:44" (1/1) ... [2019-11-26 02:54:44,761 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:54:44" (1/1) ... [2019-11-26 02:54:44,799 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:54:44,799 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:54:44,799 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:54:44,799 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:54:44,808 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:54:44" (1/1) ... [2019-11-26 02:54:44,809 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:54:44" (1/1) ... [2019-11-26 02:54:44,823 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:54:44" (1/1) ... [2019-11-26 02:54:44,823 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:54:44" (1/1) ... [2019-11-26 02:54:44,840 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:54:44" (1/1) ... [2019-11-26 02:54:44,851 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:54:44" (1/1) ... [2019-11-26 02:54:44,859 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:54:44" (1/1) ... [2019-11-26 02:54:44,866 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:54:44,867 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:54:44,867 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:54:44,870 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:54:44,871 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:54:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9b4dd95-baf3-4ece-b0cc-28844a20f76e/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:54:44,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-26 02:54:44,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-26 02:54:44,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:54:44,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:54:44,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2019-11-26 02:54:44,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-26 02:54:45,338 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:54:45,339 INFO L284 CfgBuilder]: Removed 30 assume(true) statements. [2019-11-26 02:54:45,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:54:45 BoogieIcfgContainer [2019-11-26 02:54:45,340 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:54:45,340 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:54:45,341 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:54:45,343 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:54:45,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:54:44" (1/3) ... [2019-11-26 02:54:45,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b222733 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:54:45, skipping insertion in model container [2019-11-26 02:54:45,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:54:44" (2/3) ... [2019-11-26 02:54:45,345 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b222733 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:54:45, skipping insertion in model container [2019-11-26 02:54:45,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:54:45" (3/3) ... [2019-11-26 02:54:45,347 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1251.c [2019-11-26 02:54:45,356 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:54:45,362 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-26 02:54:45,370 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-11-26 02:54:45,389 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:54:45,389 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:54:45,389 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:54:45,390 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:54:45,390 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:54:45,390 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:54:45,390 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:54:45,390 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:54:45,403 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-11-26 02:54:45,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-26 02:54:45,409 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:54:45,410 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:54:45,410 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:54:45,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:54:45,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1204154757, now seen corresponding path program 1 times [2019-11-26 02:54:45,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:54:45,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [955449530] [2019-11-26 02:54:45,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9b4dd95-baf3-4ece-b0cc-28844a20f76e/bin/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-11-26 02:54:45,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:54:45,509 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-26 02:54:45,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:54:45,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:54:45,526 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:54:45,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:54:45,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [955449530] [2019-11-26 02:54:45,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:54:45,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-26 02:54:45,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103447021] [2019-11-26 02:54:45,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-26 02:54:45,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:54:45,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-26 02:54:45,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-26 02:54:45,552 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 2 states. [2019-11-26 02:54:45,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:54:45,573 INFO L93 Difference]: Finished difference Result 82 states and 122 transitions. [2019-11-26 02:54:45,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-26 02:54:45,574 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-26 02:54:45,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:54:45,585 INFO L225 Difference]: With dead ends: 82 [2019-11-26 02:54:45,585 INFO L226 Difference]: Without dead ends: 43 [2019-11-26 02:54:45,588 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-26 02:54:45,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-26 02:54:45,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-11-26 02:54:45,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-26 02:54:45,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2019-11-26 02:54:45,624 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 58 transitions. Word has length 16 [2019-11-26 02:54:45,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:54:45,625 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 58 transitions. [2019-11-26 02:54:45,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-26 02:54:45,625 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2019-11-26 02:54:45,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-26 02:54:45,626 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:54:45,626 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:54:45,839 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-26 02:54:45,839 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:54:45,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:54:45,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1262247077, now seen corresponding path program 1 times [2019-11-26 02:54:45,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:54:45,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [867102682] [2019-11-26 02:54:45,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9b4dd95-baf3-4ece-b0cc-28844a20f76e/bin/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-26 02:54:45,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:54:45,921 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-26 02:54:45,922 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:54:45,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:54:45,954 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:54:45,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:54:45,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:54:45,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [867102682] [2019-11-26 02:54:45,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:54:45,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-26 02:54:45,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534391270] [2019-11-26 02:54:45,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:54:45,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:54:45,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:54:45,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:54:45,970 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. Second operand 4 states. [2019-11-26 02:54:46,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:54:46,711 INFO L93 Difference]: Finished difference Result 82 states and 111 transitions. [2019-11-26 02:54:46,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:54:46,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-26 02:54:46,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:54:46,715 INFO L225 Difference]: With dead ends: 82 [2019-11-26 02:54:46,716 INFO L226 Difference]: Without dead ends: 50 [2019-11-26 02:54:46,717 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:54:46,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-26 02:54:46,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2019-11-26 02:54:46,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-26 02:54:46,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2019-11-26 02:54:46,737 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 17 [2019-11-26 02:54:46,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:54:46,738 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2019-11-26 02:54:46,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:54:46,740 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2019-11-26 02:54:46,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-26 02:54:46,742 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:54:46,742 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:54:46,948 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-26 02:54:46,948 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:54:46,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:54:46,949 INFO L82 PathProgramCache]: Analyzing trace with hash 44236684, now seen corresponding path program 1 times [2019-11-26 02:54:46,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:54:46,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1592954882] [2019-11-26 02:54:46,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9b4dd95-baf3-4ece-b0cc-28844a20f76e/bin/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-26 02:54:47,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:54:47,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-26 02:54:47,021 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:54:47,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:54:47,034 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:54:47,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:54:47,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1592954882] [2019-11-26 02:54:47,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:54:47,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-26 02:54:47,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054894399] [2019-11-26 02:54:47,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:54:47,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:54:47,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:54:47,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:54:47,064 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand 6 states. [2019-11-26 02:54:47,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:54:47,180 INFO L93 Difference]: Finished difference Result 96 states and 120 transitions. [2019-11-26 02:54:47,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:54:47,181 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-11-26 02:54:47,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:54:47,182 INFO L225 Difference]: With dead ends: 96 [2019-11-26 02:54:47,182 INFO L226 Difference]: Without dead ends: 83 [2019-11-26 02:54:47,183 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:54:47,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-26 02:54:47,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 47. [2019-11-26 02:54:47,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-26 02:54:47,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2019-11-26 02:54:47,190 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 18 [2019-11-26 02:54:47,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:54:47,191 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2019-11-26 02:54:47,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:54:47,191 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2019-11-26 02:54:47,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-26 02:54:47,192 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:54:47,192 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:54:47,412 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-26 02:54:47,412 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:54:47,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:54:47,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1380709804, now seen corresponding path program 1 times [2019-11-26 02:54:47,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:54:47,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [65414155] [2019-11-26 02:54:47,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9b4dd95-baf3-4ece-b0cc-28844a20f76e/bin/utaipan/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-26 02:54:47,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:54:47,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-26 02:54:47,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:54:47,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:54:47,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:54:47,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:54:47,586 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:54:47,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:54:47,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:54:47,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:54:47,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [65414155] [2019-11-26 02:54:47,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:54:47,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2019-11-26 02:54:47,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834652030] [2019-11-26 02:54:47,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-26 02:54:47,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:54:47,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-26 02:54:47,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-26 02:54:47,650 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 10 states. [2019-11-26 02:54:48,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:54:48,186 INFO L93 Difference]: Finished difference Result 149 states and 197 transitions. [2019-11-26 02:54:48,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-26 02:54:48,186 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-11-26 02:54:48,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:54:48,188 INFO L225 Difference]: With dead ends: 149 [2019-11-26 02:54:48,188 INFO L226 Difference]: Without dead ends: 140 [2019-11-26 02:54:48,189 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-11-26 02:54:48,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-11-26 02:54:48,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 75. [2019-11-26 02:54:48,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-26 02:54:48,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2019-11-26 02:54:48,214 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 21 [2019-11-26 02:54:48,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:54:48,215 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2019-11-26 02:54:48,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-26 02:54:48,215 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2019-11-26 02:54:48,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-26 02:54:48,217 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:54:48,217 INFO L410 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] [2019-11-26 02:54:48,438 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-26 02:54:48,439 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:54:48,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:54:48,439 INFO L82 PathProgramCache]: Analyzing trace with hash 147544209, now seen corresponding path program 1 times [2019-11-26 02:54:48,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:54:48,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [767914109] [2019-11-26 02:54:48,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9b4dd95-baf3-4ece-b0cc-28844a20f76e/bin/utaipan/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-26 02:54:48,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:54:48,519 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-26 02:54:48,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:54:48,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:54:48,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:54:48,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:54:48,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:54:48,694 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:54:48,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:54:48,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:54:48,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:54:48,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [767914109] [2019-11-26 02:54:48,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:54:48,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 15 [2019-11-26 02:54:48,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212354037] [2019-11-26 02:54:48,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-26 02:54:48,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:54:48,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-26 02:54:48,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-11-26 02:54:48,838 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 15 states. [2019-11-26 02:54:49,587 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 10 [2019-11-26 02:54:52,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:54:52,167 INFO L93 Difference]: Finished difference Result 180 states and 237 transitions. [2019-11-26 02:54:52,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-26 02:54:52,167 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2019-11-26 02:54:52,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:54:52,169 INFO L225 Difference]: With dead ends: 180 [2019-11-26 02:54:52,169 INFO L226 Difference]: Without dead ends: 178 [2019-11-26 02:54:52,170 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=185, Invalid=465, Unknown=0, NotChecked=0, Total=650 [2019-11-26 02:54:52,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-11-26 02:54:52,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 89. [2019-11-26 02:54:52,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-26 02:54:52,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 121 transitions. [2019-11-26 02:54:52,185 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 121 transitions. Word has length 22 [2019-11-26 02:54:52,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:54:52,186 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 121 transitions. [2019-11-26 02:54:52,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-26 02:54:52,186 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 121 transitions. [2019-11-26 02:54:52,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-26 02:54:52,187 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:54:52,188 INFO L410 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] [2019-11-26 02:54:52,400 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-26 02:54:52,401 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:54:52,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:54:52,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1845695531, now seen corresponding path program 1 times [2019-11-26 02:54:52,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:54:52,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [678998441] [2019-11-26 02:54:52,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9b4dd95-baf3-4ece-b0cc-28844a20f76e/bin/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-11-26 02:54:52,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:54:52,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-26 02:54:52,482 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:54:52,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:54:52,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:54:52,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:54:52,568 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:54:52,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:54:52,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:54:52,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:54:52,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:54:52,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [678998441] [2019-11-26 02:54:52,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:54:52,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2019-11-26 02:54:52,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995814039] [2019-11-26 02:54:52,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-26 02:54:52,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:54:52,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-26 02:54:52,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-26 02:54:52,645 INFO L87 Difference]: Start difference. First operand 89 states and 121 transitions. Second operand 9 states. [2019-11-26 02:54:53,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:54:53,084 INFO L93 Difference]: Finished difference Result 166 states and 219 transitions. [2019-11-26 02:54:53,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-26 02:54:53,085 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-11-26 02:54:53,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:54:53,086 INFO L225 Difference]: With dead ends: 166 [2019-11-26 02:54:53,086 INFO L226 Difference]: Without dead ends: 131 [2019-11-26 02:54:53,087 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2019-11-26 02:54:53,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-26 02:54:53,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 89. [2019-11-26 02:54:53,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-26 02:54:53,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 120 transitions. [2019-11-26 02:54:53,098 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 120 transitions. Word has length 23 [2019-11-26 02:54:53,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:54:53,098 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 120 transitions. [2019-11-26 02:54:53,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-26 02:54:53,098 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 120 transitions. [2019-11-26 02:54:53,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-26 02:54:53,100 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:54:53,100 INFO L410 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] [2019-11-26 02:54:53,321 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-26 02:54:53,321 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:54:53,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:54:53,321 INFO L82 PathProgramCache]: Analyzing trace with hash 156888005, now seen corresponding path program 1 times [2019-11-26 02:54:53,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:54:53,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1936118336] [2019-11-26 02:54:53,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9b4dd95-baf3-4ece-b0cc-28844a20f76e/bin/utaipan/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-11-26 02:54:53,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:54:53,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-26 02:54:53,420 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:54:53,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:54:53,454 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:54:53,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:54:53,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1936118336] [2019-11-26 02:54:53,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:54:53,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-26 02:54:53,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493887693] [2019-11-26 02:54:53,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:54:53,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:54:53,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:54:53,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:54:53,478 INFO L87 Difference]: Start difference. First operand 89 states and 120 transitions. Second operand 6 states. [2019-11-26 02:54:53,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:54:53,577 INFO L93 Difference]: Finished difference Result 157 states and 199 transitions. [2019-11-26 02:54:53,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:54:53,579 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-11-26 02:54:53,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:54:53,581 INFO L225 Difference]: With dead ends: 157 [2019-11-26 02:54:53,581 INFO L226 Difference]: Without dead ends: 141 [2019-11-26 02:54:53,584 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:54:53,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-11-26 02:54:53,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 93. [2019-11-26 02:54:53,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-26 02:54:53,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2019-11-26 02:54:53,601 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 24 [2019-11-26 02:54:53,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:54:53,601 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-11-26 02:54:53,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:54:53,602 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2019-11-26 02:54:53,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-26 02:54:53,603 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:54:53,603 INFO L410 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] [2019-11-26 02:54:53,825 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-26 02:54:53,825 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:54:53,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:54:53,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1621213116, now seen corresponding path program 1 times [2019-11-26 02:54:53,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:54:53,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [97545594] [2019-11-26 02:54:53,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9b4dd95-baf3-4ece-b0cc-28844a20f76e/bin/utaipan/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-11-26 02:54:53,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:54:53,897 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-26 02:54:53,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:54:53,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:54:53,910 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:54:53,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:54:53,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [97545594] [2019-11-26 02:54:53,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:54:53,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-26 02:54:53,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016761745] [2019-11-26 02:54:53,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:54:53,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:54:53,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:54:53,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:54:53,914 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. Second operand 3 states. [2019-11-26 02:54:53,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:54:53,946 INFO L93 Difference]: Finished difference Result 96 states and 127 transitions. [2019-11-26 02:54:53,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:54:53,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-26 02:54:53,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:54:53,948 INFO L225 Difference]: With dead ends: 96 [2019-11-26 02:54:53,948 INFO L226 Difference]: Without dead ends: 94 [2019-11-26 02:54:53,948 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:54:53,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-26 02:54:53,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-11-26 02:54:53,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-26 02:54:53,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2019-11-26 02:54:53,956 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 24 [2019-11-26 02:54:53,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:54:53,957 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-11-26 02:54:53,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:54:53,957 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2019-11-26 02:54:53,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-26 02:54:53,969 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:54:53,970 INFO L410 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] [2019-11-26 02:54:54,191 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-26 02:54:54,191 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:54:54,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:54:54,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1741974657, now seen corresponding path program 1 times [2019-11-26 02:54:54,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:54:54,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1853585888] [2019-11-26 02:54:54,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9b4dd95-baf3-4ece-b0cc-28844a20f76e/bin/utaipan/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-11-26 02:54:54,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:54:54,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-26 02:54:54,253 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:54:54,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:54:54,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:54:54,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:54:54,315 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:54:54,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:54:54,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:54:54,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:54:54,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1853585888] [2019-11-26 02:54:54,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:54:54,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2019-11-26 02:54:54,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708672042] [2019-11-26 02:54:54,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-26 02:54:54,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:54:54,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-26 02:54:54,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-26 02:54:54,399 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. Second operand 10 states. [2019-11-26 02:54:55,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:54:55,208 INFO L93 Difference]: Finished difference Result 131 states and 173 transitions. [2019-11-26 02:54:55,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 02:54:55,212 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2019-11-26 02:54:55,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:54:55,213 INFO L225 Difference]: With dead ends: 131 [2019-11-26 02:54:55,213 INFO L226 Difference]: Without dead ends: 118 [2019-11-26 02:54:55,214 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-11-26 02:54:55,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-26 02:54:55,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 89. [2019-11-26 02:54:55,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-26 02:54:55,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 118 transitions. [2019-11-26 02:54:55,222 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 118 transitions. Word has length 25 [2019-11-26 02:54:55,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:54:55,222 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 118 transitions. [2019-11-26 02:54:55,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-26 02:54:55,222 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 118 transitions. [2019-11-26 02:54:55,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-26 02:54:55,223 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:54:55,223 INFO L410 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] [2019-11-26 02:54:55,436 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-26 02:54:55,443 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:54:55,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:54:55,444 INFO L82 PathProgramCache]: Analyzing trace with hash 839729769, now seen corresponding path program 1 times [2019-11-26 02:54:55,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:54:55,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1300056395] [2019-11-26 02:54:55,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9b4dd95-baf3-4ece-b0cc-28844a20f76e/bin/utaipan/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-11-26 02:54:55,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:54:55,501 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-26 02:54:55,503 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:54:55,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:54:55,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:54:55,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:54:55,565 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:54:55,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:54:55,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:54:55,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:54:55,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:54:55,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1300056395] [2019-11-26 02:54:55,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:54:55,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 11 [2019-11-26 02:54:55,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868497802] [2019-11-26 02:54:55,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-26 02:54:55,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:54:55,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-26 02:54:55,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-11-26 02:54:55,633 INFO L87 Difference]: Start difference. First operand 89 states and 118 transitions. Second operand 11 states. [2019-11-26 02:54:55,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:54:55,965 INFO L93 Difference]: Finished difference Result 114 states and 147 transitions. [2019-11-26 02:54:55,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-26 02:54:55,965 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-11-26 02:54:55,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:54:55,966 INFO L225 Difference]: With dead ends: 114 [2019-11-26 02:54:55,966 INFO L226 Difference]: Without dead ends: 78 [2019-11-26 02:54:55,967 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2019-11-26 02:54:55,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-26 02:54:55,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-11-26 02:54:55,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-26 02:54:55,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 98 transitions. [2019-11-26 02:54:55,973 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 98 transitions. Word has length 25 [2019-11-26 02:54:55,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:54:55,973 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 98 transitions. [2019-11-26 02:54:55,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-26 02:54:55,973 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 98 transitions. [2019-11-26 02:54:55,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-26 02:54:55,974 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:54:55,974 INFO L410 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] [2019-11-26 02:54:56,174 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-26 02:54:56,174 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:54:56,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:54:56,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1281876129, now seen corresponding path program 1 times [2019-11-26 02:54:56,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:54:56,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1149273448] [2019-11-26 02:54:56,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9b4dd95-baf3-4ece-b0cc-28844a20f76e/bin/utaipan/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-11-26 02:54:56,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:54:56,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-26 02:54:56,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:54:56,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:54:56,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:54:56,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:54:56,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:54:56,321 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:54:56,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:54:56,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:54:56,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:54:56,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:54:56,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1149273448] [2019-11-26 02:54:56,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:54:56,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2019-11-26 02:54:56,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157948902] [2019-11-26 02:54:56,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-26 02:54:56,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:54:56,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-26 02:54:56,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-26 02:54:56,378 INFO L87 Difference]: Start difference. First operand 76 states and 98 transitions. Second operand 9 states. [2019-11-26 02:54:56,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:54:56,671 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2019-11-26 02:54:56,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-26 02:54:56,672 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-11-26 02:54:56,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:54:56,672 INFO L225 Difference]: With dead ends: 84 [2019-11-26 02:54:56,672 INFO L226 Difference]: Without dead ends: 74 [2019-11-26 02:54:56,673 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-11-26 02:54:56,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-26 02:54:56,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-26 02:54:56,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-26 02:54:56,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 94 transitions. [2019-11-26 02:54:56,678 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 94 transitions. Word has length 25 [2019-11-26 02:54:56,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:54:56,678 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 94 transitions. [2019-11-26 02:54:56,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-26 02:54:56,678 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2019-11-26 02:54:56,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-26 02:54:56,679 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:54:56,679 INFO L410 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] [2019-11-26 02:54:56,890 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-11-26 02:54:56,890 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:54:56,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:54:56,890 INFO L82 PathProgramCache]: Analyzing trace with hash -144403189, now seen corresponding path program 1 times [2019-11-26 02:54:56,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:54:56,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [724266544] [2019-11-26 02:54:56,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9b4dd95-baf3-4ece-b0cc-28844a20f76e/bin/utaipan/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-11-26 02:54:56,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:54:56,957 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-26 02:54:56,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:54:56,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:54:57,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:54:57,004 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:54:57,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:54:57,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:54:57,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [724266544] [2019-11-26 02:54:57,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:54:57,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-11-26 02:54:57,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741566339] [2019-11-26 02:54:57,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-26 02:54:57,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:54:57,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-26 02:54:57,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-26 02:54:57,252 INFO L87 Difference]: Start difference. First operand 74 states and 94 transitions. Second operand 10 states. [2019-11-26 02:54:57,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:54:57,628 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2019-11-26 02:54:57,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-26 02:54:57,630 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-11-26 02:54:57,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:54:57,631 INFO L225 Difference]: With dead ends: 82 [2019-11-26 02:54:57,631 INFO L226 Difference]: Without dead ends: 74 [2019-11-26 02:54:57,631 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-11-26 02:54:57,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-26 02:54:57,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-26 02:54:57,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-26 02:54:57,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 93 transitions. [2019-11-26 02:54:57,638 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 93 transitions. Word has length 26 [2019-11-26 02:54:57,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:54:57,638 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 93 transitions. [2019-11-26 02:54:57,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-26 02:54:57,638 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 93 transitions. [2019-11-26 02:54:57,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-26 02:54:57,639 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:54:57,639 INFO L410 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] [2019-11-26 02:54:57,839 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-11-26 02:54:57,840 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:54:57,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:54:57,840 INFO L82 PathProgramCache]: Analyzing trace with hash -953749815, now seen corresponding path program 1 times [2019-11-26 02:54:57,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:54:57,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1049955906] [2019-11-26 02:54:57,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9b4dd95-baf3-4ece-b0cc-28844a20f76e/bin/utaipan/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 [2019-11-26 02:54:57,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:54:57,901 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-26 02:54:57,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:54:57,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:54:58,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:54:58,071 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:54:58,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:54:58,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:54:58,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1049955906] [2019-11-26 02:54:58,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:54:58,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 16 [2019-11-26 02:54:58,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230887352] [2019-11-26 02:54:58,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-26 02:54:58,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:54:58,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-26 02:54:58,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-11-26 02:54:58,285 INFO L87 Difference]: Start difference. First operand 74 states and 93 transitions. Second operand 16 states. [2019-11-26 02:54:59,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:54:59,504 INFO L93 Difference]: Finished difference Result 154 states and 169 transitions. [2019-11-26 02:54:59,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-26 02:54:59,505 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2019-11-26 02:54:59,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:54:59,506 INFO L225 Difference]: With dead ends: 154 [2019-11-26 02:54:59,506 INFO L226 Difference]: Without dead ends: 134 [2019-11-26 02:54:59,506 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=186, Invalid=464, Unknown=0, NotChecked=0, Total=650 [2019-11-26 02:54:59,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-26 02:54:59,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 72. [2019-11-26 02:54:59,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-26 02:54:59,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 87 transitions. [2019-11-26 02:54:59,512 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 87 transitions. Word has length 26 [2019-11-26 02:54:59,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:54:59,513 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 87 transitions. [2019-11-26 02:54:59,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-26 02:54:59,513 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2019-11-26 02:54:59,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-26 02:54:59,513 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:54:59,514 INFO L410 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] [2019-11-26 02:54:59,724 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-11-26 02:54:59,724 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:54:59,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:54:59,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1548503636, now seen corresponding path program 1 times [2019-11-26 02:54:59,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:54:59,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [932707172] [2019-11-26 02:54:59,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9b4dd95-baf3-4ece-b0cc-28844a20f76e/bin/utaipan/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-11-26 02:54:59,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:54:59,789 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-26 02:54:59,795 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:54:59,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:54:59,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:54:59,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:55:00,136 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 29 [2019-11-26 02:55:00,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:55:00,142 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:55:00,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:55:00,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:55:00,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:55:00,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [932707172] [2019-11-26 02:55:00,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:55:00,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 15 [2019-11-26 02:55:00,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248976806] [2019-11-26 02:55:00,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-26 02:55:00,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:55:00,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-26 02:55:00,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-11-26 02:55:00,318 INFO L87 Difference]: Start difference. First operand 72 states and 87 transitions. Second operand 15 states. [2019-11-26 02:55:02,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:55:02,330 INFO L93 Difference]: Finished difference Result 195 states and 205 transitions. [2019-11-26 02:55:02,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-11-26 02:55:02,330 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-11-26 02:55:02,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:55:02,331 INFO L225 Difference]: With dead ends: 195 [2019-11-26 02:55:02,331 INFO L226 Difference]: Without dead ends: 158 [2019-11-26 02:55:02,332 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=455, Invalid=1437, Unknown=0, NotChecked=0, Total=1892 [2019-11-26 02:55:02,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-26 02:55:02,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 43. [2019-11-26 02:55:02,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-26 02:55:02,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2019-11-26 02:55:02,337 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 27 [2019-11-26 02:55:02,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:55:02,338 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2019-11-26 02:55:02,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-26 02:55:02,338 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2019-11-26 02:55:02,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-26 02:55:02,338 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:55:02,338 INFO L410 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] [2019-11-26 02:55:02,539 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-11-26 02:55:02,539 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:55:02,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:55:02,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1364791880, now seen corresponding path program 1 times [2019-11-26 02:55:02,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:55:02,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1550184588] [2019-11-26 02:55:02,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9b4dd95-baf3-4ece-b0cc-28844a20f76e/bin/utaipan/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2019-11-26 02:55:02,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:55:02,594 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-26 02:55:02,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:55:02,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:55:02,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:55:02,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:55:02,818 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:55:02,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:55:02,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:55:02,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1550184588] [2019-11-26 02:55:02,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:55:02,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 12 [2019-11-26 02:55:02,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188689785] [2019-11-26 02:55:02,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-26 02:55:02,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:55:02,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-26 02:55:02,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-11-26 02:55:02,956 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand 12 states. [2019-11-26 02:55:03,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:55:03,901 INFO L93 Difference]: Finished difference Result 125 states and 140 transitions. [2019-11-26 02:55:03,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-26 02:55:03,902 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-11-26 02:55:03,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:55:03,903 INFO L225 Difference]: With dead ends: 125 [2019-11-26 02:55:03,903 INFO L226 Difference]: Without dead ends: 101 [2019-11-26 02:55:03,904 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=199, Invalid=557, Unknown=0, NotChecked=0, Total=756 [2019-11-26 02:55:03,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-26 02:55:03,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 41. [2019-11-26 02:55:03,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-26 02:55:03,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2019-11-26 02:55:03,908 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 28 [2019-11-26 02:55:03,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:55:03,908 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2019-11-26 02:55:03,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-26 02:55:03,908 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2019-11-26 02:55:03,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-26 02:55:03,908 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:55:03,909 INFO L410 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] [2019-11-26 02:55:04,109 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-11-26 02:55:04,109 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:55:04,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:55:04,109 INFO L82 PathProgramCache]: Analyzing trace with hash 430789518, now seen corresponding path program 1 times [2019-11-26 02:55:04,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:55:04,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1005525961] [2019-11-26 02:55:04,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9b4dd95-baf3-4ece-b0cc-28844a20f76e/bin/utaipan/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2019-11-26 02:55:04,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:55:04,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-26 02:55:04,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:55:04,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:55:04,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:55:04,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:55:04,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:55:04,266 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:55:04,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:55:04,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:55:04,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:55:04,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1005525961] [2019-11-26 02:55:04,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:55:04,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-11-26 02:55:04,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961569135] [2019-11-26 02:55:04,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-26 02:55:04,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:55:04,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-26 02:55:04,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-26 02:55:04,471 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 10 states. [2019-11-26 02:55:06,794 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-11-26 02:55:07,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:55:07,059 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2019-11-26 02:55:07,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-26 02:55:07,059 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-11-26 02:55:07,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:55:07,060 INFO L225 Difference]: With dead ends: 52 [2019-11-26 02:55:07,060 INFO L226 Difference]: Without dead ends: 41 [2019-11-26 02:55:07,060 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-11-26 02:55:07,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-26 02:55:07,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-11-26 02:55:07,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-26 02:55:07,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2019-11-26 02:55:07,065 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 32 [2019-11-26 02:55:07,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:55:07,065 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2019-11-26 02:55:07,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-26 02:55:07,065 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2019-11-26 02:55:07,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-26 02:55:07,066 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:55:07,066 INFO L410 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] [2019-11-26 02:55:07,268 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-11-26 02:55:07,269 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:55:07,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:55:07,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1131854096, now seen corresponding path program 1 times [2019-11-26 02:55:07,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:55:07,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [596108832] [2019-11-26 02:55:07,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9b4dd95-baf3-4ece-b0cc-28844a20f76e/bin/utaipan/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-11-26 02:55:07,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:55:07,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-26 02:55:07,362 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:55:07,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:55:07,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:55:07,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:55:07,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:55:07,451 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:55:07,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:55:07,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:55:07,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:55:07,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:55:07,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [596108832] [2019-11-26 02:55:07,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:55:07,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 14 [2019-11-26 02:55:07,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933584440] [2019-11-26 02:55:07,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-26 02:55:07,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:55:07,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-26 02:55:07,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-11-26 02:55:07,585 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand 14 states. [2019-11-26 02:55:08,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:55:08,135 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2019-11-26 02:55:08,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-26 02:55:08,136 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2019-11-26 02:55:08,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:55:08,137 INFO L225 Difference]: With dead ends: 55 [2019-11-26 02:55:08,137 INFO L226 Difference]: Without dead ends: 41 [2019-11-26 02:55:08,137 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2019-11-26 02:55:08,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-26 02:55:08,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2019-11-26 02:55:08,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-26 02:55:08,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-11-26 02:55:08,142 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 32 [2019-11-26 02:55:08,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:55:08,142 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-11-26 02:55:08,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-26 02:55:08,142 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-11-26 02:55:08,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-26 02:55:08,143 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:55:08,143 INFO L410 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] [2019-11-26 02:55:08,343 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-11-26 02:55:08,343 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:55:08,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:55:08,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1713269395, now seen corresponding path program 1 times [2019-11-26 02:55:08,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:55:08,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1526781396] [2019-11-26 02:55:08,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9b4dd95-baf3-4ece-b0cc-28844a20f76e/bin/utaipan/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2019-11-26 02:55:08,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:55:08,411 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-26 02:55:08,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:55:08,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:55:08,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:55:08,605 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:55:08,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:55:08,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:55:08,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1526781396] [2019-11-26 02:55:08,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:55:08,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-11-26 02:55:08,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820174991] [2019-11-26 02:55:08,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-26 02:55:08,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:55:08,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-26 02:55:08,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-26 02:55:08,722 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 12 states. [2019-11-26 02:55:09,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:55:09,803 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2019-11-26 02:55:09,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-26 02:55:09,804 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2019-11-26 02:55:09,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:55:09,804 INFO L225 Difference]: With dead ends: 79 [2019-11-26 02:55:09,805 INFO L226 Difference]: Without dead ends: 61 [2019-11-26 02:55:09,805 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-11-26 02:55:09,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-26 02:55:09,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 39. [2019-11-26 02:55:09,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-26 02:55:09,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2019-11-26 02:55:09,810 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 33 [2019-11-26 02:55:09,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:55:09,810 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2019-11-26 02:55:09,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-26 02:55:09,810 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2019-11-26 02:55:09,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-26 02:55:09,810 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:55:09,810 INFO L410 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] [2019-11-26 02:55:10,011 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-11-26 02:55:10,011 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:55:10,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:55:10,011 INFO L82 PathProgramCache]: Analyzing trace with hash 739407273, now seen corresponding path program 1 times [2019-11-26 02:55:10,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:55:10,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [327271220] [2019-11-26 02:55:10,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9b4dd95-baf3-4ece-b0cc-28844a20f76e/bin/utaipan/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2019-11-26 02:55:10,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:55:10,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-26 02:55:10,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:55:10,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:55:10,086 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:55:10,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:55:10,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [327271220] [2019-11-26 02:55:10,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:55:10,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-26 02:55:10,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972039419] [2019-11-26 02:55:10,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:55:10,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:55:10,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:55:10,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:55:10,089 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 4 states. [2019-11-26 02:55:10,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:55:10,107 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2019-11-26 02:55:10,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:55:10,107 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-26 02:55:10,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:55:10,108 INFO L225 Difference]: With dead ends: 39 [2019-11-26 02:55:10,108 INFO L226 Difference]: Without dead ends: 0 [2019-11-26 02:55:10,108 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:55:10,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-26 02:55:10,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-26 02:55:10,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-26 02:55:10,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-26 02:55:10,108 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2019-11-26 02:55:10,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:55:10,109 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-26 02:55:10,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:55:10,109 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-26 02:55:10,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-26 02:55:10,309 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-11-26 02:55:10,312 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-26 02:55:10,544 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 89 [2019-11-26 02:55:10,663 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 121 [2019-11-26 02:55:10,885 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 135 [2019-11-26 02:55:11,658 WARN L192 SmtUtils]: Spent 694.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 39 [2019-11-26 02:55:12,248 WARN L192 SmtUtils]: Spent 588.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 26 [2019-11-26 02:55:12,499 WARN L192 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 23 [2019-11-26 02:55:13,057 WARN L192 SmtUtils]: Spent 557.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 32 [2019-11-26 02:55:13,487 WARN L192 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 34 [2019-11-26 02:55:13,740 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 32 [2019-11-26 02:55:14,434 WARN L192 SmtUtils]: Spent 693.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 36 [2019-11-26 02:55:14,878 WARN L192 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 42 [2019-11-26 02:55:15,022 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 23 [2019-11-26 02:55:15,096 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2019-11-26 02:55:15,096 INFO L447 ceAbstractionStarter]: At program point L85(lines 57 86) the Hoare annotation is: true [2019-11-26 02:55:15,096 INFO L444 ceAbstractionStarter]: For program point L44(lines 44 46) no Hoare annotation was computed. [2019-11-26 02:55:15,096 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-26 02:55:15,096 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-26 02:55:15,096 INFO L444 ceAbstractionStarter]: For program point L37(lines 37 40) no Hoare annotation was computed. [2019-11-26 02:55:15,097 INFO L444 ceAbstractionStarter]: For program point L37-1(lines 37 40) no Hoare annotation was computed. [2019-11-26 02:55:15,097 INFO L444 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-26 02:55:15,097 INFO L444 ceAbstractionStarter]: For program point L79-2(lines 79 82) no Hoare annotation was computed. [2019-11-26 02:55:15,097 INFO L440 ceAbstractionStarter]: At program point L55(line 55) the Hoare annotation is: (let ((.cse0 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (or (and .cse0 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)) (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not .cse0)))) [2019-11-26 02:55:15,097 INFO L440 ceAbstractionStarter]: At program point L55-1(line 55) the Hoare annotation is: (and |ULTIMATE.start_main_#t~short9| (let ((.cse0 (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (or (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not .cse0)) (and .cse0 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)))) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) [2019-11-26 02:55:15,097 INFO L440 ceAbstractionStarter]: At program point L55-2(line 55) the Hoare annotation is: (let ((.cse1 (not |ULTIMATE.start_main_#t~short13|)) (.cse2 (not |ULTIMATE.start_main_#t~short9|)) (.cse0 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (or (and .cse0 .cse1 .cse2 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)) (and .cse1 (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) .cse2 (not (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (not .cse0)))) [2019-11-26 02:55:15,097 INFO L440 ceAbstractionStarter]: At program point L55-3(line 55) the Hoare annotation is: (and (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) (not |ULTIMATE.start_main_#t~short13|) (not |ULTIMATE.start_main_#t~short9|) (let ((.cse0 (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (or (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not .cse0)) (and .cse0 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)))) |ULTIMATE.start_main_#t~short12|) [2019-11-26 02:55:15,097 INFO L440 ceAbstractionStarter]: At program point L55-4(line 55) the Hoare annotation is: (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0))) (.cse1 (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|)) (.cse2 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmax_float_~y)) (.cse3 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)))) (or (and (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_fmax_float_~y .cse0) .cse1 .cse2 (not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x)) .cse3 (fp.eq |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~y~0) (= ULTIMATE.start_fmax_float_~y ULTIMATE.start___fpclassify_float_~x)) (and (not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y)) (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~x~0) (fp.eq |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~x~0) (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~x~0) .cse2 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) (not (fp.eq .cse0 .cse0))) (and (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) .cse1 (= ULTIMATE.start_main_~y~0 |ULTIMATE.start_fmax_float_#res|) .cse2 .cse3 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~res~0)))) [2019-11-26 02:55:15,097 INFO L440 ceAbstractionStarter]: At program point L55-5(line 55) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmax_float_~y)) (.cse1 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (.cse2 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|))) (or (and |ULTIMATE.start_main_#t~short17| (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_fmax_float_~y (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0))) .cse0 (not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x)) .cse1 (fp.eq |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~y~0) .cse2 (= ULTIMATE.start_fmax_float_~y ULTIMATE.start___fpclassify_float_~x)) (and |ULTIMATE.start_main_#t~short17| (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~y~0 |ULTIMATE.start_fmax_float_#res|) .cse0 .cse1 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~res~0) .cse2))) [2019-11-26 02:55:15,097 INFO L440 ceAbstractionStarter]: At program point L55-6(line 55) the Hoare annotation is: (or (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (and (not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y)) (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~x~0) (fp.eq |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~x~0) (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmax_float_~y) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) (not (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))) (fp.eq .cse0 .cse0))))) [2019-11-26 02:55:15,098 INFO L440 ceAbstractionStarter]: At program point L55-7(line 55) the Hoare annotation is: (and (not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y)) (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~x~0) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (fp.eq |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~x~0) (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmax_float_~y) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) (not (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))) (fp.eq .cse0 .cse0)))) [2019-11-26 02:55:15,098 INFO L444 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2019-11-26 02:55:15,098 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 40) no Hoare annotation was computed. [2019-11-26 02:55:15,098 INFO L444 ceAbstractionStarter]: For program point L31-1(lines 31 40) no Hoare annotation was computed. [2019-11-26 02:55:15,098 INFO L444 ceAbstractionStarter]: For program point L23-1(lines 23 27) no Hoare annotation was computed. [2019-11-26 02:55:15,098 INFO L440 ceAbstractionStarter]: At program point L23-2(lines 23 27) the Hoare annotation is: (let ((.cse1 (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y)) (.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmax_float_~y))) (or (and .cse0 (not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x)) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) .cse1) (and (not .cse1) (= ULTIMATE.start_main_~x~0 ULTIMATE.start_fmax_float_~x) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (= ULTIMATE.start_fmax_float_~x ULTIMATE.start___fpclassify_float_~x) (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x) .cse0))) [2019-11-26 02:55:15,098 INFO L444 ceAbstractionStarter]: For program point L23-3(lines 20 41) no Hoare annotation was computed. [2019-11-26 02:55:15,098 INFO L444 ceAbstractionStarter]: For program point L23-5(lines 23 27) no Hoare annotation was computed. [2019-11-26 02:55:15,098 INFO L440 ceAbstractionStarter]: At program point L23-6(lines 23 27) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmax_float_~y)) (.cse1 (= ULTIMATE.start_fmax_float_~y ULTIMATE.start___fpclassify_float_~x))) (or (and .cse0 (not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x)) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)) .cse1 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y)) (and (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~x~0) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) .cse0 (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) .cse1))) [2019-11-26 02:55:15,098 INFO L444 ceAbstractionStarter]: For program point L23-7(lines 20 41) no Hoare annotation was computed. [2019-11-26 02:55:15,098 INFO L444 ceAbstractionStarter]: For program point L48(lines 48 50) no Hoare annotation was computed. [2019-11-26 02:55:15,099 INFO L444 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-26 02:55:15,099 INFO L440 ceAbstractionStarter]: At program point L40(lines 20 41) the Hoare annotation is: (let ((.cse1 (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y)) (.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmax_float_~y))) (or (and .cse0 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)) (not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x)) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) .cse1) (and (not .cse1) (= ULTIMATE.start_main_~x~0 ULTIMATE.start_fmax_float_~x) (not (= (_ bv0 32) |ULTIMATE.start___fpclassify_float_#res|)) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (= ULTIMATE.start_fmax_float_~x ULTIMATE.start___fpclassify_float_~x) (= ULTIMATE.start_fmax_float_~x (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0))) (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x) .cse0))) [2019-11-26 02:55:15,099 INFO L440 ceAbstractionStarter]: At program point L40-1(lines 20 41) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmax_float_~y)) (.cse1 (= (_ bv0 32) |ULTIMATE.start___fpclassify_float_#res|)) (.cse0 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0))) (.cse3 (= ULTIMATE.start_fmax_float_~y ULTIMATE.start___fpclassify_float_~x))) (or (and (= ULTIMATE.start_fmax_float_~y .cse0) (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_main_~y~0) (not .cse1) .cse2 (not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x)) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)) .cse3) (and (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~x~0) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) .cse2 .cse1 (not (fp.eq .cse0 .cse0)) .cse3 (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x))))) [2019-11-26 02:55:15,099 INFO L444 ceAbstractionStarter]: For program point L73-2(lines 73 76) no Hoare annotation was computed. [2019-11-26 02:55:15,099 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-26 02:55:15,099 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 74) no Hoare annotation was computed. [2019-11-26 02:55:15,099 INFO L444 ceAbstractionStarter]: For program point L74(line 74) no Hoare annotation was computed. [2019-11-26 02:55:15,099 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-26 02:55:15,099 INFO L444 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-26 02:55:15,099 INFO L444 ceAbstractionStarter]: For program point L34(lines 34 40) no Hoare annotation was computed. [2019-11-26 02:55:15,099 INFO L444 ceAbstractionStarter]: For program point L67-2(line 67) no Hoare annotation was computed. [2019-11-26 02:55:15,099 INFO L444 ceAbstractionStarter]: For program point L34-1(lines 34 40) no Hoare annotation was computed. [2019-11-26 02:55:15,099 INFO L444 ceAbstractionStarter]: For program point L67-3(lines 67 68) no Hoare annotation was computed. [2019-11-26 02:55:15,100 INFO L444 ceAbstractionStarter]: For program point L67-5(lines 67 83) no Hoare annotation was computed. [2019-11-26 02:55:15,100 INFO L444 ceAbstractionStarter]: For program point L67-7(lines 67 83) no Hoare annotation was computed. [2019-11-26 02:55:15,100 INFO L444 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-11-26 02:55:15,100 INFO L444 ceAbstractionStarter]: For program point L51-2(line 51) no Hoare annotation was computed. [2019-11-26 02:55:15,100 INFO L440 ceAbstractionStarter]: At program point L51-3(lines 43 52) the Hoare annotation is: (let ((.cse1 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmax_float_~y)) (.cse2 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))) (or (and (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~y~0 |ULTIMATE.start_fmax_float_#res|) .cse0 .cse1 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)) (and (= ULTIMATE.start_fmax_float_~y .cse2) .cse0 (not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x)) .cse1 (fp.eq |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~y~0) (= ULTIMATE.start_fmax_float_~y ULTIMATE.start___fpclassify_float_~x)) (and (not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y)) (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~x~0) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (fp.eq |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~x~0) .cse0 (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) (not (fp.eq .cse2 .cse2))))) [2019-11-26 02:55:15,100 INFO L444 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2019-11-26 02:55:15,100 INFO L444 ceAbstractionStarter]: For program point L68-2(line 68) no Hoare annotation was computed. [2019-11-26 02:55:15,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:55:15 BoogieIcfgContainer [2019-11-26 02:55:15,124 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:55:15,125 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:55:15,125 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:55:15,125 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:55:15,126 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:54:45" (3/4) ... [2019-11-26 02:55:15,129 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-26 02:55:15,141 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2019-11-26 02:55:15,142 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-11-26 02:55:15,142 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-26 02:55:15,168 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (~fp.eq~FLOAT(x, x) && 0bv32 == \result) || (1bv32 == \result && !~fp.eq~FLOAT(x, x)) [2019-11-26 02:55:15,168 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (aux-isnan_float(x) && !isnan_float(y)-aux && ((1bv32 == \result && !~fp.eq~FLOAT(y, y)) || (~fp.eq~FLOAT(y, y) && 0bv32 == \result))) && !~fp.eq~FLOAT(x, x) [2019-11-26 02:55:15,168 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((~fp.eq~FLOAT(x, x) && !aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux) && !aux-isnan_float(x) && !isnan_float(y)-aux) && 0bv32 == \result) || ((((!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux && 1bv32 == \result) && !aux-isnan_float(x) && !isnan_float(y)-aux) && !~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) [2019-11-26 02:55:15,169 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((~fp.eq~FLOAT(x, x) && !aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux) && !aux-isnan_float(x) && !isnan_float(y)-aux) && ((1bv32 == \result && !~fp.eq~FLOAT(y, y)) || (~fp.eq~FLOAT(y, y) && 0bv32 == \result))) && aux-!isnan_float(x) && isnan_float(y)-aux [2019-11-26 02:55:15,169 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((y == y && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && ~fp.eq~FLOAT(y, y)) || (((((!~fp.eq~FLOAT(y, y) && x == x) && 1bv32 == \result) && x == x) && ~fp.eq~FLOAT(x, x)) && y == y) [2019-11-26 02:55:15,169 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((y == y && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && ~fp.eq~FLOAT(y, y)) || (((((((!~fp.eq~FLOAT(y, y) && x == x) && !(0bv32 == \result)) && 1bv32 == \result) && x == x) && x == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && ~fp.eq~FLOAT(x, x)) && y == y) [2019-11-26 02:55:15,170 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((~fp.eq~FLOAT(y, y) && y == \result) && y == y) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) || (((((y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) && y == y) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y)) && y == x)) || ((((((!~fp.eq~FLOAT(y, y) && ~fp.eq~FLOAT(x, x)) && 1bv32 == \result) && ~fp.eq~FLOAT(\result, x)) && y == y) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) [2019-11-26 02:55:15,170 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((y == y && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && y == x) && 0bv32 == \result) && ~fp.eq~FLOAT(y, y)) || ((((~fp.eq~FLOAT(x, x) && 1bv32 == \result) && y == y) && !~fp.eq~FLOAT(x, x)) && y == x) [2019-11-26 02:55:15,170 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((~fp.eq~FLOAT(res, y) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && 1bv32 == \result) && y == y) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y)) && y == x) || (((((((!~fp.eq~FLOAT(y, y) && ~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, x)) && ~fp.eq~FLOAT(res, x)) && y == y) && 0bv32 == \result) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])))) || (((((~fp.eq~FLOAT(y, y) && 1bv32 == \result) && y == \result) && y == y) && !~fp.eq~FLOAT(x, x)) && y == res) [2019-11-26 02:55:15,171 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) && ~fp.eq~FLOAT(y, y)) && !(0bv32 == \result)) && y == y) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && y == x) || ((((((~fp.eq~FLOAT(x, x) && 1bv32 == \result) && y == y) && 0bv32 == \result) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) && y == x) && !~fp.eq~FLOAT(x, x)) [2019-11-26 02:55:15,171 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((aux-isnan_float(x) && !isnan_float(y)-aux && ~fp.eq~FLOAT(res, y)) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && y == y) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y)) && 0bv32 == \result) && y == x) || ((((((aux-isnan_float(x) && !isnan_float(y)-aux && ~fp.eq~FLOAT(y, y)) && y == \result) && y == y) && !~fp.eq~FLOAT(x, x)) && y == res) && 0bv32 == \result) [2019-11-26 02:55:15,171 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (1bv32 == \result && !~fp.eq~FLOAT(x, x)) || (((((((!~fp.eq~FLOAT(y, y) && ~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, x)) && ~fp.eq~FLOAT(res, x)) && y == y) && 0bv32 == \result) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) [2019-11-26 02:55:15,172 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!~fp.eq~FLOAT(y, y) && ~fp.eq~FLOAT(x, x)) && 1bv32 == \result) && ~fp.eq~FLOAT(\result, x)) && ~fp.eq~FLOAT(res, x)) && y == y) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) [2019-11-26 02:55:15,203 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_f9b4dd95-baf3-4ece-b0cc-28844a20f76e/bin/utaipan/witness.graphml [2019-11-26 02:55:15,203 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:55:15,204 INFO L168 Benchmark]: Toolchain (without parser) took 30821.12 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 299.9 MB). Free memory was 961.8 MB in the beginning and 969.7 MB in the end (delta: -7.9 MB). Peak memory consumption was 292.0 MB. Max. memory is 11.5 GB. [2019-11-26 02:55:15,205 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:55:15,205 INFO L168 Benchmark]: CACSL2BoogieTranslator took 277.65 ms. Allocated memory is still 1.0 GB. Free memory was 961.8 MB in the beginning and 951.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-26 02:55:15,205 INFO L168 Benchmark]: Boogie Procedure Inliner took 136.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -171.7 MB). Peak memory consumption was 10.0 MB. Max. memory is 11.5 GB. [2019-11-26 02:55:15,206 INFO L168 Benchmark]: Boogie Preprocessor took 67.38 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. [2019-11-26 02:55:15,206 INFO L168 Benchmark]: RCFGBuilder took 472.97 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: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. [2019-11-26 02:55:15,207 INFO L168 Benchmark]: TraceAbstraction took 29783.83 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 172.0 MB). Free memory was 1.1 GB in the beginning and 979.1 MB in the end (delta: 112.8 MB). Peak memory consumption was 415.5 MB. Max. memory is 11.5 GB. [2019-11-26 02:55:15,207 INFO L168 Benchmark]: Witness Printer took 78.63 ms. Allocated memory is still 1.3 GB. Free memory was 979.1 MB in the beginning and 969.7 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:55:15,209 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 277.65 ms. Allocated memory is still 1.0 GB. Free memory was 961.8 MB in the beginning and 951.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 136.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -171.7 MB). Peak memory consumption was 10.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 67.38 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 472.97 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: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 29783.83 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 172.0 MB). Free memory was 1.1 GB in the beginning and 979.1 MB in the end (delta: 112.8 MB). Peak memory consumption was 415.5 MB. Max. memory is 11.5 GB. * Witness Printer took 78.63 ms. Allocated memory is still 1.3 GB. Free memory was 979.1 MB in the beginning and 969.7 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 80]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 74]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: (((((~fp.eq~FLOAT(y, y) && y == \result) && y == y) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) || (((((y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) && y == y) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y)) && y == x)) || ((((((!~fp.eq~FLOAT(y, y) && ~fp.eq~FLOAT(x, x)) && 1bv32 == \result) && ~fp.eq~FLOAT(\result, x)) && y == y) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((((((!~fp.eq~FLOAT(y, y) && ~fp.eq~FLOAT(x, x)) && 1bv32 == \result) && ~fp.eq~FLOAT(\result, x)) && ~fp.eq~FLOAT(res, x)) && y == y) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: (1bv32 == \result && !~fp.eq~FLOAT(x, x)) || (((((((!~fp.eq~FLOAT(y, y) && ~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, x)) && ~fp.eq~FLOAT(res, x)) && y == y) && 0bv32 == \result) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (((((y == y && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && y == x) && 0bv32 == \result) && ~fp.eq~FLOAT(y, y)) || ((((~fp.eq~FLOAT(x, x) && 1bv32 == \result) && y == y) && !~fp.eq~FLOAT(x, x)) && y == x) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((((((y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) && ~fp.eq~FLOAT(y, y)) && !(0bv32 == \result)) && y == y) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && y == x) || ((((((~fp.eq~FLOAT(x, x) && 1bv32 == \result) && y == y) && 0bv32 == \result) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) && y == x) && !~fp.eq~FLOAT(x, x)) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((((((((aux-isnan_float(x) && !isnan_float(y)-aux && ~fp.eq~FLOAT(res, y)) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && y == y) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y)) && 0bv32 == \result) && y == x) || ((((((aux-isnan_float(x) && !isnan_float(y)-aux && ~fp.eq~FLOAT(y, y)) && y == \result) && y == y) && !~fp.eq~FLOAT(x, x)) && y == res) && 0bv32 == \result) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((((y == y && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && ~fp.eq~FLOAT(y, y)) || (((((((!~fp.eq~FLOAT(y, y) && x == x) && !(0bv32 == \result)) && 1bv32 == \result) && x == x) && x == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && ~fp.eq~FLOAT(x, x)) && y == y) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((((((((~fp.eq~FLOAT(res, y) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && 1bv32 == \result) && y == y) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y)) && y == x) || (((((((!~fp.eq~FLOAT(y, y) && ~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, x)) && ~fp.eq~FLOAT(res, x)) && y == y) && 0bv32 == \result) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])))) || (((((~fp.eq~FLOAT(y, y) && 1bv32 == \result) && y == \result) && y == y) && !~fp.eq~FLOAT(x, x)) && y == res) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: (((~fp.eq~FLOAT(x, x) && !aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux) && !aux-isnan_float(x) && !isnan_float(y)-aux) && ((1bv32 == \result && !~fp.eq~FLOAT(y, y)) || (~fp.eq~FLOAT(y, y) && 0bv32 == \result))) && aux-!isnan_float(x) && isnan_float(y)-aux - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: (((~fp.eq~FLOAT(x, x) && !aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux) && !aux-isnan_float(x) && !isnan_float(y)-aux) && 0bv32 == \result) || ((((!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux && 1bv32 == \result) && !aux-isnan_float(x) && !isnan_float(y)-aux) && !~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: ((((y == y && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && ~fp.eq~FLOAT(y, y)) || (((((!~fp.eq~FLOAT(y, y) && x == x) && 1bv32 == \result) && x == x) && ~fp.eq~FLOAT(x, x)) && y == y) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: (aux-isnan_float(x) && !isnan_float(y)-aux && ((1bv32 == \result && !~fp.eq~FLOAT(y, y)) || (~fp.eq~FLOAT(y, y) && 0bv32 == \result))) && !~fp.eq~FLOAT(x, x) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: (~fp.eq~FLOAT(x, x) && 0bv32 == \result) || (1bv32 == \result && !~fp.eq~FLOAT(x, x)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 47 locations, 2 error locations. Result: SAFE, OverallTime: 29.7s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 15.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.7s, HoareTripleCheckerStatistics: 1149 SDtfs, 2775 SDslu, 4393 SDs, 0 SdLazy, 1921 SolverSat, 269 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 9.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1042 GetRequests, 770 SyntacticMatches, 10 SemanticMatches, 262 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 917 ImplicationChecksByTransitivity, 7.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 578 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 48 NumberOfFragments, 611 HoareAnnotationTreeSize, 14 FomulaSimplifications, 639714 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 14 FomulaSimplificationsInter, 24534 FormulaSimplificationTreeSizeReductionInter, 4.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 479 NumberOfCodeBlocks, 479 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 920 ConstructedInterpolants, 31 QuantifiedInterpolants, 93501 SizeOfPredicates, 149 NumberOfNonLiveVariables, 1413 ConjunctsInSsa, 188 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...