./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f756365182c9801d4a2ac186a40692687a86b469 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f756365182c9801d4a2ac186a40692687a86b469 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 21:19:39,669 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 21:19:39,670 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 21:19:39,676 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 21:19:39,676 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 21:19:39,677 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 21:19:39,678 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 21:19:39,678 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 21:19:39,679 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 21:19:39,680 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 21:19:39,680 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 21:19:39,680 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 21:19:39,681 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 21:19:39,681 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 21:19:39,682 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 21:19:39,682 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 21:19:39,682 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 21:19:39,683 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 21:19:39,684 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 21:19:39,685 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 21:19:39,685 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 21:19:39,686 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 21:19:39,687 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 21:19:39,687 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 21:19:39,687 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 21:19:39,688 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 21:19:39,688 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 21:19:39,689 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 21:19:39,689 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 21:19:39,690 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 21:19:39,690 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 21:19:39,690 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 21:19:39,690 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 21:19:39,690 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 21:19:39,691 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 21:19:39,691 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 21:19:39,691 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-02 21:19:39,698 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 21:19:39,698 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 21:19:39,699 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 21:19:39,699 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 21:19:39,699 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 21:19:39,699 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 21:19:39,699 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 21:19:39,700 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 21:19:39,700 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 21:19:39,700 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 21:19:39,700 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 21:19:39,700 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 21:19:39,700 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 21:19:39,700 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 21:19:39,700 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 21:19:39,700 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 21:19:39,700 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 21:19:39,701 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 21:19:39,701 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 21:19:39,701 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 21:19:39,701 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 21:19:39,701 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 21:19:39,701 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 21:19:39,701 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 21:19:39,701 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 21:19:39,701 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 21:19:39,701 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 21:19:39,701 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 21:19:39,702 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 21:19:39,702 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 21:19:39,702 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f756365182c9801d4a2ac186a40692687a86b469 [2018-12-02 21:19:39,719 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 21:19:39,729 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 21:19:39,731 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 21:19:39,733 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 21:19:39,733 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 21:19:39,733 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/../../sv-benchmarks/c/bitvector/soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-12-02 21:19:39,768 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/data/15be1ea65/ca3eabc2ebd249c897daef784af1b29b/FLAG1c91afbc6 [2018-12-02 21:19:40,121 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 21:19:40,122 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/sv-benchmarks/c/bitvector/soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-12-02 21:19:40,127 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/data/15be1ea65/ca3eabc2ebd249c897daef784af1b29b/FLAG1c91afbc6 [2018-12-02 21:19:40,520 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/data/15be1ea65/ca3eabc2ebd249c897daef784af1b29b [2018-12-02 21:19:40,526 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 21:19:40,528 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 21:19:40,529 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 21:19:40,529 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 21:19:40,533 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 21:19:40,534 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:19:40" (1/1) ... [2018-12-02 21:19:40,537 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@349867cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:19:40, skipping insertion in model container [2018-12-02 21:19:40,537 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:19:40" (1/1) ... [2018-12-02 21:19:40,542 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 21:19:40,556 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 21:19:40,663 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 21:19:40,665 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 21:19:40,691 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 21:19:40,699 INFO L195 MainTranslator]: Completed translation [2018-12-02 21:19:40,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:19:40 WrapperNode [2018-12-02 21:19:40,699 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 21:19:40,700 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 21:19:40,700 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 21:19:40,700 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 21:19:40,737 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:19:40" (1/1) ... [2018-12-02 21:19:40,742 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:19:40" (1/1) ... [2018-12-02 21:19:40,746 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 21:19:40,746 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 21:19:40,746 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 21:19:40,746 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 21:19:40,752 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:19:40" (1/1) ... [2018-12-02 21:19:40,752 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:19:40" (1/1) ... [2018-12-02 21:19:40,753 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:19:40" (1/1) ... [2018-12-02 21:19:40,753 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:19:40" (1/1) ... [2018-12-02 21:19:40,757 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:19:40" (1/1) ... [2018-12-02 21:19:40,761 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:19:40" (1/1) ... [2018-12-02 21:19:40,762 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:19:40" (1/1) ... [2018-12-02 21:19:40,764 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 21:19:40,764 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 21:19:40,764 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 21:19:40,764 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 21:19:40,764 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:19:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 21:19:40,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 21:19:40,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 21:19:40,796 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2018-12-02 21:19:40,796 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2018-12-02 21:19:40,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 21:19:40,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 21:19:40,796 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 21:19:40,796 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 21:19:40,796 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2018-12-02 21:19:40,796 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2018-12-02 21:19:40,797 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-02 21:19:40,797 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-02 21:19:40,985 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 21:19:40,985 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-02 21:19:40,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:19:40 BoogieIcfgContainer [2018-12-02 21:19:40,985 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 21:19:40,986 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 21:19:40,986 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 21:19:40,988 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 21:19:40,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 09:19:40" (1/3) ... [2018-12-02 21:19:40,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@291cee05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:19:40, skipping insertion in model container [2018-12-02 21:19:40,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:19:40" (2/3) ... [2018-12-02 21:19:40,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@291cee05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:19:40, skipping insertion in model container [2018-12-02 21:19:40,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:19:40" (3/3) ... [2018-12-02 21:19:40,990 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-12-02 21:19:40,995 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 21:19:40,999 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 21:19:41,008 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 21:19:41,024 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 21:19:41,025 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 21:19:41,025 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 21:19:41,025 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 21:19:41,025 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 21:19:41,025 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 21:19:41,025 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 21:19:41,025 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 21:19:41,025 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 21:19:41,036 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states. [2018-12-02 21:19:41,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 21:19:41,040 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:19:41,040 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:19:41,042 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:19:41,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:19:41,045 INFO L82 PathProgramCache]: Analyzing trace with hash -441638981, now seen corresponding path program 1 times [2018-12-02 21:19:41,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:19:41,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:19:41,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:19:41,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:19:41,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:19:41,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:19:41,218 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-02 21:19:41,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:19:41,220 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:19:41,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:19:41,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:19:41,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:19:41,354 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 21:19:41,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:19:41,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11] total 13 [2018-12-02 21:19:41,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 21:19:41,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 21:19:41,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-02 21:19:41,391 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 13 states. [2018-12-02 21:19:41,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:19:41,790 INFO L93 Difference]: Finished difference Result 220 states and 359 transitions. [2018-12-02 21:19:41,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-02 21:19:41,791 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-12-02 21:19:41,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:19:41,800 INFO L225 Difference]: With dead ends: 220 [2018-12-02 21:19:41,800 INFO L226 Difference]: Without dead ends: 141 [2018-12-02 21:19:41,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2018-12-02 21:19:41,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-12-02 21:19:41,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 118. [2018-12-02 21:19:41,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-02 21:19:41,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 170 transitions. [2018-12-02 21:19:41,843 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 170 transitions. Word has length 36 [2018-12-02 21:19:41,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:19:41,843 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 170 transitions. [2018-12-02 21:19:41,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 21:19:41,843 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 170 transitions. [2018-12-02 21:19:41,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-02 21:19:41,844 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:19:41,845 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:19:41,845 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:19:41,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:19:41,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1206867801, now seen corresponding path program 1 times [2018-12-02 21:19:41,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:19:41,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:19:41,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:19:41,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:19:41,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:19:41,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:19:41,961 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-02 21:19:41,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:19:41,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 21:19:41,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 21:19:41,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 21:19:41,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-02 21:19:41,963 INFO L87 Difference]: Start difference. First operand 118 states and 170 transitions. Second operand 8 states. [2018-12-02 21:19:42,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:19:42,046 INFO L93 Difference]: Finished difference Result 255 states and 375 transitions. [2018-12-02 21:19:42,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 21:19:42,046 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-12-02 21:19:42,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:19:42,049 INFO L225 Difference]: With dead ends: 255 [2018-12-02 21:19:42,049 INFO L226 Difference]: Without dead ends: 182 [2018-12-02 21:19:42,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-02 21:19:42,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-12-02 21:19:42,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 178. [2018-12-02 21:19:42,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-12-02 21:19:42,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 249 transitions. [2018-12-02 21:19:42,066 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 249 transitions. Word has length 40 [2018-12-02 21:19:42,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:19:42,067 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 249 transitions. [2018-12-02 21:19:42,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 21:19:42,067 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 249 transitions. [2018-12-02 21:19:42,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-02 21:19:42,068 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:19:42,068 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:19:42,068 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:19:42,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:19:42,068 INFO L82 PathProgramCache]: Analyzing trace with hash -985162678, now seen corresponding path program 1 times [2018-12-02 21:19:42,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:19:42,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:19:42,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:19:42,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:19:42,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:19:42,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:19:42,246 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 21:19:42,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:19:42,246 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:19:42,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:19:42,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:19:42,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:19:42,408 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 21:19:42,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:19:42,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 19 [2018-12-02 21:19:42,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-02 21:19:42,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 21:19:42,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2018-12-02 21:19:42,424 INFO L87 Difference]: Start difference. First operand 178 states and 249 transitions. Second operand 19 states. [2018-12-02 21:19:42,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:19:42,892 INFO L93 Difference]: Finished difference Result 344 states and 501 transitions. [2018-12-02 21:19:42,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-02 21:19:42,893 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 44 [2018-12-02 21:19:42,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:19:42,895 INFO L225 Difference]: With dead ends: 344 [2018-12-02 21:19:42,895 INFO L226 Difference]: Without dead ends: 271 [2018-12-02 21:19:42,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=878, Unknown=0, NotChecked=0, Total=992 [2018-12-02 21:19:42,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-12-02 21:19:42,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 236. [2018-12-02 21:19:42,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-12-02 21:19:42,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 330 transitions. [2018-12-02 21:19:42,915 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 330 transitions. Word has length 44 [2018-12-02 21:19:42,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:19:42,915 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 330 transitions. [2018-12-02 21:19:42,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-02 21:19:42,915 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 330 transitions. [2018-12-02 21:19:42,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-02 21:19:42,917 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:19:42,917 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:19:42,917 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:19:42,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:19:42,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1720292238, now seen corresponding path program 1 times [2018-12-02 21:19:42,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:19:42,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:19:42,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:19:42,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:19:42,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:19:42,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:19:43,025 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-02 21:19:43,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:19:43,026 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:19:43,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:19:43,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:19:43,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:19:43,121 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-02 21:19:43,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:19:43,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2018-12-02 21:19:43,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-02 21:19:43,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 21:19:43,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-12-02 21:19:43,136 INFO L87 Difference]: Start difference. First operand 236 states and 330 transitions. Second operand 17 states. [2018-12-02 21:19:43,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:19:43,565 INFO L93 Difference]: Finished difference Result 388 states and 561 transitions. [2018-12-02 21:19:43,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-02 21:19:43,565 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 44 [2018-12-02 21:19:43,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:19:43,566 INFO L225 Difference]: With dead ends: 388 [2018-12-02 21:19:43,566 INFO L226 Difference]: Without dead ends: 324 [2018-12-02 21:19:43,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=870, Unknown=0, NotChecked=0, Total=992 [2018-12-02 21:19:43,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-12-02 21:19:43,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 228. [2018-12-02 21:19:43,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-12-02 21:19:43,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 316 transitions. [2018-12-02 21:19:43,578 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 316 transitions. Word has length 44 [2018-12-02 21:19:43,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:19:43,578 INFO L480 AbstractCegarLoop]: Abstraction has 228 states and 316 transitions. [2018-12-02 21:19:43,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-02 21:19:43,578 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 316 transitions. [2018-12-02 21:19:43,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 21:19:43,579 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:19:43,579 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:19:43,579 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:19:43,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:19:43,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1063865541, now seen corresponding path program 1 times [2018-12-02 21:19:43,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:19:43,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:19:43,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:19:43,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:19:43,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:19:43,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:19:43,733 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-02 21:19:43,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:19:43,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-02 21:19:43,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 21:19:43,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 21:19:43,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-12-02 21:19:43,734 INFO L87 Difference]: Start difference. First operand 228 states and 316 transitions. Second operand 14 states. [2018-12-02 21:19:43,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:19:43,986 INFO L93 Difference]: Finished difference Result 399 states and 578 transitions. [2018-12-02 21:19:43,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 21:19:43,987 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 48 [2018-12-02 21:19:43,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:19:43,988 INFO L225 Difference]: With dead ends: 399 [2018-12-02 21:19:43,988 INFO L226 Difference]: Without dead ends: 333 [2018-12-02 21:19:43,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-12-02 21:19:43,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-12-02 21:19:43,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 316. [2018-12-02 21:19:43,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-12-02 21:19:43,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 443 transitions. [2018-12-02 21:19:43,999 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 443 transitions. Word has length 48 [2018-12-02 21:19:43,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:19:43,999 INFO L480 AbstractCegarLoop]: Abstraction has 316 states and 443 transitions. [2018-12-02 21:19:43,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 21:19:43,999 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 443 transitions. [2018-12-02 21:19:44,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 21:19:44,000 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:19:44,000 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:19:44,000 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:19:44,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:19:44,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1641589375, now seen corresponding path program 1 times [2018-12-02 21:19:44,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:19:44,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:19:44,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:19:44,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:19:44,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:19:44,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:19:44,069 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 21:19:44,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:19:44,069 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:19:44,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:19:44,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:19:44,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:19:44,095 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 21:19:44,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:19:44,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-12-02 21:19:44,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 21:19:44,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 21:19:44,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-02 21:19:44,111 INFO L87 Difference]: Start difference. First operand 316 states and 443 transitions. Second operand 8 states. [2018-12-02 21:19:44,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:19:44,207 INFO L93 Difference]: Finished difference Result 388 states and 545 transitions. [2018-12-02 21:19:44,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 21:19:44,207 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 48 [2018-12-02 21:19:44,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:19:44,209 INFO L225 Difference]: With dead ends: 388 [2018-12-02 21:19:44,209 INFO L226 Difference]: Without dead ends: 349 [2018-12-02 21:19:44,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-02 21:19:44,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-12-02 21:19:44,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 335. [2018-12-02 21:19:44,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-12-02 21:19:44,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 466 transitions. [2018-12-02 21:19:44,223 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 466 transitions. Word has length 48 [2018-12-02 21:19:44,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:19:44,223 INFO L480 AbstractCegarLoop]: Abstraction has 335 states and 466 transitions. [2018-12-02 21:19:44,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 21:19:44,223 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 466 transitions. [2018-12-02 21:19:44,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 21:19:44,224 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:19:44,224 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:19:44,224 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:19:44,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:19:44,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1698847677, now seen corresponding path program 1 times [2018-12-02 21:19:44,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:19:44,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:19:44,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:19:44,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:19:44,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:19:44,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:19:44,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:19:44,257 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 21:19:44,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 09:19:44 BoogieIcfgContainer [2018-12-02 21:19:44,282 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 21:19:44,282 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 21:19:44,282 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 21:19:44,282 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 21:19:44,282 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:19:40" (3/4) ... [2018-12-02 21:19:44,284 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 21:19:44,285 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 21:19:44,285 INFO L168 Benchmark]: Toolchain (without parser) took 3758.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 956.0 MB in the beginning and 907.0 MB in the end (delta: 49.0 MB). Peak memory consumption was 182.7 MB. Max. memory is 11.5 GB. [2018-12-02 21:19:44,286 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 21:19:44,286 INFO L168 Benchmark]: CACSL2BoogieTranslator took 170.38 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 939.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-02 21:19:44,287 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.10 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 81.8 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -137.3 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2018-12-02 21:19:44,287 INFO L168 Benchmark]: Boogie Preprocessor took 17.41 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 21:19:44,287 INFO L168 Benchmark]: RCFGBuilder took 221.61 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. [2018-12-02 21:19:44,288 INFO L168 Benchmark]: TraceAbstraction took 3295.80 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 51.9 MB). Free memory was 1.0 GB in the beginning and 907.0 MB in the end (delta: 142.4 MB). Peak memory consumption was 194.3 MB. Max. memory is 11.5 GB. [2018-12-02 21:19:44,288 INFO L168 Benchmark]: Witness Printer took 2.81 ms. Allocated memory is still 1.2 GB. Free memory is still 907.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 21:19:44,290 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 170.38 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 939.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.10 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 81.8 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -137.3 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.41 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 221.61 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3295.80 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 51.9 MB). Free memory was 1.0 GB in the beginning and 907.0 MB in the end (delta: 142.4 MB). Peak memory consumption was 194.3 MB. Max. memory is 11.5 GB. * Witness Printer took 2.81 ms. Allocated memory is still 1.2 GB. Free memory is still 907.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 7]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 100, overapproximation of bitwiseAnd at line 98. Possible FailurePath: [L215] unsigned int a ; [L216] unsigned int ma = __VERIFIER_nondet_uint(); [L217] signed char ea = __VERIFIER_nondet_char(); [L218] unsigned int b ; [L219] unsigned int mb = __VERIFIER_nondet_uint(); [L220] signed char eb = __VERIFIER_nondet_char(); [L221] unsigned int r_add ; [L222] unsigned int zero ; [L223] int sa ; [L224] int sb ; [L225] int tmp ; [L226] int tmp___0 ; [L227] int tmp___1 ; [L228] int tmp___2 ; [L229] int tmp___3 ; [L230] int tmp___4 ; [L231] int tmp___5 ; [L232] int tmp___6 ; [L233] int tmp___7 ; [L234] int tmp___8 ; [L235] int tmp___9 ; [L236] int __retres23 ; VAL [ea=127, eb=0, ma=33554432, mb=16777216] [L240] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L15] unsigned int res ; [L16] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L19] COND TRUE ! m [L20] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0, m=0] [L70] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, __retres4=0, e=0, m=0] [L240] RET, EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0, ea=127, eb=0, ma=33554432, mb=16777216] [L240] zero = base2flt(0, 0) [L241] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=127, \old(m)=33554432] [L15] unsigned int res ; [L16] unsigned int __retres4 ; VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L19] COND FALSE !(! m) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L25] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L47] COND TRUE 1 VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L49] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L54] COND TRUE e >= 127 [L55] __retres4 = 4294967295U VAL [\old(e)=127, \old(m)=33554432, __retres4=4294967295, e=127, m=33554432] [L70] return (__retres4); VAL [\old(e)=127, \old(m)=33554432, \result=4294967295, __retres4=4294967295, e=127, m=33554432] [L241] RET, EXPR base2flt(ma, ea) VAL [base2flt(ma, ea)=4294967295, ea=127, eb=0, ma=33554432, mb=16777216, zero=0] [L241] a = base2flt(ma, ea) [L242] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=0, \old(m)=16777216] [L15] unsigned int res ; [L16] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L19] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L25] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L47] COND TRUE 1 VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L49] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L66] m = m & ~ (1U << 24U) [L67] res = m | (unsigned int )((e + 128) << 24U) [L68] __retres4 = res VAL [\old(e)=0, \old(m)=16777216, __retres4=16777215, e=0, res=16777215] [L70] return (__retres4); VAL [\old(e)=0, \old(m)=16777216, \result=-72057589726183425, __retres4=16777215, e=0, res=16777215] [L242] RET, EXPR base2flt(mb, eb) VAL [a=4294967295, base2flt(mb, eb)=-72057589726183425, ea=127, eb=0, ma=33554432, mb=16777216, zero=0] [L242] b = base2flt(mb, eb) [L244] COND FALSE !(a < zero) VAL [a=4294967295, b=16777215, ea=127, eb=0, ma=33554432, mb=16777216, zero=0] [L247] COND TRUE a > zero [L248] tmp = 1 VAL [a=4294967295, b=16777215, ea=127, eb=0, ma=33554432, mb=16777216, tmp=1, zero=0] [L252] sa = tmp VAL [a=4294967295, b=16777215, ea=127, eb=0, ma=33554432, mb=16777216, sa=1, tmp=1, zero=0] [L254] COND FALSE !(b < zero) VAL [a=4294967295, b=16777215, ea=127, eb=0, ma=33554432, mb=16777216, sa=1, tmp=1, zero=0] [L257] COND TRUE b > zero [L258] tmp___0 = 1 VAL [a=4294967295, b=16777215, ea=127, eb=0, ma=33554432, mb=16777216, sa=1, tmp=1, tmp___0=1, zero=0] [L262] sb = tmp___0 VAL [a=4294967295, b=16777215, ea=127, eb=0, ma=33554432, mb=16777216, sa=1, sb=1, tmp=1, tmp___0=1, zero=0] [L265] CALL addflt(a, b) VAL [\old(a)=4294967295, \old(b)=16777215] [L74] unsigned int res ; [L75] unsigned int ma ; [L76] unsigned int mb ; [L77] unsigned int delta ; [L78] int ea ; [L79] int eb ; [L80] unsigned int tmp ; [L81] unsigned int __retres10 ; VAL [\old(a)=4294967295, \old(b)=16777215, a=4294967295, b=16777215] [L84] COND FALSE !(a < b) VAL [\old(a)=4294967295, \old(b)=16777215, a=4294967295, b=16777215] [L91] COND FALSE !(! b) [L98] ma = a & ((1U << 24U) - 1U) [L99] ea = (int )(a >> 24U) - 128 [L100] ma = ma | (1U << 24U) [L101] mb = b & ((1U << 24U) - 1U) [L102] eb = (int )(b >> 24U) - 128 [L103] mb = mb | (1U << 24U) VAL [\old(a)=4294967295, \old(b)=16777215, a=4294967295, b=16777215, ea=127, eb=128] [L104] CALL __VERIFIER_assert(ea >= eb) VAL [\old(cond)=0] [L6] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L7] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 77 locations, 1 error locations. UNSAFE Result, 3.2s OverallTime, 7 OverallIterations, 3 TraceHistogramMax, 1.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 729 SDtfs, 822 SDslu, 6584 SDs, 0 SdLazy, 2627 SolverSat, 110 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 276 GetRequests, 154 SyntacticMatches, 9 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=335occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 189 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 480 NumberOfCodeBlocks, 480 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 422 ConstructedInterpolants, 0 QuantifiedInterpolants, 61789 SizeOfPredicates, 17 NumberOfNonLiveVariables, 504 ConjunctsInSsa, 87 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 115/160 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-02 21:19:45,660 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 21:19:45,661 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 21:19:45,667 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 21:19:45,667 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 21:19:45,668 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 21:19:45,668 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 21:19:45,669 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 21:19:45,670 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 21:19:45,670 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 21:19:45,671 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 21:19:45,671 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 21:19:45,671 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 21:19:45,672 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 21:19:45,672 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 21:19:45,673 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 21:19:45,673 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 21:19:45,674 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 21:19:45,675 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 21:19:45,676 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 21:19:45,676 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 21:19:45,677 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 21:19:45,678 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 21:19:45,678 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 21:19:45,678 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 21:19:45,678 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 21:19:45,679 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 21:19:45,679 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 21:19:45,680 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 21:19:45,680 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 21:19:45,680 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 21:19:45,681 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 21:19:45,681 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 21:19:45,681 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 21:19:45,681 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 21:19:45,682 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 21:19:45,682 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-12-02 21:19:45,689 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 21:19:45,689 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 21:19:45,690 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 21:19:45,690 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 21:19:45,690 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 21:19:45,690 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 21:19:45,690 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 21:19:45,690 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 21:19:45,691 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 21:19:45,691 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 21:19:45,691 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 21:19:45,691 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 21:19:45,691 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 21:19:45,691 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 21:19:45,691 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-02 21:19:45,691 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-02 21:19:45,691 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 21:19:45,691 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 21:19:45,691 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 21:19:45,692 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 21:19:45,692 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 21:19:45,692 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 21:19:45,692 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 21:19:45,692 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 21:19:45,692 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 21:19:45,692 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 21:19:45,692 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 21:19:45,692 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 21:19:45,692 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-12-02 21:19:45,693 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 21:19:45,693 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-02 21:19:45,693 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-02 21:19:45,693 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f756365182c9801d4a2ac186a40692687a86b469 [2018-12-02 21:19:45,711 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 21:19:45,720 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 21:19:45,723 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 21:19:45,724 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 21:19:45,725 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 21:19:45,725 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/../../sv-benchmarks/c/bitvector/soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-12-02 21:19:45,764 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/data/cc243ef35/878140480b5c47de9e60aed46694d0bf/FLAGb33338f50 [2018-12-02 21:19:46,146 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 21:19:46,146 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/sv-benchmarks/c/bitvector/soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-12-02 21:19:46,150 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/data/cc243ef35/878140480b5c47de9e60aed46694d0bf/FLAGb33338f50 [2018-12-02 21:19:46,517 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/data/cc243ef35/878140480b5c47de9e60aed46694d0bf [2018-12-02 21:19:46,523 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 21:19:46,525 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 21:19:46,526 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 21:19:46,526 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 21:19:46,531 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 21:19:46,531 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:19:46" (1/1) ... [2018-12-02 21:19:46,533 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2405f263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:19:46, skipping insertion in model container [2018-12-02 21:19:46,533 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:19:46" (1/1) ... [2018-12-02 21:19:46,537 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 21:19:46,552 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 21:19:46,660 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 21:19:46,663 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 21:19:46,690 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 21:19:46,698 INFO L195 MainTranslator]: Completed translation [2018-12-02 21:19:46,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:19:46 WrapperNode [2018-12-02 21:19:46,698 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 21:19:46,699 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 21:19:46,699 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 21:19:46,699 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 21:19:46,704 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:19:46" (1/1) ... [2018-12-02 21:19:46,709 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:19:46" (1/1) ... [2018-12-02 21:19:46,713 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 21:19:46,713 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 21:19:46,713 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 21:19:46,713 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 21:19:46,719 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:19:46" (1/1) ... [2018-12-02 21:19:46,719 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:19:46" (1/1) ... [2018-12-02 21:19:46,720 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:19:46" (1/1) ... [2018-12-02 21:19:46,721 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:19:46" (1/1) ... [2018-12-02 21:19:46,726 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:19:46" (1/1) ... [2018-12-02 21:19:46,759 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:19:46" (1/1) ... [2018-12-02 21:19:46,760 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:19:46" (1/1) ... [2018-12-02 21:19:46,762 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 21:19:46,762 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 21:19:46,762 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 21:19:46,762 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 21:19:46,763 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:19:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 21:19:46,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 21:19:46,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 21:19:46,793 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2018-12-02 21:19:46,793 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2018-12-02 21:19:46,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 21:19:46,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 21:19:46,794 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 21:19:46,794 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 21:19:46,794 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2018-12-02 21:19:46,794 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2018-12-02 21:19:46,794 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-02 21:19:46,794 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-02 21:19:46,995 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 21:19:46,995 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-02 21:19:46,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:19:46 BoogieIcfgContainer [2018-12-02 21:19:46,996 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 21:19:46,996 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 21:19:46,996 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 21:19:46,998 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 21:19:46,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 09:19:46" (1/3) ... [2018-12-02 21:19:46,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c742636 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:19:46, skipping insertion in model container [2018-12-02 21:19:46,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:19:46" (2/3) ... [2018-12-02 21:19:46,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c742636 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:19:46, skipping insertion in model container [2018-12-02 21:19:46,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:19:46" (3/3) ... [2018-12-02 21:19:47,000 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-12-02 21:19:47,005 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 21:19:47,010 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 21:19:47,018 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 21:19:47,035 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 21:19:47,036 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 21:19:47,036 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 21:19:47,036 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 21:19:47,036 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 21:19:47,036 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 21:19:47,036 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 21:19:47,036 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 21:19:47,036 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 21:19:47,047 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states. [2018-12-02 21:19:47,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 21:19:47,051 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:19:47,052 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:19:47,053 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:19:47,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:19:47,056 INFO L82 PathProgramCache]: Analyzing trace with hash -441638981, now seen corresponding path program 1 times [2018-12-02 21:19:47,058 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:19:47,058 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:19:47,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:19:47,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:19:47,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:19:47,190 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-02 21:19:47,190 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:19:47,224 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-02 21:19:47,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:19:47,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-12-02 21:19:47,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 21:19:47,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 21:19:47,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-02 21:19:47,239 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 9 states. [2018-12-02 21:19:47,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:19:47,426 INFO L93 Difference]: Finished difference Result 199 states and 318 transitions. [2018-12-02 21:19:47,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 21:19:47,428 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-12-02 21:19:47,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:19:47,435 INFO L225 Difference]: With dead ends: 199 [2018-12-02 21:19:47,435 INFO L226 Difference]: Without dead ends: 120 [2018-12-02 21:19:47,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-12-02 21:19:47,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-12-02 21:19:47,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 105. [2018-12-02 21:19:47,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-02 21:19:47,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 154 transitions. [2018-12-02 21:19:47,470 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 154 transitions. Word has length 36 [2018-12-02 21:19:47,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:19:47,471 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 154 transitions. [2018-12-02 21:19:47,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 21:19:47,471 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 154 transitions. [2018-12-02 21:19:47,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-02 21:19:47,472 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:19:47,473 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:19:47,473 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:19:47,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:19:47,473 INFO L82 PathProgramCache]: Analyzing trace with hash 306755114, now seen corresponding path program 1 times [2018-12-02 21:19:47,473 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:19:47,474 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:19:47,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:19:47,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:19:47,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:19:47,540 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-02 21:19:47,541 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:19:47,585 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-02 21:19:47,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:19:47,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-12-02 21:19:47,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 21:19:47,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 21:19:47,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:19:47,589 INFO L87 Difference]: Start difference. First operand 105 states and 154 transitions. Second operand 6 states. [2018-12-02 21:19:47,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:19:47,658 INFO L93 Difference]: Finished difference Result 185 states and 283 transitions. [2018-12-02 21:19:47,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 21:19:47,658 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-12-02 21:19:47,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:19:47,660 INFO L225 Difference]: With dead ends: 185 [2018-12-02 21:19:47,660 INFO L226 Difference]: Without dead ends: 140 [2018-12-02 21:19:47,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 21:19:47,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-12-02 21:19:47,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 133. [2018-12-02 21:19:47,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-02 21:19:47,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 201 transitions. [2018-12-02 21:19:47,671 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 201 transitions. Word has length 40 [2018-12-02 21:19:47,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:19:47,672 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 201 transitions. [2018-12-02 21:19:47,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 21:19:47,672 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 201 transitions. [2018-12-02 21:19:47,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-02 21:19:47,673 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:19:47,673 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:19:47,673 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:19:47,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:19:47,673 INFO L82 PathProgramCache]: Analyzing trace with hash -842119066, now seen corresponding path program 1 times [2018-12-02 21:19:47,674 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:19:47,674 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:19:47,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:19:47,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:19:47,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:19:47,740 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-02 21:19:47,740 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:19:47,769 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-02 21:19:47,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:19:47,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-12-02 21:19:47,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 21:19:47,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 21:19:47,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:19:47,772 INFO L87 Difference]: Start difference. First operand 133 states and 201 transitions. Second operand 6 states. [2018-12-02 21:19:47,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:19:47,826 INFO L93 Difference]: Finished difference Result 301 states and 470 transitions. [2018-12-02 21:19:47,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 21:19:47,827 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-12-02 21:19:47,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:19:47,829 INFO L225 Difference]: With dead ends: 301 [2018-12-02 21:19:47,829 INFO L226 Difference]: Without dead ends: 216 [2018-12-02 21:19:47,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 21:19:47,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-12-02 21:19:47,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 156. [2018-12-02 21:19:47,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-12-02 21:19:47,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 238 transitions. [2018-12-02 21:19:47,847 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 238 transitions. Word has length 40 [2018-12-02 21:19:47,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:19:47,848 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 238 transitions. [2018-12-02 21:19:47,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 21:19:47,848 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 238 transitions. [2018-12-02 21:19:47,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-02 21:19:47,850 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:19:47,850 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:19:47,850 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:19:47,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:19:47,851 INFO L82 PathProgramCache]: Analyzing trace with hash 377249800, now seen corresponding path program 1 times [2018-12-02 21:19:47,851 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:19:47,851 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:19:47,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:19:47,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:19:47,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:19:47,919 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-02 21:19:47,919 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:19:47,964 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-02 21:19:47,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:19:47,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-12-02 21:19:47,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 21:19:47,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 21:19:47,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-02 21:19:47,966 INFO L87 Difference]: Start difference. First operand 156 states and 238 transitions. Second operand 8 states. [2018-12-02 21:19:48,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:19:48,070 INFO L93 Difference]: Finished difference Result 215 states and 325 transitions. [2018-12-02 21:19:48,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 21:19:48,071 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2018-12-02 21:19:48,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:19:48,072 INFO L225 Difference]: With dead ends: 215 [2018-12-02 21:19:48,072 INFO L226 Difference]: Without dead ends: 176 [2018-12-02 21:19:48,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-02 21:19:48,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-12-02 21:19:48,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 169. [2018-12-02 21:19:48,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-12-02 21:19:48,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 256 transitions. [2018-12-02 21:19:48,083 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 256 transitions. Word has length 44 [2018-12-02 21:19:48,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:19:48,084 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 256 transitions. [2018-12-02 21:19:48,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 21:19:48,084 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 256 transitions. [2018-12-02 21:19:48,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-02 21:19:48,085 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:19:48,085 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:19:48,085 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:19:48,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:19:48,085 INFO L82 PathProgramCache]: Analyzing trace with hash 434508102, now seen corresponding path program 1 times [2018-12-02 21:19:48,086 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:19:48,086 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:19:48,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:19:48,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:19:48,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:19:48,144 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-02 21:19:48,145 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 21:19:48,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:19:48,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 21:19:48,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 21:19:48,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 21:19:48,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-02 21:19:48,146 INFO L87 Difference]: Start difference. First operand 169 states and 256 transitions. Second operand 8 states. [2018-12-02 21:19:48,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:19:48,237 INFO L93 Difference]: Finished difference Result 378 states and 561 transitions. [2018-12-02 21:19:48,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 21:19:48,237 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2018-12-02 21:19:48,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:19:48,239 INFO L225 Difference]: With dead ends: 378 [2018-12-02 21:19:48,239 INFO L226 Difference]: Without dead ends: 283 [2018-12-02 21:19:48,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-02 21:19:48,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-12-02 21:19:48,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 273. [2018-12-02 21:19:48,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-12-02 21:19:48,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 395 transitions. [2018-12-02 21:19:48,252 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 395 transitions. Word has length 44 [2018-12-02 21:19:48,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:19:48,252 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 395 transitions. [2018-12-02 21:19:48,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 21:19:48,252 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 395 transitions. [2018-12-02 21:19:48,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 21:19:48,254 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:19:48,254 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:19:48,254 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:19:48,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:19:48,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1399634249, now seen corresponding path program 2 times [2018-12-02 21:19:48,255 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:19:48,255 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:19:48,267 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-02 21:19:48,281 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-12-02 21:19:48,281 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:19:48,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:19:48,318 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-02 21:19:48,318 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 21:19:48,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:19:48,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 21:19:48,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 21:19:48,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 21:19:48,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 21:19:48,320 INFO L87 Difference]: Start difference. First operand 273 states and 395 transitions. Second operand 7 states. [2018-12-02 21:19:48,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:19:48,472 INFO L93 Difference]: Finished difference Result 524 states and 777 transitions. [2018-12-02 21:19:48,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 21:19:48,472 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-12-02 21:19:48,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:19:48,474 INFO L225 Difference]: With dead ends: 524 [2018-12-02 21:19:48,474 INFO L226 Difference]: Without dead ends: 430 [2018-12-02 21:19:48,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-02 21:19:48,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2018-12-02 21:19:48,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 355. [2018-12-02 21:19:48,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-12-02 21:19:48,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 514 transitions. [2018-12-02 21:19:48,488 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 514 transitions. Word has length 48 [2018-12-02 21:19:48,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:19:48,489 INFO L480 AbstractCegarLoop]: Abstraction has 355 states and 514 transitions. [2018-12-02 21:19:48,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 21:19:48,489 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 514 transitions. [2018-12-02 21:19:48,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 21:19:48,490 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:19:48,490 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:19:48,490 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:19:48,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:19:48,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1006607239, now seen corresponding path program 1 times [2018-12-02 21:19:48,490 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:19:48,490 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:19:48,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:19:48,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:19:48,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:19:48,648 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-02 21:19:48,648 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 21:19:48,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:19:48,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-02 21:19:48,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 21:19:48,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 21:19:48,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-12-02 21:19:48,650 INFO L87 Difference]: Start difference. First operand 355 states and 514 transitions. Second operand 13 states. [2018-12-02 21:19:48,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:19:48,975 INFO L93 Difference]: Finished difference Result 422 states and 605 transitions. [2018-12-02 21:19:48,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 21:19:48,975 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2018-12-02 21:19:48,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:19:48,977 INFO L225 Difference]: With dead ends: 422 [2018-12-02 21:19:48,977 INFO L226 Difference]: Without dead ends: 389 [2018-12-02 21:19:48,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2018-12-02 21:19:48,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-12-02 21:19:48,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 372. [2018-12-02 21:19:48,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-12-02 21:19:48,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 533 transitions. [2018-12-02 21:19:48,987 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 533 transitions. Word has length 48 [2018-12-02 21:19:48,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:19:48,988 INFO L480 AbstractCegarLoop]: Abstraction has 372 states and 533 transitions. [2018-12-02 21:19:48,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 21:19:48,988 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 533 transitions. [2018-12-02 21:19:48,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 21:19:48,989 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:19:48,989 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:19:48,989 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:19:48,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:19:48,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1305820667, now seen corresponding path program 1 times [2018-12-02 21:19:48,989 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:19:48,989 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:19:49,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:19:49,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:19:49,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:19:49,051 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 21:19:49,051 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:19:49,088 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 21:19:49,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:19:49,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-12-02 21:19:49,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 21:19:49,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 21:19:49,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-02 21:19:49,090 INFO L87 Difference]: Start difference. First operand 372 states and 533 transitions. Second operand 9 states. [2018-12-02 21:19:49,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:19:49,243 INFO L93 Difference]: Finished difference Result 847 states and 1242 transitions. [2018-12-02 21:19:49,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 21:19:49,244 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2018-12-02 21:19:49,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:19:49,246 INFO L225 Difference]: With dead ends: 847 [2018-12-02 21:19:49,247 INFO L226 Difference]: Without dead ends: 698 [2018-12-02 21:19:49,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-12-02 21:19:49,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2018-12-02 21:19:49,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 438. [2018-12-02 21:19:49,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-12-02 21:19:49,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 624 transitions. [2018-12-02 21:19:49,276 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 624 transitions. Word has length 48 [2018-12-02 21:19:49,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:19:49,276 INFO L480 AbstractCegarLoop]: Abstraction has 438 states and 624 transitions. [2018-12-02 21:19:49,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 21:19:49,276 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 624 transitions. [2018-12-02 21:19:49,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 21:19:49,277 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:19:49,278 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:19:49,278 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:19:49,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:19:49,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1698847677, now seen corresponding path program 1 times [2018-12-02 21:19:49,278 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:19:49,278 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:19:49,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:19:49,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:19:49,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:19:49,409 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 21:19:49,409 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:19:49,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:19:49,565 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:19:49,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:19:49,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:19:49,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:19:49,589 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 21:19:49,590 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:19:49,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:19:49,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-12-02 21:19:49,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 21:19:49,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 21:19:49,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-12-02 21:19:49,613 INFO L87 Difference]: Start difference. First operand 438 states and 624 transitions. Second operand 11 states. [2018-12-02 21:19:49,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:19:49,850 INFO L93 Difference]: Finished difference Result 492 states and 698 transitions. [2018-12-02 21:19:49,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 21:19:49,850 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2018-12-02 21:19:49,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:19:49,852 INFO L225 Difference]: With dead ends: 492 [2018-12-02 21:19:49,852 INFO L226 Difference]: Without dead ends: 459 [2018-12-02 21:19:49,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2018-12-02 21:19:49,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-12-02 21:19:49,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 442. [2018-12-02 21:19:49,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2018-12-02 21:19:49,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 626 transitions. [2018-12-02 21:19:49,877 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 626 transitions. Word has length 48 [2018-12-02 21:19:49,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:19:49,877 INFO L480 AbstractCegarLoop]: Abstraction has 442 states and 626 transitions. [2018-12-02 21:19:49,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 21:19:49,878 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 626 transitions. [2018-12-02 21:19:49,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 21:19:49,879 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:19:49,879 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:19:49,879 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:19:49,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:19:49,879 INFO L82 PathProgramCache]: Analyzing trace with hash -294368905, now seen corresponding path program 1 times [2018-12-02 21:19:49,879 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:19:49,880 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:19:49,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:19:49,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:19:49,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:19:50,007 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 21:19:50,007 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 21:19:50,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:19:50,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 21:19:50,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 21:19:50,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 21:19:50,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 21:19:50,009 INFO L87 Difference]: Start difference. First operand 442 states and 626 transitions. Second operand 12 states. [2018-12-02 21:19:50,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:19:50,326 INFO L93 Difference]: Finished difference Result 545 states and 760 transitions. [2018-12-02 21:19:50,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 21:19:50,327 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2018-12-02 21:19:50,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:19:50,329 INFO L225 Difference]: With dead ends: 545 [2018-12-02 21:19:50,329 INFO L226 Difference]: Without dead ends: 446 [2018-12-02 21:19:50,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2018-12-02 21:19:50,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2018-12-02 21:19:50,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 411. [2018-12-02 21:19:50,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-12-02 21:19:50,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 578 transitions. [2018-12-02 21:19:50,344 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 578 transitions. Word has length 48 [2018-12-02 21:19:50,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:19:50,344 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 578 transitions. [2018-12-02 21:19:50,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 21:19:50,345 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 578 transitions. [2018-12-02 21:19:50,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 21:19:50,346 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:19:50,346 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:19:50,346 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:19:50,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:19:50,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1883881285, now seen corresponding path program 1 times [2018-12-02 21:19:50,346 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:19:50,347 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:19:50,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:19:50,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:19:50,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:19:50,463 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-02 21:19:50,463 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 21:19:50,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:19:50,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 21:19:50,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 21:19:50,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 21:19:50,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:19:50,466 INFO L87 Difference]: Start difference. First operand 411 states and 578 transitions. Second operand 6 states. [2018-12-02 21:19:51,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:19:51,396 INFO L93 Difference]: Finished difference Result 452 states and 627 transitions. [2018-12-02 21:19:51,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 21:19:51,397 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2018-12-02 21:19:51,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:19:51,398 INFO L225 Difference]: With dead ends: 452 [2018-12-02 21:19:51,398 INFO L226 Difference]: Without dead ends: 450 [2018-12-02 21:19:51,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 21:19:51,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2018-12-02 21:19:51,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 417. [2018-12-02 21:19:51,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-12-02 21:19:51,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 585 transitions. [2018-12-02 21:19:51,413 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 585 transitions. Word has length 48 [2018-12-02 21:19:51,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:19:51,414 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 585 transitions. [2018-12-02 21:19:51,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 21:19:51,414 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 585 transitions. [2018-12-02 21:19:51,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 21:19:51,415 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:19:51,415 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:19:51,415 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:19:51,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:19:51,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1826622983, now seen corresponding path program 1 times [2018-12-02 21:19:51,415 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:19:51,415 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:19:51,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:19:51,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:19:51,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:19:51,514 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-02 21:19:51,514 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 21:19:51,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:19:51,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 21:19:51,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 21:19:51,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 21:19:51,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:19:51,516 INFO L87 Difference]: Start difference. First operand 417 states and 585 transitions. Second operand 6 states. [2018-12-02 21:19:54,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:19:54,107 INFO L93 Difference]: Finished difference Result 434 states and 602 transitions. [2018-12-02 21:19:54,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 21:19:54,108 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2018-12-02 21:19:54,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:19:54,109 INFO L225 Difference]: With dead ends: 434 [2018-12-02 21:19:54,109 INFO L226 Difference]: Without dead ends: 432 [2018-12-02 21:19:54,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 21:19:54,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2018-12-02 21:19:54,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 415. [2018-12-02 21:19:54,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2018-12-02 21:19:54,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 581 transitions. [2018-12-02 21:19:54,121 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 581 transitions. Word has length 48 [2018-12-02 21:19:54,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:19:54,122 INFO L480 AbstractCegarLoop]: Abstraction has 415 states and 581 transitions. [2018-12-02 21:19:54,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 21:19:54,122 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 581 transitions. [2018-12-02 21:19:54,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-02 21:19:54,122 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:19:54,122 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:19:54,123 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:19:54,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:19:54,123 INFO L82 PathProgramCache]: Analyzing trace with hash 609641055, now seen corresponding path program 1 times [2018-12-02 21:19:54,123 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:19:54,123 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:19:54,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:19:54,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:19:54,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:19:54,170 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-02 21:19:54,170 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 21:19:54,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:19:54,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 21:19:54,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 21:19:54,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 21:19:54,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 21:19:54,172 INFO L87 Difference]: Start difference. First operand 415 states and 581 transitions. Second operand 7 states. [2018-12-02 21:19:54,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:19:54,310 INFO L93 Difference]: Finished difference Result 632 states and 910 transitions. [2018-12-02 21:19:54,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 21:19:54,310 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2018-12-02 21:19:54,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:19:54,312 INFO L225 Difference]: With dead ends: 632 [2018-12-02 21:19:54,312 INFO L226 Difference]: Without dead ends: 537 [2018-12-02 21:19:54,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-02 21:19:54,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2018-12-02 21:19:54,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 407. [2018-12-02 21:19:54,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2018-12-02 21:19:54,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 568 transitions. [2018-12-02 21:19:54,337 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 568 transitions. Word has length 49 [2018-12-02 21:19:54,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:19:54,338 INFO L480 AbstractCegarLoop]: Abstraction has 407 states and 568 transitions. [2018-12-02 21:19:54,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 21:19:54,338 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 568 transitions. [2018-12-02 21:19:54,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-02 21:19:54,339 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:19:54,339 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:19:54,339 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:19:54,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:19:54,339 INFO L82 PathProgramCache]: Analyzing trace with hash 666899357, now seen corresponding path program 1 times [2018-12-02 21:19:54,339 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:19:54,340 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:19:54,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:19:54,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:19:54,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:19:54,394 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-02 21:19:54,394 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 21:19:54,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:19:54,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 21:19:54,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 21:19:54,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 21:19:54,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 21:19:54,397 INFO L87 Difference]: Start difference. First operand 407 states and 568 transitions. Second operand 4 states. [2018-12-02 21:19:54,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:19:54,424 INFO L93 Difference]: Finished difference Result 666 states and 963 transitions. [2018-12-02 21:19:54,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 21:19:54,425 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-12-02 21:19:54,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:19:54,426 INFO L225 Difference]: With dead ends: 666 [2018-12-02 21:19:54,426 INFO L226 Difference]: Without dead ends: 533 [2018-12-02 21:19:54,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 21:19:54,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2018-12-02 21:19:54,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 477. [2018-12-02 21:19:54,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2018-12-02 21:19:54,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 661 transitions. [2018-12-02 21:19:54,454 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 661 transitions. Word has length 49 [2018-12-02 21:19:54,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:19:54,454 INFO L480 AbstractCegarLoop]: Abstraction has 477 states and 661 transitions. [2018-12-02 21:19:54,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 21:19:54,455 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 661 transitions. [2018-12-02 21:19:54,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-02 21:19:54,456 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:19:54,456 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:19:54,456 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:19:54,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:19:54,456 INFO L82 PathProgramCache]: Analyzing trace with hash -855742356, now seen corresponding path program 1 times [2018-12-02 21:19:54,456 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:19:54,457 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:19:54,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:19:54,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:19:54,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:19:54,491 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-02 21:19:54,492 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 21:19:54,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:19:54,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 21:19:54,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 21:19:54,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 21:19:54,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 21:19:54,493 INFO L87 Difference]: Start difference. First operand 477 states and 661 transitions. Second operand 4 states. [2018-12-02 21:19:54,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:19:54,554 INFO L93 Difference]: Finished difference Result 865 states and 1185 transitions. [2018-12-02 21:19:54,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 21:19:54,555 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-12-02 21:19:54,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:19:54,556 INFO L225 Difference]: With dead ends: 865 [2018-12-02 21:19:54,556 INFO L226 Difference]: Without dead ends: 394 [2018-12-02 21:19:54,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 21:19:54,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-12-02 21:19:54,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 382. [2018-12-02 21:19:54,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-12-02 21:19:54,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 507 transitions. [2018-12-02 21:19:54,571 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 507 transitions. Word has length 49 [2018-12-02 21:19:54,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:19:54,571 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 507 transitions. [2018-12-02 21:19:54,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 21:19:54,571 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 507 transitions. [2018-12-02 21:19:54,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-02 21:19:54,571 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:19:54,571 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:19:54,572 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:19:54,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:19:54,572 INFO L82 PathProgramCache]: Analyzing trace with hash 849971633, now seen corresponding path program 1 times [2018-12-02 21:19:54,572 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:19:54,572 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:19:54,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:19:54,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:19:54,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:19:54,613 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-02 21:19:54,614 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 21:19:54,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:19:54,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 21:19:54,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 21:19:54,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 21:19:54,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 21:19:54,616 INFO L87 Difference]: Start difference. First operand 382 states and 507 transitions. Second operand 5 states. [2018-12-02 21:19:54,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:19:54,643 INFO L93 Difference]: Finished difference Result 389 states and 513 transitions. [2018-12-02 21:19:54,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 21:19:54,644 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-12-02 21:19:54,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:19:54,645 INFO L225 Difference]: With dead ends: 389 [2018-12-02 21:19:54,645 INFO L226 Difference]: Without dead ends: 382 [2018-12-02 21:19:54,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:19:54,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-12-02 21:19:54,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-12-02 21:19:54,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-12-02 21:19:54,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 503 transitions. [2018-12-02 21:19:54,658 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 503 transitions. Word has length 50 [2018-12-02 21:19:54,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:19:54,658 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 503 transitions. [2018-12-02 21:19:54,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 21:19:54,658 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 503 transitions. [2018-12-02 21:19:54,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 21:19:54,659 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:19:54,659 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:19:54,659 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:19:54,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:19:54,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1699165264, now seen corresponding path program 1 times [2018-12-02 21:19:54,660 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:19:54,660 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:19:54,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:19:54,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:19:54,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:19:54,742 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-02 21:19:54,742 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 21:19:54,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:19:54,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 21:19:54,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 21:19:54,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 21:19:54,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 21:19:54,745 INFO L87 Difference]: Start difference. First operand 382 states and 503 transitions. Second operand 4 states. [2018-12-02 21:19:54,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:19:54,779 INFO L93 Difference]: Finished difference Result 424 states and 556 transitions. [2018-12-02 21:19:54,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 21:19:54,780 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2018-12-02 21:19:54,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:19:54,781 INFO L225 Difference]: With dead ends: 424 [2018-12-02 21:19:54,781 INFO L226 Difference]: Without dead ends: 399 [2018-12-02 21:19:54,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 21:19:54,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-12-02 21:19:54,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 374. [2018-12-02 21:19:54,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-12-02 21:19:54,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 491 transitions. [2018-12-02 21:19:54,804 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 491 transitions. Word has length 53 [2018-12-02 21:19:54,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:19:54,804 INFO L480 AbstractCegarLoop]: Abstraction has 374 states and 491 transitions. [2018-12-02 21:19:54,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 21:19:54,805 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 491 transitions. [2018-12-02 21:19:54,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 21:19:54,806 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:19:54,806 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:19:54,806 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:19:54,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:19:54,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1987036572, now seen corresponding path program 1 times [2018-12-02 21:19:54,806 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:19:54,806 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:19:54,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:19:54,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:19:54,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:19:54,842 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-02 21:19:54,842 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 21:19:54,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:19:54,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 21:19:54,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 21:19:54,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 21:19:54,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 21:19:54,844 INFO L87 Difference]: Start difference. First operand 374 states and 491 transitions. Second operand 4 states. [2018-12-02 21:19:54,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:19:54,878 INFO L93 Difference]: Finished difference Result 391 states and 510 transitions. [2018-12-02 21:19:54,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 21:19:54,878 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-12-02 21:19:54,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:19:54,879 INFO L225 Difference]: With dead ends: 391 [2018-12-02 21:19:54,880 INFO L226 Difference]: Without dead ends: 321 [2018-12-02 21:19:54,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 21:19:54,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-12-02 21:19:54,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 319. [2018-12-02 21:19:54,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-12-02 21:19:54,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 404 transitions. [2018-12-02 21:19:54,898 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 404 transitions. Word has length 54 [2018-12-02 21:19:54,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:19:54,899 INFO L480 AbstractCegarLoop]: Abstraction has 319 states and 404 transitions. [2018-12-02 21:19:54,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 21:19:54,899 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 404 transitions. [2018-12-02 21:19:54,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-02 21:19:54,900 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:19:54,900 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:19:54,900 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:19:54,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:19:54,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1813382670, now seen corresponding path program 1 times [2018-12-02 21:19:54,901 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:19:54,901 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:19:54,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:19:54,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:19:54,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:19:55,050 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-02 21:19:55,050 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 21:19:55,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:19:55,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-02 21:19:55,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 21:19:55,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 21:19:55,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-12-02 21:19:55,052 INFO L87 Difference]: Start difference. First operand 319 states and 404 transitions. Second operand 13 states. [2018-12-02 21:19:55,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:19:55,294 INFO L93 Difference]: Finished difference Result 385 states and 486 transitions. [2018-12-02 21:19:55,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 21:19:55,295 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2018-12-02 21:19:55,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:19:55,296 INFO L225 Difference]: With dead ends: 385 [2018-12-02 21:19:55,296 INFO L226 Difference]: Without dead ends: 337 [2018-12-02 21:19:55,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2018-12-02 21:19:55,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-12-02 21:19:55,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 314. [2018-12-02 21:19:55,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-12-02 21:19:55,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 396 transitions. [2018-12-02 21:19:55,306 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 396 transitions. Word has length 56 [2018-12-02 21:19:55,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:19:55,306 INFO L480 AbstractCegarLoop]: Abstraction has 314 states and 396 transitions. [2018-12-02 21:19:55,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 21:19:55,306 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 396 transitions. [2018-12-02 21:19:55,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-02 21:19:55,307 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:19:55,307 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:19:55,307 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:19:55,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:19:55,307 INFO L82 PathProgramCache]: Analyzing trace with hash -848138954, now seen corresponding path program 1 times [2018-12-02 21:19:55,307 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:19:55,307 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:19:55,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:19:55,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:19:55,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:19:55,458 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 21:19:55,458 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:19:55,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:19:55,557 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:19:55,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:19:55,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:19:55,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:19:55,630 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 21:19:55,630 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:19:55,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:19:55,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-12-02 21:19:55,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 21:19:55,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 21:19:55,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-12-02 21:19:55,697 INFO L87 Difference]: Start difference. First operand 314 states and 396 transitions. Second operand 11 states. [2018-12-02 21:19:57,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:19:57,608 INFO L93 Difference]: Finished difference Result 369 states and 467 transitions. [2018-12-02 21:19:57,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 21:19:57,609 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2018-12-02 21:19:57,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:19:57,609 INFO L225 Difference]: With dead ends: 369 [2018-12-02 21:19:57,610 INFO L226 Difference]: Without dead ends: 335 [2018-12-02 21:19:57,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 113 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2018-12-02 21:19:57,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-12-02 21:19:57,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 312. [2018-12-02 21:19:57,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-12-02 21:19:57,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 392 transitions. [2018-12-02 21:19:57,620 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 392 transitions. Word has length 56 [2018-12-02 21:19:57,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:19:57,621 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 392 transitions. [2018-12-02 21:19:57,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 21:19:57,621 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 392 transitions. [2018-12-02 21:19:57,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 21:19:57,622 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:19:57,622 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:19:57,622 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:19:57,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:19:57,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1591720731, now seen corresponding path program 1 times [2018-12-02 21:19:57,623 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:19:57,623 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/cvc4 Starting monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:19:57,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:19:57,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:19:57,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:19:57,675 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 21:19:57,675 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 21:19:57,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:19:57,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 21:19:57,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 21:19:57,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 21:19:57,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:19:57,677 INFO L87 Difference]: Start difference. First operand 312 states and 392 transitions. Second operand 6 states. [2018-12-02 21:19:57,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:19:57,786 INFO L93 Difference]: Finished difference Result 396 states and 511 transitions. [2018-12-02 21:19:57,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 21:19:57,786 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-12-02 21:19:57,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:19:57,787 INFO L225 Difference]: With dead ends: 396 [2018-12-02 21:19:57,787 INFO L226 Difference]: Without dead ends: 349 [2018-12-02 21:19:57,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 21:19:57,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-12-02 21:19:57,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 318. [2018-12-02 21:19:57,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-12-02 21:19:57,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 398 transitions. [2018-12-02 21:19:57,799 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 398 transitions. Word has length 55 [2018-12-02 21:19:57,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:19:57,799 INFO L480 AbstractCegarLoop]: Abstraction has 318 states and 398 transitions. [2018-12-02 21:19:57,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 21:19:57,799 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 398 transitions. [2018-12-02 21:19:57,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-02 21:19:57,800 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:19:57,800 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:19:57,800 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:19:57,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:19:57,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1440743184, now seen corresponding path program 1 times [2018-12-02 21:19:57,800 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:19:57,800 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/cvc4 Starting monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:19:57,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:19:57,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:19:57,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:19:59,993 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 21:19:59,993 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 21:19:59,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:19:59,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 21:19:59,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 21:19:59,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 21:19:59,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=110, Unknown=1, NotChecked=0, Total=132 [2018-12-02 21:19:59,996 INFO L87 Difference]: Start difference. First operand 318 states and 398 transitions. Second operand 12 states. [2018-12-02 21:20:02,147 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 27 [2018-12-02 21:20:04,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:20:04,433 INFO L93 Difference]: Finished difference Result 365 states and 458 transitions. [2018-12-02 21:20:04,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 21:20:04,434 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-12-02 21:20:04,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:20:04,435 INFO L225 Difference]: With dead ends: 365 [2018-12-02 21:20:04,435 INFO L226 Difference]: Without dead ends: 329 [2018-12-02 21:20:04,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=92, Invalid=368, Unknown=2, NotChecked=0, Total=462 [2018-12-02 21:20:04,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-12-02 21:20:04,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 316. [2018-12-02 21:20:04,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-12-02 21:20:04,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 394 transitions. [2018-12-02 21:20:04,448 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 394 transitions. Word has length 56 [2018-12-02 21:20:04,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:20:04,448 INFO L480 AbstractCegarLoop]: Abstraction has 316 states and 394 transitions. [2018-12-02 21:20:04,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 21:20:04,448 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 394 transitions. [2018-12-02 21:20:04,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-02 21:20:04,449 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:20:04,449 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:20:04,449 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:20:04,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:20:04,449 INFO L82 PathProgramCache]: Analyzing trace with hash -475499468, now seen corresponding path program 1 times [2018-12-02 21:20:04,449 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:20:04,449 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/cvc4 Starting monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:20:04,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:20:04,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:20:04,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:20:10,654 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-02 21:20:10,654 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 21:20:10,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:20:10,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 21:20:10,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 21:20:10,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 21:20:10,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=37, Unknown=3, NotChecked=0, Total=56 [2018-12-02 21:20:10,657 INFO L87 Difference]: Start difference. First operand 316 states and 394 transitions. Second operand 8 states. [2018-12-02 21:20:20,832 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 17 [2018-12-02 21:20:24,611 WARN L180 SmtUtils]: Spent 1.74 s on a formula simplification. DAG size of input: 25 DAG size of output: 17 [2018-12-02 21:20:25,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:20:25,395 INFO L93 Difference]: Finished difference Result 339 states and 420 transitions. [2018-12-02 21:20:25,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 21:20:25,395 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2018-12-02 21:20:25,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:20:25,396 INFO L225 Difference]: With dead ends: 339 [2018-12-02 21:20:25,396 INFO L226 Difference]: Without dead ends: 337 [2018-12-02 21:20:25,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=31, Invalid=74, Unknown=5, NotChecked=0, Total=110 [2018-12-02 21:20:25,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-12-02 21:20:25,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 321. [2018-12-02 21:20:25,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-12-02 21:20:25,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 399 transitions. [2018-12-02 21:20:25,410 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 399 transitions. Word has length 56 [2018-12-02 21:20:25,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:20:25,410 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 399 transitions. [2018-12-02 21:20:25,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 21:20:25,410 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 399 transitions. [2018-12-02 21:20:25,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-02 21:20:25,411 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:20:25,411 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:20:25,412 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:20:25,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:20:25,412 INFO L82 PathProgramCache]: Analyzing trace with hash -695289963, now seen corresponding path program 1 times [2018-12-02 21:20:25,412 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:20:25,412 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/cvc4 Starting monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:20:25,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:20:25,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:20:25,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:20:25,523 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-02 21:20:25,523 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 21:20:25,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:20:25,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 21:20:25,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 21:20:25,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 21:20:25,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-12-02 21:20:25,525 INFO L87 Difference]: Start difference. First operand 321 states and 399 transitions. Second operand 12 states. [2018-12-02 21:20:25,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:20:25,758 INFO L93 Difference]: Finished difference Result 393 states and 496 transitions. [2018-12-02 21:20:25,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 21:20:25,758 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-12-02 21:20:25,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:20:25,759 INFO L225 Difference]: With dead ends: 393 [2018-12-02 21:20:25,759 INFO L226 Difference]: Without dead ends: 368 [2018-12-02 21:20:25,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-12-02 21:20:25,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-12-02 21:20:25,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 337. [2018-12-02 21:20:25,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-12-02 21:20:25,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 422 transitions. [2018-12-02 21:20:25,772 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 422 transitions. Word has length 56 [2018-12-02 21:20:25,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:20:25,772 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 422 transitions. [2018-12-02 21:20:25,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 21:20:25,772 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 422 transitions. [2018-12-02 21:20:25,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-02 21:20:25,773 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:20:25,773 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:20:25,773 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:20:25,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:20:25,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1684269273, now seen corresponding path program 1 times [2018-12-02 21:20:25,773 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:20:25,773 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/cvc4 Starting monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:20:25,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:20:25,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:20:25,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:20:25,835 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-02 21:20:25,835 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 21:20:25,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:20:25,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 21:20:25,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 21:20:25,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 21:20:25,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-02 21:20:25,837 INFO L87 Difference]: Start difference. First operand 337 states and 422 transitions. Second operand 8 states. [2018-12-02 21:20:26,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:20:26,019 INFO L93 Difference]: Finished difference Result 408 states and 518 transitions. [2018-12-02 21:20:26,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 21:20:26,019 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2018-12-02 21:20:26,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:20:26,020 INFO L225 Difference]: With dead ends: 408 [2018-12-02 21:20:26,020 INFO L226 Difference]: Without dead ends: 389 [2018-12-02 21:20:26,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-12-02 21:20:26,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-12-02 21:20:26,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 339. [2018-12-02 21:20:26,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-12-02 21:20:26,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 433 transitions. [2018-12-02 21:20:26,034 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 433 transitions. Word has length 56 [2018-12-02 21:20:26,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:20:26,034 INFO L480 AbstractCegarLoop]: Abstraction has 339 states and 433 transitions. [2018-12-02 21:20:26,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 21:20:26,034 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 433 transitions. [2018-12-02 21:20:26,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-02 21:20:26,035 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:20:26,035 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:20:26,035 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:20:26,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:20:26,035 INFO L82 PathProgramCache]: Analyzing trace with hash -2092005707, now seen corresponding path program 1 times [2018-12-02 21:20:26,035 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:20:26,035 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/cvc4 Starting monitored process 29 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:20:26,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:20:26,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:20:26,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:20:34,230 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-02 21:20:34,231 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 21:20:34,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:20:34,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 21:20:34,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 21:20:34,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 21:20:34,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=37, Unknown=4, NotChecked=0, Total=56 [2018-12-02 21:20:34,233 INFO L87 Difference]: Start difference. First operand 339 states and 433 transitions. Second operand 8 states. [2018-12-02 21:20:51,099 WARN L180 SmtUtils]: Spent 2.12 s on a formula simplification that was a NOOP. DAG size: 21 [2018-12-02 21:21:01,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:21:01,661 INFO L93 Difference]: Finished difference Result 355 states and 449 transitions. [2018-12-02 21:21:01,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 21:21:01,661 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2018-12-02 21:21:01,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:21:01,662 INFO L225 Difference]: With dead ends: 355 [2018-12-02 21:21:01,662 INFO L226 Difference]: Without dead ends: 353 [2018-12-02 21:21:01,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=23, Invalid=61, Unknown=6, NotChecked=0, Total=90 [2018-12-02 21:21:01,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-12-02 21:21:01,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 338. [2018-12-02 21:21:01,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-12-02 21:21:01,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 431 transitions. [2018-12-02 21:21:01,676 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 431 transitions. Word has length 57 [2018-12-02 21:21:01,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:21:01,676 INFO L480 AbstractCegarLoop]: Abstraction has 338 states and 431 transitions. [2018-12-02 21:21:01,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 21:21:01,676 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 431 transitions. [2018-12-02 21:21:01,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-02 21:21:01,677 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:21:01,677 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:21:01,677 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:21:01,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:21:01,677 INFO L82 PathProgramCache]: Analyzing trace with hash -364789831, now seen corresponding path program 1 times [2018-12-02 21:21:01,677 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:21:01,677 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/cvc4 Starting monitored process 30 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:21:01,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:21:01,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:21:01,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:21:01,717 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 21:21:01,717 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 21:21:01,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:21:01,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 21:21:01,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 21:21:01,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 21:21:01,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 21:21:01,719 INFO L87 Difference]: Start difference. First operand 338 states and 431 transitions. Second operand 5 states. [2018-12-02 21:21:01,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:21:01,779 INFO L93 Difference]: Finished difference Result 373 states and 473 transitions. [2018-12-02 21:21:01,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 21:21:01,779 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2018-12-02 21:21:01,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:21:01,780 INFO L225 Difference]: With dead ends: 373 [2018-12-02 21:21:01,780 INFO L226 Difference]: Without dead ends: 350 [2018-12-02 21:21:01,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:21:01,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-12-02 21:21:01,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 338. [2018-12-02 21:21:01,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-12-02 21:21:01,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 429 transitions. [2018-12-02 21:21:01,797 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 429 transitions. Word has length 57 [2018-12-02 21:21:01,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:21:01,797 INFO L480 AbstractCegarLoop]: Abstraction has 338 states and 429 transitions. [2018-12-02 21:21:01,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 21:21:01,798 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 429 transitions. [2018-12-02 21:21:01,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-02 21:21:01,798 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:21:01,798 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:21:01,798 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:21:01,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:21:01,798 INFO L82 PathProgramCache]: Analyzing trace with hash 306992977, now seen corresponding path program 1 times [2018-12-02 21:21:01,798 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:21:01,799 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/cvc4 Starting monitored process 31 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:21:01,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:21:01,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:21:01,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:21:01,840 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-02 21:21:01,841 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 21:21:01,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:21:01,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 21:21:01,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 21:21:01,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 21:21:01,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 21:21:01,842 INFO L87 Difference]: Start difference. First operand 338 states and 429 transitions. Second operand 4 states. [2018-12-02 21:21:01,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:21:01,865 INFO L93 Difference]: Finished difference Result 347 states and 437 transitions. [2018-12-02 21:21:01,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 21:21:01,865 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-12-02 21:21:01,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:21:01,866 INFO L225 Difference]: With dead ends: 347 [2018-12-02 21:21:01,866 INFO L226 Difference]: Without dead ends: 296 [2018-12-02 21:21:01,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 21:21:01,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-12-02 21:21:01,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 286. [2018-12-02 21:21:01,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-12-02 21:21:01,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 356 transitions. [2018-12-02 21:21:01,878 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 356 transitions. Word has length 58 [2018-12-02 21:21:01,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:21:01,878 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 356 transitions. [2018-12-02 21:21:01,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 21:21:01,878 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 356 transitions. [2018-12-02 21:21:01,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-02 21:21:01,879 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:21:01,879 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:21:01,879 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:21:01,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:21:01,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1560523616, now seen corresponding path program 1 times [2018-12-02 21:21:01,879 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:21:01,880 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/cvc4 Starting monitored process 32 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:21:01,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:21:01,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:21:01,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:21:01,956 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-02 21:21:01,956 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 21:21:01,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:21:01,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 21:21:01,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 21:21:01,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 21:21:01,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-02 21:21:01,958 INFO L87 Difference]: Start difference. First operand 286 states and 356 transitions. Second operand 8 states. [2018-12-02 21:21:02,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:21:02,157 INFO L93 Difference]: Finished difference Result 386 states and 494 transitions. [2018-12-02 21:21:02,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 21:21:02,158 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2018-12-02 21:21:02,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:21:02,159 INFO L225 Difference]: With dead ends: 386 [2018-12-02 21:21:02,159 INFO L226 Difference]: Without dead ends: 346 [2018-12-02 21:21:02,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-12-02 21:21:02,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-12-02 21:21:02,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 324. [2018-12-02 21:21:02,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-12-02 21:21:02,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 409 transitions. [2018-12-02 21:21:02,172 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 409 transitions. Word has length 62 [2018-12-02 21:21:02,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:21:02,172 INFO L480 AbstractCegarLoop]: Abstraction has 324 states and 409 transitions. [2018-12-02 21:21:02,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 21:21:02,172 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 409 transitions. [2018-12-02 21:21:02,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-02 21:21:02,173 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:21:02,173 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:21:02,173 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:21:02,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:21:02,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1628619175, now seen corresponding path program 1 times [2018-12-02 21:21:02,173 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:21:02,173 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/cvc4 Starting monitored process 33 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:21:02,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:21:02,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:21:02,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:21:02,221 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-02 21:21:02,222 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 21:21:02,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:21:02,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 21:21:02,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 21:21:02,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 21:21:02,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:21:02,223 INFO L87 Difference]: Start difference. First operand 324 states and 409 transitions. Second operand 6 states. [2018-12-02 21:21:02,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:21:02,280 INFO L93 Difference]: Finished difference Result 418 states and 541 transitions. [2018-12-02 21:21:02,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 21:21:02,280 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-12-02 21:21:02,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:21:02,281 INFO L225 Difference]: With dead ends: 418 [2018-12-02 21:21:02,281 INFO L226 Difference]: Without dead ends: 318 [2018-12-02 21:21:02,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 21:21:02,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-12-02 21:21:02,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 279. [2018-12-02 21:21:02,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-12-02 21:21:02,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 337 transitions. [2018-12-02 21:21:02,301 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 337 transitions. Word has length 64 [2018-12-02 21:21:02,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:21:02,302 INFO L480 AbstractCegarLoop]: Abstraction has 279 states and 337 transitions. [2018-12-02 21:21:02,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 21:21:02,302 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 337 transitions. [2018-12-02 21:21:02,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-02 21:21:02,302 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:21:02,302 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:21:02,303 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:21:02,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:21:02,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1905751366, now seen corresponding path program 1 times [2018-12-02 21:21:02,303 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:21:02,303 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/cvc4 Starting monitored process 34 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:21:02,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:21:02,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:21:02,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:21:02,378 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 21:21:02,378 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 21:21:02,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:21:02,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 21:21:02,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 21:21:02,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 21:21:02,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:21:02,380 INFO L87 Difference]: Start difference. First operand 279 states and 337 transitions. Second operand 6 states. [2018-12-02 21:21:02,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:21:02,418 INFO L93 Difference]: Finished difference Result 320 states and 389 transitions. [2018-12-02 21:21:02,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 21:21:02,419 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-12-02 21:21:02,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:21:02,419 INFO L225 Difference]: With dead ends: 320 [2018-12-02 21:21:02,419 INFO L226 Difference]: Without dead ends: 318 [2018-12-02 21:21:02,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 21:21:02,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-12-02 21:21:02,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 288. [2018-12-02 21:21:02,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-12-02 21:21:02,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 348 transitions. [2018-12-02 21:21:02,431 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 348 transitions. Word has length 64 [2018-12-02 21:21:02,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:21:02,431 INFO L480 AbstractCegarLoop]: Abstraction has 288 states and 348 transitions. [2018-12-02 21:21:02,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 21:21:02,431 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 348 transitions. [2018-12-02 21:21:02,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-02 21:21:02,432 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:21:02,432 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:21:02,432 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:21:02,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:21:02,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1397816770, now seen corresponding path program 1 times [2018-12-02 21:21:02,432 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:21:02,432 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/cvc4 Starting monitored process 35 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:21:02,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:21:02,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:21:02,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:21:02,504 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 21:21:02,504 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 21:21:02,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:21:02,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 21:21:02,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 21:21:02,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 21:21:02,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:21:02,506 INFO L87 Difference]: Start difference. First operand 288 states and 348 transitions. Second operand 6 states. [2018-12-02 21:21:02,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:21:02,550 INFO L93 Difference]: Finished difference Result 317 states and 380 transitions. [2018-12-02 21:21:02,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 21:21:02,550 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-12-02 21:21:02,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:21:02,551 INFO L225 Difference]: With dead ends: 317 [2018-12-02 21:21:02,551 INFO L226 Difference]: Without dead ends: 315 [2018-12-02 21:21:02,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 21:21:02,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-12-02 21:21:02,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 292. [2018-12-02 21:21:02,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-12-02 21:21:02,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 351 transitions. [2018-12-02 21:21:02,564 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 351 transitions. Word has length 64 [2018-12-02 21:21:02,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:21:02,564 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 351 transitions. [2018-12-02 21:21:02,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 21:21:02,564 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 351 transitions. [2018-12-02 21:21:02,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-02 21:21:02,565 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:21:02,565 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:21:02,565 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:21:02,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:21:02,565 INFO L82 PathProgramCache]: Analyzing trace with hash -186874661, now seen corresponding path program 1 times [2018-12-02 21:21:02,565 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:21:02,565 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/cvc4 Starting monitored process 36 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:21:02,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:21:02,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:21:02,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:21:03,249 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-02 21:21:03,249 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:21:03,559 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2018-12-02 21:21:05,056 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-02 21:21:05,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:21:05,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 [2018-12-02 21:21:05,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-02 21:21:05,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-02 21:21:05,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2018-12-02 21:21:05,059 INFO L87 Difference]: Start difference. First operand 292 states and 351 transitions. Second operand 26 states. [2018-12-02 21:21:05,481 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2018-12-02 21:21:07,027 WARN L180 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2018-12-02 21:21:07,573 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2018-12-02 21:21:09,253 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2018-12-02 21:21:10,181 WARN L180 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2018-12-02 21:21:10,780 WARN L180 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2018-12-02 21:21:11,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:21:11,871 INFO L93 Difference]: Finished difference Result 392 states and 484 transitions. [2018-12-02 21:21:11,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-02 21:21:11,871 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 69 [2018-12-02 21:21:11,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:21:11,872 INFO L225 Difference]: With dead ends: 392 [2018-12-02 21:21:11,872 INFO L226 Difference]: Without dead ends: 364 [2018-12-02 21:21:11,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 111 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=359, Invalid=2091, Unknown=0, NotChecked=0, Total=2450 [2018-12-02 21:21:11,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-12-02 21:21:11,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 314. [2018-12-02 21:21:11,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-12-02 21:21:11,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 381 transitions. [2018-12-02 21:21:11,890 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 381 transitions. Word has length 69 [2018-12-02 21:21:11,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:21:11,890 INFO L480 AbstractCegarLoop]: Abstraction has 314 states and 381 transitions. [2018-12-02 21:21:11,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-02 21:21:11,890 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 381 transitions. [2018-12-02 21:21:11,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-02 21:21:11,890 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:21:11,891 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:21:11,891 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:21:11,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:21:11,891 INFO L82 PathProgramCache]: Analyzing trace with hash 457791470, now seen corresponding path program 1 times [2018-12-02 21:21:11,891 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:21:11,891 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/cvc4 Starting monitored process 37 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:21:11,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:21:11,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:21:11,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:21:11,970 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-02 21:21:11,970 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:21:12,076 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-02 21:21:12,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:21:12,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2018-12-02 21:21:12,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 21:21:12,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 21:21:12,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-12-02 21:21:12,078 INFO L87 Difference]: Start difference. First operand 314 states and 381 transitions. Second operand 14 states. [2018-12-02 21:21:12,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:21:12,386 INFO L93 Difference]: Finished difference Result 341 states and 413 transitions. [2018-12-02 21:21:12,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 21:21:12,387 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 70 [2018-12-02 21:21:12,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:21:12,388 INFO L225 Difference]: With dead ends: 341 [2018-12-02 21:21:12,388 INFO L226 Difference]: Without dead ends: 334 [2018-12-02 21:21:12,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 125 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2018-12-02 21:21:12,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-12-02 21:21:12,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 311. [2018-12-02 21:21:12,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-12-02 21:21:12,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 378 transitions. [2018-12-02 21:21:12,405 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 378 transitions. Word has length 70 [2018-12-02 21:21:12,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:21:12,405 INFO L480 AbstractCegarLoop]: Abstraction has 311 states and 378 transitions. [2018-12-02 21:21:12,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 21:21:12,405 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 378 transitions. [2018-12-02 21:21:12,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-02 21:21:12,406 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:21:12,406 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:21:12,406 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:21:12,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:21:12,406 INFO L82 PathProgramCache]: Analyzing trace with hash -297341722, now seen corresponding path program 2 times [2018-12-02 21:21:12,406 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:21:12,406 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/cvc4 Starting monitored process 38 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:21:12,420 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-02 21:21:12,454 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 21:21:12,454 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:21:12,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:21:12,526 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-02 21:21:12,526 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 21:21:12,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:21:12,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 21:21:12,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 21:21:12,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 21:21:12,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-12-02 21:21:12,528 INFO L87 Difference]: Start difference. First operand 311 states and 378 transitions. Second operand 12 states. [2018-12-02 21:21:12,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:21:12,776 INFO L93 Difference]: Finished difference Result 334 states and 403 transitions. [2018-12-02 21:21:12,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 21:21:12,776 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-12-02 21:21:12,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:21:12,777 INFO L225 Difference]: With dead ends: 334 [2018-12-02 21:21:12,777 INFO L226 Difference]: Without dead ends: 327 [2018-12-02 21:21:12,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2018-12-02 21:21:12,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-12-02 21:21:12,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 303. [2018-12-02 21:21:12,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-12-02 21:21:12,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 368 transitions. [2018-12-02 21:21:12,802 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 368 transitions. Word has length 70 [2018-12-02 21:21:12,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:21:12,803 INFO L480 AbstractCegarLoop]: Abstraction has 303 states and 368 transitions. [2018-12-02 21:21:12,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 21:21:12,803 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 368 transitions. [2018-12-02 21:21:12,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-02 21:21:12,803 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:21:12,803 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:21:12,803 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:21:12,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:21:12,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1221744938, now seen corresponding path program 1 times [2018-12-02 21:21:12,804 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:21:12,804 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/cvc4 Starting monitored process 39 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:21:12,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:21:12,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:21:12,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:21:12,874 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-02 21:21:12,874 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 21:21:12,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:21:12,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 21:21:12,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 21:21:12,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 21:21:12,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:21:12,876 INFO L87 Difference]: Start difference. First operand 303 states and 368 transitions. Second operand 6 states. [2018-12-02 21:21:13,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:21:13,095 INFO L93 Difference]: Finished difference Result 407 states and 501 transitions. [2018-12-02 21:21:13,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 21:21:13,096 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2018-12-02 21:21:13,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:21:13,097 INFO L225 Difference]: With dead ends: 407 [2018-12-02 21:21:13,097 INFO L226 Difference]: Without dead ends: 388 [2018-12-02 21:21:13,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 21:21:13,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-12-02 21:21:13,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 299. [2018-12-02 21:21:13,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-12-02 21:21:13,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 365 transitions. [2018-12-02 21:21:13,117 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 365 transitions. Word has length 70 [2018-12-02 21:21:13,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:21:13,117 INFO L480 AbstractCegarLoop]: Abstraction has 299 states and 365 transitions. [2018-12-02 21:21:13,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 21:21:13,117 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 365 transitions. [2018-12-02 21:21:13,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-02 21:21:13,117 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:21:13,118 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:21:13,118 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:21:13,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:21:13,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1115137352, now seen corresponding path program 1 times [2018-12-02 21:21:13,118 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:21:13,118 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/cvc4 Starting monitored process 40 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:21:13,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:21:13,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:21:13,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:21:13,322 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-02 21:21:13,322 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 21:21:13,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:21:13,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 21:21:13,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 21:21:13,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 21:21:13,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-02 21:21:13,325 INFO L87 Difference]: Start difference. First operand 299 states and 365 transitions. Second operand 9 states. [2018-12-02 21:21:13,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:21:13,767 INFO L93 Difference]: Finished difference Result 349 states and 425 transitions. [2018-12-02 21:21:13,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 21:21:13,768 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2018-12-02 21:21:13,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:21:13,769 INFO L225 Difference]: With dead ends: 349 [2018-12-02 21:21:13,769 INFO L226 Difference]: Without dead ends: 308 [2018-12-02 21:21:13,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-12-02 21:21:13,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-12-02 21:21:13,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 277. [2018-12-02 21:21:13,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-12-02 21:21:13,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 330 transitions. [2018-12-02 21:21:13,788 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 330 transitions. Word has length 70 [2018-12-02 21:21:13,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:21:13,788 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 330 transitions. [2018-12-02 21:21:13,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 21:21:13,788 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 330 transitions. [2018-12-02 21:21:13,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-02 21:21:13,789 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:21:13,789 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:21:13,789 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:21:13,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:21:13,789 INFO L82 PathProgramCache]: Analyzing trace with hash -40698028, now seen corresponding path program 1 times [2018-12-02 21:21:13,789 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:21:13,789 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/cvc4 Starting monitored process 41 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:21:13,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:21:13,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:21:13,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:21:13,863 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-02 21:21:13,863 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 21:21:13,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:21:13,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 21:21:13,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 21:21:13,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 21:21:13,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:21:13,866 INFO L87 Difference]: Start difference. First operand 277 states and 330 transitions. Second operand 6 states. [2018-12-02 21:21:13,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:21:13,910 INFO L93 Difference]: Finished difference Result 298 states and 352 transitions. [2018-12-02 21:21:13,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 21:21:13,911 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2018-12-02 21:21:13,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:21:13,911 INFO L225 Difference]: With dead ends: 298 [2018-12-02 21:21:13,911 INFO L226 Difference]: Without dead ends: 294 [2018-12-02 21:21:13,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 21:21:13,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-12-02 21:21:13,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 264. [2018-12-02 21:21:13,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-12-02 21:21:13,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 313 transitions. [2018-12-02 21:21:13,930 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 313 transitions. Word has length 72 [2018-12-02 21:21:13,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:21:13,930 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 313 transitions. [2018-12-02 21:21:13,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 21:21:13,930 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 313 transitions. [2018-12-02 21:21:13,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-02 21:21:13,930 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:21:13,931 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:21:13,931 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:21:13,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:21:13,931 INFO L82 PathProgramCache]: Analyzing trace with hash 16560274, now seen corresponding path program 1 times [2018-12-02 21:21:13,931 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:21:13,931 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/cvc4 Starting monitored process 42 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:21:13,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:21:13,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:21:13,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:21:14,259 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-02 21:21:14,259 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:21:14,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:21:14,678 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:21:14,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:21:14,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:21:14,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:21:14,810 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-02 21:21:14,810 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 21:21:14,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 21:21:14,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 17 [2018-12-02 21:21:14,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-02 21:21:14,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 21:21:14,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=340, Unknown=0, NotChecked=0, Total=380 [2018-12-02 21:21:14,826 INFO L87 Difference]: Start difference. First operand 264 states and 313 transitions. Second operand 17 states. [2018-12-02 21:21:15,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:21:15,887 INFO L93 Difference]: Finished difference Result 313 states and 365 transitions. [2018-12-02 21:21:15,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-02 21:21:15,887 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 72 [2018-12-02 21:21:15,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:21:15,888 INFO L225 Difference]: With dead ends: 313 [2018-12-02 21:21:15,888 INFO L226 Difference]: Without dead ends: 169 [2018-12-02 21:21:15,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=99, Invalid=831, Unknown=0, NotChecked=0, Total=930 [2018-12-02 21:21:15,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-12-02 21:21:15,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 149. [2018-12-02 21:21:15,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-12-02 21:21:15,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 184 transitions. [2018-12-02 21:21:15,900 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 184 transitions. Word has length 72 [2018-12-02 21:21:15,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:21:15,900 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 184 transitions. [2018-12-02 21:21:15,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-02 21:21:15,900 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 184 transitions. [2018-12-02 21:21:15,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-02 21:21:15,900 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:21:15,901 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:21:15,901 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:21:15,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:21:15,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1073890760, now seen corresponding path program 1 times [2018-12-02 21:21:15,901 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:21:15,901 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/cvc4 Starting monitored process 44 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:21:15,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:21:15,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:21:15,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:21:15,943 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-02 21:21:15,943 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 21:21:15,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:21:15,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 21:21:15,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 21:21:15,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 21:21:15,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 21:21:15,945 INFO L87 Difference]: Start difference. First operand 149 states and 184 transitions. Second operand 4 states. [2018-12-02 21:21:15,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:21:15,968 INFO L93 Difference]: Finished difference Result 187 states and 225 transitions. [2018-12-02 21:21:15,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 21:21:15,969 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2018-12-02 21:21:15,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:21:15,969 INFO L225 Difference]: With dead ends: 187 [2018-12-02 21:21:15,969 INFO L226 Difference]: Without dead ends: 163 [2018-12-02 21:21:15,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 21:21:15,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-12-02 21:21:15,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 149. [2018-12-02 21:21:15,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-12-02 21:21:15,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 178 transitions. [2018-12-02 21:21:15,979 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 178 transitions. Word has length 71 [2018-12-02 21:21:15,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:21:15,979 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 178 transitions. [2018-12-02 21:21:15,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 21:21:15,979 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 178 transitions. [2018-12-02 21:21:15,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-02 21:21:15,980 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:21:15,980 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:21:15,980 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:21:15,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:21:15,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1468257546, now seen corresponding path program 1 times [2018-12-02 21:21:15,980 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:21:15,980 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/cvc4 Starting monitored process 45 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:21:15,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:21:16,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:21:16,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:21:16,048 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-02 21:21:16,048 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:21:16,118 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-02 21:21:16,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:21:16,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2018-12-02 21:21:16,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 21:21:16,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 21:21:16,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-12-02 21:21:16,120 INFO L87 Difference]: Start difference. First operand 149 states and 178 transitions. Second operand 12 states. [2018-12-02 21:21:16,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:21:16,270 INFO L93 Difference]: Finished difference Result 172 states and 202 transitions. [2018-12-02 21:21:16,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 21:21:16,271 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 71 [2018-12-02 21:21:16,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:21:16,271 INFO L225 Difference]: With dead ends: 172 [2018-12-02 21:21:16,271 INFO L226 Difference]: Without dead ends: 141 [2018-12-02 21:21:16,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 128 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2018-12-02 21:21:16,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-12-02 21:21:16,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 138. [2018-12-02 21:21:16,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-12-02 21:21:16,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 162 transitions. [2018-12-02 21:21:16,281 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 162 transitions. Word has length 71 [2018-12-02 21:21:16,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:21:16,282 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 162 transitions. [2018-12-02 21:21:16,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 21:21:16,282 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 162 transitions. [2018-12-02 21:21:16,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-02 21:21:16,282 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:21:16,282 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:21:16,282 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:21:16,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:21:16,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1571950312, now seen corresponding path program 1 times [2018-12-02 21:21:16,282 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:21:16,282 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/cvc4 Starting monitored process 46 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:21:16,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:21:16,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:21:16,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:21:16,336 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-02 21:21:16,336 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 21:21:16,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:21:16,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 21:21:16,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 21:21:16,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 21:21:16,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 21:21:16,338 INFO L87 Difference]: Start difference. First operand 138 states and 162 transitions. Second operand 5 states. [2018-12-02 21:21:16,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:21:16,363 INFO L93 Difference]: Finished difference Result 148 states and 171 transitions. [2018-12-02 21:21:16,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 21:21:16,363 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-12-02 21:21:16,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:21:16,364 INFO L225 Difference]: With dead ends: 148 [2018-12-02 21:21:16,364 INFO L226 Difference]: Without dead ends: 82 [2018-12-02 21:21:16,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-02 21:21:16,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-02 21:21:16,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-12-02 21:21:16,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-02 21:21:16,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2018-12-02 21:21:16,370 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 73 [2018-12-02 21:21:16,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:21:16,370 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2018-12-02 21:21:16,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 21:21:16,371 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2018-12-02 21:21:16,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-02 21:21:16,371 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:21:16,371 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:21:16,371 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:21:16,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:21:16,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1289345495, now seen corresponding path program 1 times [2018-12-02 21:21:16,372 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:21:16,372 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/cvc4 Starting monitored process 47 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:21:16,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:21:16,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:21:16,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:21:16,842 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-02 21:21:16,842 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 21:21:16,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:21:16,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 21:21:16,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 21:21:16,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 21:21:16,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-12-02 21:21:16,844 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand 12 states. [2018-12-02 21:21:18,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:21:18,203 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2018-12-02 21:21:18,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 21:21:18,204 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 77 [2018-12-02 21:21:18,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:21:18,204 INFO L225 Difference]: With dead ends: 90 [2018-12-02 21:21:18,204 INFO L226 Difference]: Without dead ends: 72 [2018-12-02 21:21:18,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2018-12-02 21:21:18,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-02 21:21:18,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-12-02 21:21:18,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-02 21:21:18,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2018-12-02 21:21:18,208 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 77 [2018-12-02 21:21:18,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:21:18,208 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2018-12-02 21:21:18,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 21:21:18,208 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2018-12-02 21:21:18,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 21:21:18,208 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:21:18,209 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:21:18,209 INFO L423 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:21:18,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:21:18,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1480434104, now seen corresponding path program 1 times [2018-12-02 21:21:18,209 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:21:18,209 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/cvc4 Starting monitored process 48 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:21:18,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:21:18,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:21:18,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:21:18,427 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-02 21:21:18,427 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 21:21:18,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:21:18,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 21:21:18,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 21:21:18,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 21:21:18,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-02 21:21:18,430 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand 10 states. [2018-12-02 21:21:18,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:21:18,707 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2018-12-02 21:21:18,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 21:21:18,708 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2018-12-02 21:21:18,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:21:18,708 INFO L225 Difference]: With dead ends: 72 [2018-12-02 21:21:18,708 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 21:21:18,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-12-02 21:21:18,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 21:21:18,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 21:21:18,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 21:21:18,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 21:21:18,709 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2018-12-02 21:21:18,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:21:18,709 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 21:21:18,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 21:21:18,709 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 21:21:18,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 21:21:18,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-02 21:21:18,841 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 163 [2018-12-02 21:21:18,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:21:18,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:21:18,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:21:19,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:21:19,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:21:19,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:21:19,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:21:19,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:21:19,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:21:19,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:21:19,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:21:20,284 WARN L180 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 160 DAG size of output: 95 [2018-12-02 21:21:31,550 WARN L180 SmtUtils]: Spent 11.26 s on a formula simplification. DAG size of input: 157 DAG size of output: 64 [2018-12-02 21:21:32,630 WARN L180 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 131 DAG size of output: 53 [2018-12-02 21:21:32,816 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2018-12-02 21:22:07,291 WARN L180 SmtUtils]: Spent 34.47 s on a formula simplification. DAG size of input: 375 DAG size of output: 221 [2018-12-02 21:23:27,469 WARN L180 SmtUtils]: Spent 1.34 m on a formula simplification. DAG size of input: 193 DAG size of output: 142 [2018-12-02 21:23:27,473 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-02 21:23:27,473 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-02 21:23:27,473 INFO L448 ceAbstractionStarter]: For program point L19(lines 19 24) no Hoare annotation was computed. [2018-12-02 21:23:27,473 INFO L448 ceAbstractionStarter]: For program point L48(lines 47 62) no Hoare annotation was computed. [2018-12-02 21:23:27,473 INFO L444 ceAbstractionStarter]: At program point L69(lines 18 71) the Hoare annotation is: (or (not (= (_ bv0 32) |base2flt_#in~m|)) (and (= (_ bv0 32) base2flt_~__retres4~0) (= base2flt_~m |base2flt_#in~m|))) [2018-12-02 21:23:27,473 INFO L448 ceAbstractionStarter]: For program point L28(lines 27 42) no Hoare annotation was computed. [2018-12-02 21:23:27,473 INFO L448 ceAbstractionStarter]: For program point L49(lines 47 62) no Hoare annotation was computed. [2018-12-02 21:23:27,473 INFO L448 ceAbstractionStarter]: For program point L37(lines 37 41) no Hoare annotation was computed. [2018-12-02 21:23:27,473 INFO L444 ceAbstractionStarter]: At program point L37-1(lines 27 42) the Hoare annotation is: (not (= (_ bv0 32) |base2flt_#in~m|)) [2018-12-02 21:23:27,473 INFO L448 ceAbstractionStarter]: For program point L25(lines 25 65) no Hoare annotation was computed. [2018-12-02 21:23:27,474 INFO L451 ceAbstractionStarter]: At program point base2fltENTRY(lines 14 72) the Hoare annotation is: true [2018-12-02 21:23:27,474 INFO L448 ceAbstractionStarter]: For program point base2fltFINAL(lines 14 72) no Hoare annotation was computed. [2018-12-02 21:23:27,474 INFO L444 ceAbstractionStarter]: At program point L63(lines 25 65) the Hoare annotation is: (not (= (_ bv0 32) |base2flt_#in~m|)) [2018-12-02 21:23:27,474 INFO L448 ceAbstractionStarter]: For program point base2fltEXIT(lines 14 72) no Hoare annotation was computed. [2018-12-02 21:23:27,474 INFO L444 ceAbstractionStarter]: At program point L47-2(lines 47 62) the Hoare annotation is: (not (= (_ bv0 32) |base2flt_#in~m|)) [2018-12-02 21:23:27,474 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-02 21:23:27,474 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-02 21:23:27,474 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-02 21:23:27,474 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-02 21:23:27,474 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 214 345) no Hoare annotation was computed. [2018-12-02 21:23:27,474 INFO L444 ceAbstractionStarter]: At program point L242(line 242) the Hoare annotation is: (= (_ bv0 32) main_~zero~0) [2018-12-02 21:23:27,474 INFO L448 ceAbstractionStarter]: For program point L242-1(line 242) no Hoare annotation was computed. [2018-12-02 21:23:27,474 INFO L448 ceAbstractionStarter]: For program point L267(lines 267 300) no Hoare annotation was computed. [2018-12-02 21:23:27,474 INFO L448 ceAbstractionStarter]: For program point L267-1(lines 238 344) no Hoare annotation was computed. [2018-12-02 21:23:27,474 INFO L448 ceAbstractionStarter]: For program point L309(lines 309 313) no Hoare annotation was computed. [2018-12-02 21:23:27,474 INFO L448 ceAbstractionStarter]: For program point L309-2(lines 309 313) no Hoare annotation was computed. [2018-12-02 21:23:27,474 INFO L448 ceAbstractionStarter]: For program point L268(lines 268 297) no Hoare annotation was computed. [2018-12-02 21:23:27,474 INFO L448 ceAbstractionStarter]: For program point L285(lines 285 289) no Hoare annotation was computed. [2018-12-02 21:23:27,474 INFO L448 ceAbstractionStarter]: For program point L285-2(lines 285 289) no Hoare annotation was computed. [2018-12-02 21:23:27,474 INFO L448 ceAbstractionStarter]: For program point L244(lines 244 253) no Hoare annotation was computed. [2018-12-02 21:23:27,474 INFO L448 ceAbstractionStarter]: For program point L244-2(lines 238 344) no Hoare annotation was computed. [2018-12-02 21:23:27,474 INFO L448 ceAbstractionStarter]: For program point L269(lines 269 278) no Hoare annotation was computed. [2018-12-02 21:23:27,474 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 214 345) no Hoare annotation was computed. [2018-12-02 21:23:27,475 INFO L444 ceAbstractionStarter]: At program point L269-2(lines 269 278) the Hoare annotation is: (let ((.cse20 (bvult main_~a~0 main_~r_add~0)) (.cse8 (= (_ bv1 32) main_~tmp___2~0)) (.cse5 (exists ((main_~zero~0 (_ BitVec 32))) (bvugt main_~b~0 main_~zero~0))) (.cse9 (exists ((main_~zero~0 (_ BitVec 32))) (bvugt main_~a~0 main_~zero~0))) (.cse10 (= (bvadd main_~tmp___1~0 (_ bv4294967295 32)) (_ bv0 32)))) (let ((.cse2 (= main_~tmp___1~0 (_ bv0 32))) (.cse3 (not (bvult main_~r_add~0 main_~a~0))) (.cse4 (= main_~tmp___2~0 (_ bv0 32))) (.cse7 (and .cse20 .cse8 .cse5 .cse9 .cse10))) (let ((.cse11 (= (bvadd main_~r_add~0 (_ bv1 32)) (_ bv0 32))) (.cse6 (not (bvult main_~a~0 main_~b~0))) (.cse15 (or (and .cse2 .cse3 .cse4 .cse5 .cse9) .cse7)) (.cse0 (= (bvadd main_~tmp~2 (_ bv4294967295 32)) (_ bv0 32))) (.cse1 (= (bvadd main_~tmp___0~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse12 (= (bvadd main_~sb~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse13 (= (_ bv0 32) main_~zero~0)) (.cse14 (= (bvadd main_~sa~0 (_ bv4294967295 32)) (_ bv0 32)))) (or (and .cse0 .cse1 (or (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse6) (and .cse8 .cse5 .cse9 .cse10 .cse11)) .cse12 .cse13 .cse14) (and .cse15 .cse0 .cse1 .cse12 .cse13 .cse14 (exists ((addflt_~delta~0 (_ BitVec 32)) (addflt_~b (_ BitVec 32))) (let ((.cse18 (bvneg (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) main_~b~0))))) (let ((.cse17 (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~b)) addflt_~delta~0)) (.cse19 (bvneg .cse18))) (let ((.cse16 (bvadd .cse17 .cse19))) (and (= (_ bv0 32) (bvand (_ bv33554432 32) .cse16)) (not (= (bvadd .cse17 .cse18 .cse19) (_ bv0 32))) (= main_~r_add~0 (bvor (bvand (_ bv16777215 32) .cse16) (bvshl (bvlshr main_~b~0 (_ bv24 32)) (_ bv24 32)))))))))) (and .cse8 .cse10 (or (and .cse9 .cse11 (= (bvadd main_~b~0 (_ bv1 32)) (_ bv0 32))) (and (= main_~b~0 main_~r_add~0) .cse20 .cse9))) (and .cse2 (= main_~a~0 main_~r_add~0) .cse4 .cse5 .cse6) (and .cse15 (not (= (bvadd (bvlshr main_~b~0 (_ bv24 32)) (_ bv4294967041 32)) (_ bv0 32))) .cse0 .cse1 .cse12 .cse13 .cse14 (exists ((v_addflt_~ma~0_69 (_ BitVec 32))) (= main_~r_add~0 (bvor (bvand (_ bv16777215 32) v_addflt_~ma~0_69) (bvshl (bvadd (bvlshr main_~b~0 (_ bv24 32)) (_ bv1 32)) (_ bv24 32)))))))))) [2018-12-02 21:23:27,475 INFO L448 ceAbstractionStarter]: For program point L319(lines 319 328) no Hoare annotation was computed. [2018-12-02 21:23:27,475 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 214 345) the Hoare annotation is: true [2018-12-02 21:23:27,475 INFO L448 ceAbstractionStarter]: For program point L319-2(lines 318 334) no Hoare annotation was computed. [2018-12-02 21:23:27,475 INFO L444 ceAbstractionStarter]: At program point L254-1(lines 254 263) the Hoare annotation is: (let ((.cse0 (exists ((main_~zero~0 (_ BitVec 32))) (bvugt main_~b~0 main_~zero~0))) (.cse1 (exists ((main_~zero~0 (_ BitVec 32))) (bvugt main_~a~0 main_~zero~0)))) (or (and (= main_~tmp___0~0 (_ bv0 32)) (= main_~b~0 (_ bv0 32)) (= (_ bv0 32) main_~sb~0)) (and (= (_ bv4294967295 32) main_~a~0) .cse0) (and (= (bvadd main_~tmp~2 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~tmp___0~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~sb~0 (_ bv4294967295 32)) (_ bv0 32)) .cse0 .cse1 (= (_ bv0 32) main_~zero~0) (= (bvadd main_~sa~0 (_ bv4294967295 32)) (_ bv0 32))) (and (= main_~a~0 (_ bv0 32)) .cse0 (= (_ bv0 32) main_~sa~0) (= main_~tmp~2 (_ bv0 32))) (and .cse1 (= (bvadd main_~b~0 (_ bv1 32)) (_ bv0 32))))) [2018-12-02 21:23:27,475 INFO L448 ceAbstractionStarter]: For program point L304(lines 304 340) no Hoare annotation was computed. [2018-12-02 21:23:27,475 INFO L448 ceAbstractionStarter]: For program point L304-1(lines 304 340) no Hoare annotation was computed. [2018-12-02 21:23:27,475 INFO L444 ceAbstractionStarter]: At program point L329-1(lines 316 334) the Hoare annotation is: (= (bvadd main_~tmp___9~0 (_ bv4294967295 32)) (_ bv0 32)) [2018-12-02 21:23:27,475 INFO L448 ceAbstractionStarter]: For program point L280(lines 268 295) no Hoare annotation was computed. [2018-12-02 21:23:27,475 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 251) no Hoare annotation was computed. [2018-12-02 21:23:27,475 INFO L448 ceAbstractionStarter]: For program point L247-2(lines 247 251) no Hoare annotation was computed. [2018-12-02 21:23:27,475 INFO L444 ceAbstractionStarter]: At program point L305(lines 301 341) the Hoare annotation is: (or (and (= main_~b~0 main_~r_add~0) (exists ((main_~zero~0 (_ BitVec 32))) (bvugt main_~b~0 main_~zero~0))) (= main_~a~0 main_~r_add~0)) [2018-12-02 21:23:27,475 INFO L448 ceAbstractionStarter]: For program point L272(lines 272 276) no Hoare annotation was computed. [2018-12-02 21:23:27,476 INFO L448 ceAbstractionStarter]: For program point L272-2(lines 272 276) no Hoare annotation was computed. [2018-12-02 21:23:27,476 INFO L448 ceAbstractionStarter]: For program point L322(lines 322 326) no Hoare annotation was computed. [2018-12-02 21:23:27,476 INFO L448 ceAbstractionStarter]: For program point L322-2(lines 322 326) no Hoare annotation was computed. [2018-12-02 21:23:27,476 INFO L448 ceAbstractionStarter]: For program point L306-1(lines 304 338) no Hoare annotation was computed. [2018-12-02 21:23:27,476 INFO L451 ceAbstractionStarter]: At program point L240(line 240) the Hoare annotation is: true [2018-12-02 21:23:27,476 INFO L448 ceAbstractionStarter]: For program point L240-1(line 240) no Hoare annotation was computed. [2018-12-02 21:23:27,476 INFO L448 ceAbstractionStarter]: For program point L265(line 265) no Hoare annotation was computed. [2018-12-02 21:23:27,476 INFO L448 ceAbstractionStarter]: For program point L257(lines 257 261) no Hoare annotation was computed. [2018-12-02 21:23:27,476 INFO L448 ceAbstractionStarter]: For program point L257-2(lines 257 261) no Hoare annotation was computed. [2018-12-02 21:23:27,476 INFO L444 ceAbstractionStarter]: At program point L282-1(lines 282 291) the Hoare annotation is: (let ((.cse6 (exists ((main_~a~0 (_ BitVec 32))) (and (not (bvult main_~r_add~0 main_~a~0)) (not (bvult main_~a~0 main_~b~0))))) (.cse7 (not (bvult main_~r_add~0 main_~a~0))) (.cse9 (exists ((main_~zero~0 (_ BitVec 32))) (bvugt main_~a~0 main_~zero~0))) (.cse8 (exists ((main_~zero~0 (_ BitVec 32))) (bvugt main_~b~0 main_~zero~0)))) (let ((.cse1 (= main_~tmp___3~0 (_ bv0 32))) (.cse2 (= main_~tmp___4~0 (_ bv0 32))) (.cse4 (= (bvadd main_~tmp___3~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse0 (and .cse6 (and .cse7 (or (and (= main_~b~0 main_~r_add~0) .cse9) (and (= main_~a~0 main_~r_add~0) .cse8))))) (.cse5 (= (_ bv1 32) main_~tmp___4~0))) (or (and .cse0 .cse1 .cse2) (and (= (bvadd main_~tmp~2 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~tmp___0~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~sb~0 (_ bv4294967295 32)) (_ bv0 32)) (let ((.cse3 (and .cse6 (and .cse7 .cse8 .cse9)))) (or (and .cse3 .cse1 .cse2) (and .cse4 .cse3 .cse5))) (= (_ bv0 32) main_~zero~0) (= (bvadd main_~sa~0 (_ bv4294967295 32)) (_ bv0 32))) (and .cse4 .cse0 .cse5)))) [2018-12-02 21:23:27,476 INFO L444 ceAbstractionStarter]: At program point L241(line 241) the Hoare annotation is: (= (_ bv0 32) main_~zero~0) [2018-12-02 21:23:27,476 INFO L448 ceAbstractionStarter]: For program point L241-1(line 241) no Hoare annotation was computed. [2018-12-02 21:23:27,476 INFO L448 ceAbstractionStarter]: For program point L128(line 128) no Hoare annotation was computed. [2018-12-02 21:23:27,476 INFO L451 ceAbstractionStarter]: At program point addfltENTRY(lines 73 136) the Hoare annotation is: true [2018-12-02 21:23:27,476 INFO L448 ceAbstractionStarter]: For program point addfltFINAL(lines 73 136) no Hoare annotation was computed. [2018-12-02 21:23:27,476 INFO L448 ceAbstractionStarter]: For program point L116(lines 116 121) no Hoare annotation was computed. [2018-12-02 21:23:27,476 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 113) no Hoare annotation was computed. [2018-12-02 21:23:27,477 INFO L444 ceAbstractionStarter]: At program point L104(line 104) the Hoare annotation is: (let ((.cse0 (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) |addflt_#in~b|))) (.cse1 (bvadd (bvlshr |addflt_#in~b| (_ bv24 32)) (_ bv4294967168 32)))) (let ((.cse2 (and (not (bvult (bvor (bvand (_ bv16777215 32) addflt_~ma~0) (bvshl (bvadd addflt_~ea~0 (_ bv128 32)) (_ bv24 32))) |addflt_#in~a|)) (= addflt_~b |addflt_#in~b|) (= .cse0 addflt_~mb~0) (exists ((addflt_~a (_ BitVec 32))) (= addflt_~ma~0 (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~a)))) (not (bvult |addflt_#in~a| |addflt_#in~b|)) (= addflt_~a |addflt_#in~a|) (= .cse1 addflt_~eb~0) (= (bvadd (bvlshr addflt_~a (_ bv24 32)) (_ bv4294967168 32)) addflt_~ea~0)))) (and (bvugt |addflt_#in~b| (_ bv0 32)) (or (and (= .cse0 addflt_~ma~0) (= .cse1 addflt_~ea~0) (exists ((addflt_~b (_ BitVec 32)) (addflt_~a (_ BitVec 32))) (and (= (bvadd addflt_~eb~0 (_ bv128 32)) (bvlshr addflt_~b (_ bv24 32))) (not (bvult addflt_~a addflt_~b)) (= (bvadd (bvlshr addflt_~a (_ bv24 32)) (_ bv4294967168 32)) addflt_~ea~0)))) .cse2) (or (and (= (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) |addflt_#in~a|)) addflt_~mb~0) (= addflt_~b |addflt_#in~a|) (= (bvadd (bvlshr |addflt_#in~a| (_ bv24 32)) (_ bv4294967168 32)) addflt_~eb~0) (= addflt_~a |addflt_#in~b|) (bvult addflt_~b addflt_~a)) .cse2) (not (= (_ bv0 32) |addflt_#in~a|))))) [2018-12-02 21:23:27,477 INFO L448 ceAbstractionStarter]: For program point L104-1(line 104) no Hoare annotation was computed. [2018-12-02 21:23:27,477 INFO L444 ceAbstractionStarter]: At program point L133(lines 83 135) the Hoare annotation is: (let ((.cse27 (= addflt_~a |addflt_#in~a|)) (.cse30 (not (bvult addflt_~a addflt_~b)))) (let ((.cse36 (bvshl (bvadd addflt_~ea~0 (_ bv128 32)) (_ bv24 32))) (.cse17 (= addflt_~b |addflt_#in~b|)) (.cse3 (= addflt_~a |addflt_#in~b|)) (.cse29 (and .cse27 .cse30)) (.cse25 (= addflt_~b |addflt_#in~a|)) (.cse33 (bvlshr |addflt_#in~a| (_ bv24 32)))) (let ((.cse15 (= (_ bv0 32) |addflt_#in~a|)) (.cse32 (bvadd .cse33 (_ bv4294967168 32))) (.cse34 (let ((.cse38 (or .cse29 (and .cse25 .cse30)))) (or (and .cse38 .cse17) (and .cse38 .cse3)))) (.cse19 (not (bvult (bvor (bvand (_ bv16777215 32) addflt_~ma~0) .cse36) |addflt_#in~a|)))) (let ((.cse18 (bvlshr |addflt_#in~b| (_ bv24 32))) (.cse26 (and .cse34 .cse19 (not (bvult addflt_~__retres10~0 |addflt_#in~a|)))) (.cse21 (not (bvult |addflt_#in~a| |addflt_#in~b|))) (.cse31 (= (bvadd addflt_~__retres10~0 (_ bv1 32)) (_ bv0 32))) (.cse0 (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) |addflt_#in~a|)) (bvadd (bvneg .cse32) addflt_~ea~0))) (.cse1 (bvult |addflt_#in~a| addflt_~a)) (.cse28 (not .cse15))) (let ((.cse7 (let ((.cse37 (bvadd addflt_~mb~0 addflt_~ma~0))) (or (not (= (bvand (_ bv33554432 32) .cse37) (_ bv0 32))) (not (bvult (bvor (bvand (_ bv16777215 32) .cse37) .cse36) |addflt_#in~a|))))) (.cse8 (let ((.cse35 (bvadd (bvlshr addflt_~mb~0 (bvadd addflt_~ea~0 (bvneg addflt_~eb~0))) addflt_~ma~0))) (or (not (bvult (bvor (bvand (_ bv16777215 32) .cse35) .cse36) |addflt_#in~a|)) (not (= (bvand (_ bv33554432 32) .cse35) (_ bv0 32)))))) (.cse16 (= (_ bv0 32) |addflt_#in~b|)) (.cse13 (and (or (and (exists ((addflt_~ma~0 (_ BitVec 32))) (= addflt_~__retres10~0 (bvor addflt_~ma~0 (bvshl (bvadd (bvlshr |addflt_#in~a| (_ bv24 32)) (_ bv1 32)) (_ bv24 32))))) .cse21 (not (= (bvadd .cse33 (_ bv4294967041 32)) (_ bv0 32))) (= (bvadd .cse33 (_ bv4294967169 32)) addflt_~ea~0) .cse27 .cse17) (and (exists ((addflt_~a (_ BitVec 32))) (and (= (bvadd (bvneg (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) |addflt_#in~a|)) (bvadd (bvneg (bvadd (bvlshr |addflt_#in~a| (_ bv24 32)) (_ bv4294967168 32))) addflt_~ea~0))) addflt_~ma~0) (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~a))) (bvult |addflt_#in~a| addflt_~a) (= (bvadd (bvlshr addflt_~a (_ bv24 32)) (_ bv4294967168 32)) addflt_~ea~0))) .cse34 .cse31 (not (= (_ bv0 32) .cse0)) .cse1)) .cse28)) (.cse24 (= addflt_~__retres10~0 |addflt_#in~a|)) (.cse14 (and (= (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) |addflt_#in~b|)) (bvadd (bvlshr addflt_~a (_ bv24 32)) (bvneg (bvadd .cse18 (_ bv4294967168 32))) (_ bv4294967168 32))) addflt_~mb~0) (or (and .cse27 .cse17 .cse26) (and .cse31 .cse21 .cse27 .cse17 (not (= (_ bv0 32) (bvand (_ bv33554432 32) addflt_~ma~0))))) (= .cse32 addflt_~ea~0) .cse28)) (.cse2 (= addflt_~__retres10~0 |addflt_#in~b|)) (.cse23 (not (= (_ bv4294967295 32) |addflt_#in~b|))) (.cse20 (not (= (bvadd |addflt_#in~a| (_ bv1 32)) (_ bv0 32))))) (and (or (and (exists ((addflt_~a (_ BitVec 32))) (and (= addflt_~ma~0 (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~a))) (bvult |addflt_#in~a| addflt_~a) (= (bvadd (bvlshr addflt_~a (_ bv24 32)) (_ bv4294967168 32)) addflt_~ea~0))) (= .cse0 addflt_~mb~0) .cse1 .cse2 .cse3) (and (exists ((addflt_~a (_ BitVec 32))) (let ((.cse5 (bvlshr addflt_~a (_ bv24 32)))) (let ((.cse6 (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) |addflt_#in~a|)) (bvadd (bvneg (bvadd (bvlshr |addflt_#in~a| (_ bv24 32)) (_ bv4294967168 32))) .cse5 (_ bv4294967168 32))))) (let ((.cse4 (bvadd (bvneg (bvneg .cse6)) (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~a))))) (and (= addflt_~__retres10~0 (bvor (bvand (_ bv16777215 32) .cse4) (bvshl .cse5 (_ bv24 32)))) (bvult |addflt_#in~a| addflt_~a) (= (_ bv0 32) (bvand (_ bv33554432 32) .cse4)) (not (= .cse6 (_ bv0 32)))))))) .cse7 .cse8 (exists ((addflt_~delta~0 (_ BitVec 32)) (addflt_~b (_ BitVec 32))) (let ((.cse9 (bvneg (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) |addflt_#in~b|))))) (let ((.cse11 (bvneg .cse9)) (.cse10 (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~b)) addflt_~delta~0))) (let ((.cse12 (bvadd .cse11 .cse10))) (and (not (= (bvadd .cse9 .cse10 .cse11) (_ bv0 32))) (= addflt_~__retres10~0 (bvor (bvand (_ bv16777215 32) .cse12) (bvshl (bvlshr |addflt_#in~b| (_ bv24 32)) (_ bv24 32)))) (= (_ bv0 32) (bvand (_ bv33554432 32) .cse12)))))))) .cse13 .cse14 .cse15 (and .cse16 .cse17) (and (= (bvadd .cse18 (_ bv4294967169 32)) addflt_~ea~0) (exists ((v_addflt_~ma~0_69 (_ BitVec 32))) (= addflt_~__retres10~0 (bvor (bvand (_ bv16777215 32) v_addflt_~ma~0_69) (bvshl (bvadd (bvlshr |addflt_#in~b| (_ bv24 32)) (_ bv1 32)) (_ bv24 32))))) (not (= (bvadd .cse18 (_ bv4294967041 32)) (_ bv0 32))) .cse3)) (or (or (exists ((addflt_~delta~0 (_ BitVec 32)) (addflt_~b (_ BitVec 32))) (= (bvadd (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~b)) addflt_~delta~0) (_ bv33554431 32)) addflt_~ma~0)) (and .cse7 .cse8 .cse19)) .cse16 .cse20) (or .cse21 (and (or (and (exists ((addflt_~delta~0 (_ BitVec 32)) (addflt_~b (_ BitVec 32))) (= (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~b)) addflt_~delta~0) addflt_~mb~0)) (= (bvadd addflt_~ma~0 (_ bv4261412865 32)) (_ bv0 32))) (exists ((addflt_~delta~0 (_ BitVec 32)) (addflt_~b (_ BitVec 32))) (let ((.cse22 (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~b)) addflt_~delta~0))) (and (not (= .cse22 (_ bv0 32))) (= (_ bv33554431 32) (bvadd (bvneg .cse22) addflt_~ma~0)))))) .cse1) (and .cse15 (= (bvadd addflt_~a (_ bv1 32)) (_ bv0 32))) .cse23) (or (= (bvadd addflt_~ma~0 (_ bv4227858434 32)) (_ bv0 32)) .cse23 .cse20) (or (bvugt |addflt_#in~b| (_ bv0 32)) .cse24) (or (and .cse25 .cse26) .cse13 (and .cse27 .cse24) .cse14) (or .cse28 .cse29 (and .cse2 .cse3 .cse30)) (or .cse23 (= (_ bv127 32) addflt_~eb~0) .cse20))))))) [2018-12-02 21:23:27,477 INFO L448 ceAbstractionStarter]: For program point addfltEXIT(lines 73 136) no Hoare annotation was computed. [2018-12-02 21:23:27,477 INFO L448 ceAbstractionStarter]: For program point L84(lines 84 90) no Hoare annotation was computed. [2018-12-02 21:23:27,477 INFO L448 ceAbstractionStarter]: For program point L115(lines 115 126) no Hoare annotation was computed. [2018-12-02 21:23:27,477 INFO L448 ceAbstractionStarter]: For program point L84-2(lines 83 135) no Hoare annotation was computed. [2018-12-02 21:23:27,478 INFO L444 ceAbstractionStarter]: At program point L115-2(lines 115 126) the Hoare annotation is: (let ((.cse5 (bvlshr |addflt_#in~b| (_ bv24 32))) (.cse12 (= addflt_~b |addflt_#in~b|)) (.cse6 (= addflt_~a |addflt_#in~b|)) (.cse11 (= addflt_~a |addflt_#in~a|)) (.cse7 (= addflt_~b |addflt_#in~a|))) (let ((.cse13 (let ((.cse18 (let ((.cse20 (not (bvult addflt_~a addflt_~b)))) (or (and .cse11 .cse20) (and .cse7 .cse20))))) (or (and (exists ((addflt_~delta~0 (_ BitVec 32)) (addflt_~b (_ BitVec 32)) (addflt_~a (_ BitVec 32))) (= (bvadd (bvneg (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~b)) addflt_~delta~0)) addflt_~ma~0) (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~a)))) (let ((.cse19 (= (_ bv0 32) (bvand (_ bv33554432 32) addflt_~ma~0)))) (or (and .cse18 .cse19 .cse6) (and .cse18 .cse19 .cse12)))) (and (exists ((addflt_~delta~0 (_ BitVec 32)) (addflt_~b (_ BitVec 32)) (addflt_~a (_ BitVec 32))) (= (bvlshr (bvadd (bvneg (bvneg (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~b)) addflt_~delta~0))) (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~a))) (_ bv1 32)) addflt_~ma~0)) (or (and .cse18 .cse12) (and .cse18 .cse6)))))) (.cse10 (bvlshr |addflt_#in~a| (_ bv24 32))) (.cse2 (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) |addflt_#in~b|))) (.cse0 (bvadd .cse5 (_ bv4294967168 32)))) (let ((.cse9 (= (bvlshr .cse2 (bvadd (bvlshr addflt_~a (_ bv24 32)) (bvneg .cse0) (_ bv4294967168 32))) addflt_~mb~0)) (.cse1 (bvadd .cse10 (_ bv4294967168 32))) (.cse8 (let ((.cse15 (bvshl (bvadd addflt_~ea~0 (_ bv128 32)) (_ bv24 32)))) (let ((.cse17 (not (bvult (bvor (bvand (_ bv16777215 32) addflt_~ma~0) .cse15) |addflt_#in~a|)))) (or (and (let ((.cse14 (bvadd addflt_~mb~0 addflt_~ma~0))) (or (not (= (bvand (_ bv33554432 32) .cse14) (_ bv0 32))) (not (bvult (bvor (bvand (_ bv16777215 32) .cse14) .cse15) |addflt_#in~a|)))) (let ((.cse16 (bvadd (bvlshr addflt_~mb~0 (bvadd addflt_~ea~0 (bvneg addflt_~eb~0))) addflt_~ma~0))) (or (not (bvult (bvor (bvand (_ bv16777215 32) .cse16) .cse15) |addflt_#in~a|)) (not (= (bvand (_ bv33554432 32) .cse16) (_ bv0 32))))) .cse17 .cse13 (bvult addflt_~b addflt_~a)) (and .cse11 .cse17 .cse13)))))) (let ((.cse3 (and .cse9 (= .cse1 addflt_~ea~0) .cse11 .cse12 .cse8)) (.cse4 (and .cse9 (not (= (bvadd .cse10 (_ bv4294967041 32)) (_ bv0 32))) (= (bvadd .cse10 (_ bv4294967169 32)) addflt_~ea~0) .cse11 .cse12 .cse13))) (and (or (and (= .cse0 addflt_~ea~0) (exists ((addflt_~a (_ BitVec 32))) (and (= (bvadd (bvneg (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) |addflt_#in~a|)) (bvadd (bvneg (bvadd (bvlshr |addflt_#in~a| (_ bv24 32)) (_ bv4294967168 32))) addflt_~ea~0))) addflt_~ma~0) (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~a))) (bvult |addflt_#in~a| addflt_~a) (= (bvadd (bvlshr addflt_~a (_ bv24 32)) (_ bv4294967168 32)) addflt_~ea~0))) (not (= (_ bv0 32) (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) |addflt_#in~a|)) (bvadd (bvneg .cse1) addflt_~ea~0)))) (exists ((addflt_~delta~0 (_ BitVec 32)) (addflt_~b (_ BitVec 32))) (= (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~b)) addflt_~delta~0) (bvadd (bvneg (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) |addflt_#in~b|))) addflt_~ma~0))) (not (= (_ bv0 32) (bvadd (bvneg .cse2) addflt_~ma~0)))) .cse3 .cse4 (and (= (bvadd .cse5 (_ bv4294967169 32)) addflt_~ea~0) (not (= (bvadd .cse5 (_ bv4294967041 32)) (_ bv0 32))) .cse6)) (or (and .cse7 .cse8) .cse3 .cse4) (bvugt |addflt_#in~b| (_ bv0 32)) (not (= (bvadd |addflt_#in~a| (_ bv1 32)) (_ bv0 32))) (not (= (_ bv0 32) |addflt_#in~a|))))))) [2018-12-02 21:23:27,478 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2018-12-02 21:23:27,478 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) no Hoare annotation was computed. [2018-12-02 21:23:27,478 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 5 10) no Hoare annotation was computed. [2018-12-02 21:23:27,478 INFO L448 ceAbstractionStarter]: For program point L7(line 7) no Hoare annotation was computed. [2018-12-02 21:23:27,478 INFO L448 ceAbstractionStarter]: For program point L6(lines 6 8) no Hoare annotation was computed. [2018-12-02 21:23:27,478 INFO L448 ceAbstractionStarter]: For program point L6-2(lines 5 10) no Hoare annotation was computed. [2018-12-02 21:23:27,485 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~zero~0,QUANTIFIED] [2018-12-02 21:23:27,486 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~zero~0,QUANTIFIED] [2018-12-02 21:23:27,489 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,489 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,490 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,490 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,490 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,490 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,490 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,490 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,490 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,491 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,491 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-02 21:23:27,491 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-02 21:23:27,491 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-02 21:23:27,491 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-02 21:23:27,491 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-02 21:23:27,491 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-02 21:23:27,492 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~ma~0,QUANTIFIED] [2018-12-02 21:23:27,492 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,492 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,492 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,492 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_addflt_~ma~0_69,QUANTIFIED] [2018-12-02 21:23:27,493 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-02 21:23:27,493 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-02 21:23:27,493 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-02 21:23:27,493 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-02 21:23:27,493 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-02 21:23:27,493 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-02 21:23:27,493 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-02 21:23:27,493 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-02 21:23:27,494 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~ma~0,QUANTIFIED] [2018-12-02 21:23:27,494 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,494 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,494 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,497 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,497 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,497 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,497 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,498 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,498 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,498 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,498 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,498 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,498 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,498 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-02 21:23:27,499 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-02 21:23:27,499 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-02 21:23:27,499 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-02 21:23:27,499 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-02 21:23:27,499 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-02 21:23:27,499 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~ma~0,QUANTIFIED] [2018-12-02 21:23:27,499 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,499 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,500 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,500 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_addflt_~ma~0_69,QUANTIFIED] [2018-12-02 21:23:27,500 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-02 21:23:27,500 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-02 21:23:27,500 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-02 21:23:27,500 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-02 21:23:27,500 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-02 21:23:27,501 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-02 21:23:27,501 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-02 21:23:27,501 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-02 21:23:27,501 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~ma~0,QUANTIFIED] [2018-12-02 21:23:27,501 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,501 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,501 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 09:23:27 BoogieIcfgContainer [2018-12-02 21:23:27,505 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 21:23:27,505 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 21:23:27,505 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 21:23:27,505 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 21:23:27,505 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:19:46" (3/4) ... [2018-12-02 21:23:27,508 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 21:23:27,512 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 21:23:27,512 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure base2flt [2018-12-02 21:23:27,512 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 21:23:27,512 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure addflt [2018-12-02 21:23:27,512 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-12-02 21:23:27,516 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2018-12-02 21:23:27,516 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-02 21:23:27,516 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 21:23:27,534 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(0bv32 == \old(m)) || (0bv32 == __retres4 && m == \old(m)) [2018-12-02 21:23:27,534 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(0bv32 == \old(m)) [2018-12-02 21:23:27,534 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(0bv32 == \old(m)) [2018-12-02 21:23:27,534 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(0bv32 == \old(m)) [2018-12-02 21:23:27,535 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (b == r_add && (\exists main_~zero~0 : bv32 :: ~bvugt32(b, main_~zero~0))) || a == r_add [2018-12-02 21:23:27,535 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((\exists addflt_~a : bv32 :: (ma == ~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~a)) && ~bvult64(\old(a), addflt_~a)) && ~bvadd64(~bvlshr64(addflt_~a, 24bv32), 4294967168bv32) == ea) && ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ea)) == mb) && ~bvult64(\old(a), a)) && __retres10 == \old(b)) && a == \old(b)) || ((((\exists addflt_~a : bv32 :: ((__retres10 == ~bvor32(~bvand64(16777215bv32, ~bvadd64(~bvneg32(~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ~bvlshr64(addflt_~a, 24bv32), 4294967168bv32)))), ~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~a)))), ~bvshl32(~bvlshr64(addflt_~a, 24bv32), 24bv32)) && ~bvult64(\old(a), addflt_~a)) && 0bv32 == ~bvand64(33554432bv32, ~bvadd64(~bvneg32(~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ~bvlshr64(addflt_~a, 24bv32), 4294967168bv32)))), ~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~a))))) && !(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ~bvlshr64(addflt_~a, 24bv32), 4294967168bv32)) == 0bv32)) && (!(~bvand64(33554432bv32, ~bvadd64(mb, ma)) == 0bv32) || !~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(mb, ma)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a)))) && (!~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(ea, ~bvneg32(eb))), ma)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a)) || !(~bvand64(33554432bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(ea, ~bvneg32(eb))), ma)) == 0bv32))) && (\exists addflt_~delta~0 : bv32, addflt_~b : bv32 :: (!(~bvadd64(~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b)))), ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0), ~bvneg32(~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b)))))) == 0bv32) && __retres10 == ~bvor32(~bvand64(16777215bv32, ~bvadd64(~bvneg32(~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b))))), ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0))), ~bvshl32(~bvlshr64(\old(b), 24bv32), 24bv32))) && 0bv32 == ~bvand64(33554432bv32, ~bvadd64(~bvneg32(~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b))))), ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0)))))) || ((((((((\exists addflt_~ma~0 : bv32 :: __retres10 == ~bvor32(addflt_~ma~0, ~bvshl32(~bvadd64(~bvlshr64(\old(a), 24bv32), 1bv32), 24bv32))) && !~bvult64(\old(a), \old(b))) && !(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967041bv32) == 0bv32)) && ~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967169bv32) == ea) && a == \old(a)) && b == \old(b)) || (((((\exists addflt_~a : bv32 :: (~bvadd64(~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ea))), ma) == ~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~a)) && ~bvult64(\old(a), addflt_~a)) && ~bvadd64(~bvlshr64(addflt_~a, 24bv32), 4294967168bv32) == ea) && ((((a == \old(a) && !~bvult64(a, b)) || (b == \old(a) && !~bvult64(a, b))) && b == \old(b)) || (((a == \old(a) && !~bvult64(a, b)) || (b == \old(a) && !~bvult64(a, b))) && a == \old(b)))) && ~bvadd64(__retres10, 1bv32) == 0bv32) && !(0bv32 == ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ea)))) && ~bvult64(\old(a), a))) && !(0bv32 == \old(a)))) || (((~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b))), ~bvadd64(~bvlshr64(a, 24bv32), ~bvneg32(~bvadd64(~bvlshr64(\old(b), 24bv32), 4294967168bv32)), 4294967168bv32)) == mb && (((a == \old(a) && b == \old(b)) && (((((a == \old(a) && !~bvult64(a, b)) || (b == \old(a) && !~bvult64(a, b))) && b == \old(b)) || (((a == \old(a) && !~bvult64(a, b)) || (b == \old(a) && !~bvult64(a, b))) && a == \old(b))) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a))) && !~bvult64(__retres10, \old(a))) || ((((~bvadd64(__retres10, 1bv32) == 0bv32 && !~bvult64(\old(a), \old(b))) && a == \old(a)) && b == \old(b)) && !(0bv32 == ~bvand64(33554432bv32, ma))))) && ~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32) == ea) && !(0bv32 == \old(a)))) || 0bv32 == \old(a)) || (0bv32 == \old(b) && b == \old(b))) || (((~bvadd64(~bvlshr64(\old(b), 24bv32), 4294967169bv32) == ea && (\exists v_addflt_~ma~0_69 : bv32 :: __retres10 == ~bvor32(~bvand64(16777215bv32, v_addflt_~ma~0_69), ~bvshl32(~bvadd64(~bvlshr64(\old(b), 24bv32), 1bv32), 24bv32)))) && !(~bvadd64(~bvlshr64(\old(b), 24bv32), 4294967041bv32) == 0bv32)) && a == \old(b))) && ((((\exists addflt_~delta~0 : bv32, addflt_~b : bv32 :: ~bvadd64(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0), 33554431bv32) == ma) || (((!(~bvand64(33554432bv32, ~bvadd64(mb, ma)) == 0bv32) || !~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(mb, ma)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a))) && (!~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(ea, ~bvneg32(eb))), ma)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a)) || !(~bvand64(33554432bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(ea, ~bvneg32(eb))), ma)) == 0bv32))) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a)))) || 0bv32 == \old(b)) || !(~bvadd64(\old(a), 1bv32) == 0bv32))) && (((!~bvult64(\old(a), \old(b)) || ((((\exists addflt_~delta~0 : bv32, addflt_~b : bv32 :: ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0) == mb) && ~bvadd64(ma, 4261412865bv32) == 0bv32) || (\exists addflt_~delta~0 : bv32, addflt_~b : bv32 :: !(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0) == 0bv32) && 33554431bv32 == ~bvadd64(~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0)), ma))) && ~bvult64(\old(a), a))) || (0bv32 == \old(a) && ~bvadd64(a, 1bv32) == 0bv32)) || !(4294967295bv32 == \old(b)))) && ((~bvadd64(ma, 4227858434bv32) == 0bv32 || !(4294967295bv32 == \old(b))) || !(~bvadd64(\old(a), 1bv32) == 0bv32))) && (~bvugt32(\old(b), 0bv32) || __retres10 == \old(a))) && ((((b == \old(a) && (((((a == \old(a) && !~bvult64(a, b)) || (b == \old(a) && !~bvult64(a, b))) && b == \old(b)) || (((a == \old(a) && !~bvult64(a, b)) || (b == \old(a) && !~bvult64(a, b))) && a == \old(b))) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a))) && !~bvult64(__retres10, \old(a))) || ((((((((\exists addflt_~ma~0 : bv32 :: __retres10 == ~bvor32(addflt_~ma~0, ~bvshl32(~bvadd64(~bvlshr64(\old(a), 24bv32), 1bv32), 24bv32))) && !~bvult64(\old(a), \old(b))) && !(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967041bv32) == 0bv32)) && ~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967169bv32) == ea) && a == \old(a)) && b == \old(b)) || (((((\exists addflt_~a : bv32 :: (~bvadd64(~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ea))), ma) == ~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~a)) && ~bvult64(\old(a), addflt_~a)) && ~bvadd64(~bvlshr64(addflt_~a, 24bv32), 4294967168bv32) == ea) && ((((a == \old(a) && !~bvult64(a, b)) || (b == \old(a) && !~bvult64(a, b))) && b == \old(b)) || (((a == \old(a) && !~bvult64(a, b)) || (b == \old(a) && !~bvult64(a, b))) && a == \old(b)))) && ~bvadd64(__retres10, 1bv32) == 0bv32) && !(0bv32 == ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ea)))) && ~bvult64(\old(a), a))) && !(0bv32 == \old(a)))) || (a == \old(a) && __retres10 == \old(a))) || (((~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b))), ~bvadd64(~bvlshr64(a, 24bv32), ~bvneg32(~bvadd64(~bvlshr64(\old(b), 24bv32), 4294967168bv32)), 4294967168bv32)) == mb && (((a == \old(a) && b == \old(b)) && (((((a == \old(a) && !~bvult64(a, b)) || (b == \old(a) && !~bvult64(a, b))) && b == \old(b)) || (((a == \old(a) && !~bvult64(a, b)) || (b == \old(a) && !~bvult64(a, b))) && a == \old(b))) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a))) && !~bvult64(__retres10, \old(a))) || ((((~bvadd64(__retres10, 1bv32) == 0bv32 && !~bvult64(\old(a), \old(b))) && a == \old(a)) && b == \old(b)) && !(0bv32 == ~bvand64(33554432bv32, ma))))) && ~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32) == ea) && !(0bv32 == \old(a))))) && ((!(0bv32 == \old(a)) || (a == \old(a) && !~bvult64(a, b))) || ((__retres10 == \old(b) && a == \old(b)) && !~bvult64(a, b)))) && ((!(4294967295bv32 == \old(b)) || 127bv32 == eb) || !(~bvadd64(\old(a), 1bv32) == 0bv32)) [2018-12-02 21:23:27,550 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b59dd690-e550-4581-9234-2d35c090077d/bin-2019/uautomizer/witness.graphml [2018-12-02 21:23:27,551 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 21:23:27,551 INFO L168 Benchmark]: Toolchain (without parser) took 221027.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 205.5 MB). Free memory was 943.4 MB in the beginning and 820.7 MB in the end (delta: 122.6 MB). Peak memory consumption was 328.2 MB. Max. memory is 11.5 GB. [2018-12-02 21:23:27,551 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 21:23:27,552 INFO L168 Benchmark]: CACSL2BoogieTranslator took 172.35 ms. Allocated memory is still 1.0 GB. Free memory was 943.4 MB in the beginning and 927.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-02 21:23:27,552 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.12 ms. Allocated memory is still 1.0 GB. Free memory is still 927.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 21:23:27,552 INFO L168 Benchmark]: Boogie Preprocessor took 48.63 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 927.3 MB in the beginning and 1.1 GB in the end (delta: -167.8 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2018-12-02 21:23:27,552 INFO L168 Benchmark]: RCFGBuilder took 233.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-12-02 21:23:27,552 INFO L168 Benchmark]: TraceAbstraction took 220508.54 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 97.0 MB). Free memory was 1.1 GB in the beginning and 828.9 MB in the end (delta: 241.5 MB). Peak memory consumption was 415.5 MB. Max. memory is 11.5 GB. [2018-12-02 21:23:27,552 INFO L168 Benchmark]: Witness Printer took 45.62 ms. Allocated memory is still 1.2 GB. Free memory was 828.9 MB in the beginning and 820.7 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. [2018-12-02 21:23:27,553 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 172.35 ms. Allocated memory is still 1.0 GB. Free memory was 943.4 MB in the beginning and 927.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 14.12 ms. Allocated memory is still 1.0 GB. Free memory is still 927.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.63 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 927.3 MB in the beginning and 1.1 GB in the end (delta: -167.8 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 233.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 220508.54 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 97.0 MB). Free memory was 1.1 GB in the beginning and 828.9 MB in the end (delta: 241.5 MB). Peak memory consumption was 415.5 MB. Max. memory is 11.5 GB. * Witness Printer took 45.62 ms. Allocated memory is still 1.2 GB. Free memory was 828.9 MB in the beginning and 820.7 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~ma~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_addflt_~ma~0_69,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~ma~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~ma~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_addflt_~ma~0_69,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~ma~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 7]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: !(0bv32 == \old(m)) - InvariantResult [Line: 301]: Loop Invariant [2018-12-02 21:23:27,556 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~zero~0,QUANTIFIED] [2018-12-02 21:23:27,556 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~zero~0,QUANTIFIED] Derived loop invariant: (b == r_add && (\exists main_~zero~0 : bv32 :: ~bvugt32(b, main_~zero~0))) || a == r_add - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: !(0bv32 == \old(m)) || (0bv32 == __retres4 && m == \old(m)) - InvariantResult [Line: 83]: Loop Invariant [2018-12-02 21:23:27,556 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,557 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,557 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,557 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,557 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,557 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,557 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,557 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,557 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,558 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,558 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-02 21:23:27,558 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-02 21:23:27,558 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-02 21:23:27,558 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-02 21:23:27,558 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-02 21:23:27,558 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-02 21:23:27,558 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~ma~0,QUANTIFIED] [2018-12-02 21:23:27,559 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,559 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,559 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,559 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_addflt_~ma~0_69,QUANTIFIED] [2018-12-02 21:23:27,559 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-02 21:23:27,559 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-02 21:23:27,559 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-02 21:23:27,559 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-02 21:23:27,560 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-02 21:23:27,560 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-02 21:23:27,560 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-02 21:23:27,560 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-02 21:23:27,560 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~ma~0,QUANTIFIED] [2018-12-02 21:23:27,560 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,560 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,560 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,562 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,562 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,562 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,562 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,562 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,563 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,563 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,563 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,563 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,563 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,563 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-02 21:23:27,563 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-02 21:23:27,563 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-02 21:23:27,563 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-02 21:23:27,564 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-02 21:23:27,564 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-02 21:23:27,564 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~ma~0,QUANTIFIED] [2018-12-02 21:23:27,564 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,564 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,564 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,564 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_addflt_~ma~0_69,QUANTIFIED] [2018-12-02 21:23:27,564 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-02 21:23:27,564 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-02 21:23:27,565 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-02 21:23:27,565 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-02 21:23:27,565 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-02 21:23:27,565 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-02 21:23:27,565 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-02 21:23:27,565 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-02 21:23:27,565 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~ma~0,QUANTIFIED] [2018-12-02 21:23:27,565 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,565 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-02 21:23:27,565 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] Derived loop invariant: (((((((((((((((((\exists addflt_~a : bv32 :: (ma == ~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~a)) && ~bvult64(\old(a), addflt_~a)) && ~bvadd64(~bvlshr64(addflt_~a, 24bv32), 4294967168bv32) == ea) && ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ea)) == mb) && ~bvult64(\old(a), a)) && __retres10 == \old(b)) && a == \old(b)) || ((((\exists addflt_~a : bv32 :: ((__retres10 == ~bvor32(~bvand64(16777215bv32, ~bvadd64(~bvneg32(~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ~bvlshr64(addflt_~a, 24bv32), 4294967168bv32)))), ~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~a)))), ~bvshl32(~bvlshr64(addflt_~a, 24bv32), 24bv32)) && ~bvult64(\old(a), addflt_~a)) && 0bv32 == ~bvand64(33554432bv32, ~bvadd64(~bvneg32(~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ~bvlshr64(addflt_~a, 24bv32), 4294967168bv32)))), ~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~a))))) && !(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ~bvlshr64(addflt_~a, 24bv32), 4294967168bv32)) == 0bv32)) && (!(~bvand64(33554432bv32, ~bvadd64(mb, ma)) == 0bv32) || !~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(mb, ma)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a)))) && (!~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(ea, ~bvneg32(eb))), ma)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a)) || !(~bvand64(33554432bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(ea, ~bvneg32(eb))), ma)) == 0bv32))) && (\exists addflt_~delta~0 : bv32, addflt_~b : bv32 :: (!(~bvadd64(~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b)))), ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0), ~bvneg32(~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b)))))) == 0bv32) && __retres10 == ~bvor32(~bvand64(16777215bv32, ~bvadd64(~bvneg32(~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b))))), ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0))), ~bvshl32(~bvlshr64(\old(b), 24bv32), 24bv32))) && 0bv32 == ~bvand64(33554432bv32, ~bvadd64(~bvneg32(~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b))))), ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0)))))) || ((((((((\exists addflt_~ma~0 : bv32 :: __retres10 == ~bvor32(addflt_~ma~0, ~bvshl32(~bvadd64(~bvlshr64(\old(a), 24bv32), 1bv32), 24bv32))) && !~bvult64(\old(a), \old(b))) && !(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967041bv32) == 0bv32)) && ~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967169bv32) == ea) && a == \old(a)) && b == \old(b)) || (((((\exists addflt_~a : bv32 :: (~bvadd64(~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ea))), ma) == ~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~a)) && ~bvult64(\old(a), addflt_~a)) && ~bvadd64(~bvlshr64(addflt_~a, 24bv32), 4294967168bv32) == ea) && ((((a == \old(a) && !~bvult64(a, b)) || (b == \old(a) && !~bvult64(a, b))) && b == \old(b)) || (((a == \old(a) && !~bvult64(a, b)) || (b == \old(a) && !~bvult64(a, b))) && a == \old(b)))) && ~bvadd64(__retres10, 1bv32) == 0bv32) && !(0bv32 == ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ea)))) && ~bvult64(\old(a), a))) && !(0bv32 == \old(a)))) || (((~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b))), ~bvadd64(~bvlshr64(a, 24bv32), ~bvneg32(~bvadd64(~bvlshr64(\old(b), 24bv32), 4294967168bv32)), 4294967168bv32)) == mb && (((a == \old(a) && b == \old(b)) && (((((a == \old(a) && !~bvult64(a, b)) || (b == \old(a) && !~bvult64(a, b))) && b == \old(b)) || (((a == \old(a) && !~bvult64(a, b)) || (b == \old(a) && !~bvult64(a, b))) && a == \old(b))) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a))) && !~bvult64(__retres10, \old(a))) || ((((~bvadd64(__retres10, 1bv32) == 0bv32 && !~bvult64(\old(a), \old(b))) && a == \old(a)) && b == \old(b)) && !(0bv32 == ~bvand64(33554432bv32, ma))))) && ~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32) == ea) && !(0bv32 == \old(a)))) || 0bv32 == \old(a)) || (0bv32 == \old(b) && b == \old(b))) || (((~bvadd64(~bvlshr64(\old(b), 24bv32), 4294967169bv32) == ea && (\exists v_addflt_~ma~0_69 : bv32 :: __retres10 == ~bvor32(~bvand64(16777215bv32, v_addflt_~ma~0_69), ~bvshl32(~bvadd64(~bvlshr64(\old(b), 24bv32), 1bv32), 24bv32)))) && !(~bvadd64(~bvlshr64(\old(b), 24bv32), 4294967041bv32) == 0bv32)) && a == \old(b))) && ((((\exists addflt_~delta~0 : bv32, addflt_~b : bv32 :: ~bvadd64(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0), 33554431bv32) == ma) || (((!(~bvand64(33554432bv32, ~bvadd64(mb, ma)) == 0bv32) || !~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(mb, ma)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a))) && (!~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(ea, ~bvneg32(eb))), ma)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a)) || !(~bvand64(33554432bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(ea, ~bvneg32(eb))), ma)) == 0bv32))) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a)))) || 0bv32 == \old(b)) || !(~bvadd64(\old(a), 1bv32) == 0bv32))) && (((!~bvult64(\old(a), \old(b)) || ((((\exists addflt_~delta~0 : bv32, addflt_~b : bv32 :: ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0) == mb) && ~bvadd64(ma, 4261412865bv32) == 0bv32) || (\exists addflt_~delta~0 : bv32, addflt_~b : bv32 :: !(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0) == 0bv32) && 33554431bv32 == ~bvadd64(~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0)), ma))) && ~bvult64(\old(a), a))) || (0bv32 == \old(a) && ~bvadd64(a, 1bv32) == 0bv32)) || !(4294967295bv32 == \old(b)))) && ((~bvadd64(ma, 4227858434bv32) == 0bv32 || !(4294967295bv32 == \old(b))) || !(~bvadd64(\old(a), 1bv32) == 0bv32))) && (~bvugt32(\old(b), 0bv32) || __retres10 == \old(a))) && ((((b == \old(a) && (((((a == \old(a) && !~bvult64(a, b)) || (b == \old(a) && !~bvult64(a, b))) && b == \old(b)) || (((a == \old(a) && !~bvult64(a, b)) || (b == \old(a) && !~bvult64(a, b))) && a == \old(b))) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a))) && !~bvult64(__retres10, \old(a))) || ((((((((\exists addflt_~ma~0 : bv32 :: __retres10 == ~bvor32(addflt_~ma~0, ~bvshl32(~bvadd64(~bvlshr64(\old(a), 24bv32), 1bv32), 24bv32))) && !~bvult64(\old(a), \old(b))) && !(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967041bv32) == 0bv32)) && ~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967169bv32) == ea) && a == \old(a)) && b == \old(b)) || (((((\exists addflt_~a : bv32 :: (~bvadd64(~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ea))), ma) == ~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~a)) && ~bvult64(\old(a), addflt_~a)) && ~bvadd64(~bvlshr64(addflt_~a, 24bv32), 4294967168bv32) == ea) && ((((a == \old(a) && !~bvult64(a, b)) || (b == \old(a) && !~bvult64(a, b))) && b == \old(b)) || (((a == \old(a) && !~bvult64(a, b)) || (b == \old(a) && !~bvult64(a, b))) && a == \old(b)))) && ~bvadd64(__retres10, 1bv32) == 0bv32) && !(0bv32 == ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ea)))) && ~bvult64(\old(a), a))) && !(0bv32 == \old(a)))) || (a == \old(a) && __retres10 == \old(a))) || (((~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b))), ~bvadd64(~bvlshr64(a, 24bv32), ~bvneg32(~bvadd64(~bvlshr64(\old(b), 24bv32), 4294967168bv32)), 4294967168bv32)) == mb && (((a == \old(a) && b == \old(b)) && (((((a == \old(a) && !~bvult64(a, b)) || (b == \old(a) && !~bvult64(a, b))) && b == \old(b)) || (((a == \old(a) && !~bvult64(a, b)) || (b == \old(a) && !~bvult64(a, b))) && a == \old(b))) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a))) && !~bvult64(__retres10, \old(a))) || ((((~bvadd64(__retres10, 1bv32) == 0bv32 && !~bvult64(\old(a), \old(b))) && a == \old(a)) && b == \old(b)) && !(0bv32 == ~bvand64(33554432bv32, ma))))) && ~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32) == ea) && !(0bv32 == \old(a))))) && ((!(0bv32 == \old(a)) || (a == \old(a) && !~bvult64(a, b))) || ((__retres10 == \old(b) && a == \old(b)) && !~bvult64(a, b)))) && ((!(4294967295bv32 == \old(b)) || 127bv32 == eb) || !(~bvadd64(\old(a), 1bv32) == 0bv32)) - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: !(0bv32 == \old(m)) - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: !(0bv32 == \old(m)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 77 locations, 1 error locations. SAFE Result, 220.4s OverallTime, 44 OverallIterations, 4 TraceHistogramMax, 66.3s AutomataDifference, 0.0s DeadEndRemovalTime, 128.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 4905 SDtfs, 2271 SDslu, 27365 SDs, 0 SdLazy, 6709 SolverSat, 372 SolverUnsat, 16 SolverUnknown, 0 SolverNotchecked, 42.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3295 GetRequests, 2826 SyntacticMatches, 15 SemanticMatches, 454 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 690 ImplicationChecksByTransitivity, 43.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=477occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 44 MinimizatonAttempts, 1400 StatesRemovedByMinimization, 40 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 483 PreInvPairs, 644 NumberOfFragments, 3603 HoareAnnotationTreeSize, 483 FomulaSimplifications, 3930228 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 22 FomulaSimplificationsInter, 189132 FormulaSimplificationTreeSizeReductionInter, 128.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 22.3s InterpolantComputationTime, 2700 NumberOfCodeBlocks, 2682 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 3063 ConstructedInterpolants, 91 QuantifiedInterpolants, 538875 SizeOfPredicates, 230 NumberOfNonLiveVariables, 4623 ConjunctsInSsa, 410 ConjunctsInUnsatCore, 55 InterpolantComputations, 34 PerfectInterpolantSequences, 1018/1099 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...