./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_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/config/TaipanReach.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_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/config/TaipanReach.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_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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-03 02:51:05,721 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 02:51:05,722 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 02:51:05,728 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 02:51:05,729 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 02:51:05,729 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 02:51:05,730 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 02:51:05,731 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 02:51:05,732 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 02:51:05,733 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 02:51:05,733 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 02:51:05,734 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 02:51:05,734 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 02:51:05,735 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 02:51:05,736 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 02:51:05,736 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 02:51:05,737 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 02:51:05,738 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 02:51:05,739 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 02:51:05,741 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 02:51:05,741 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 02:51:05,742 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 02:51:05,744 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 02:51:05,744 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 02:51:05,744 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 02:51:05,745 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 02:51:05,746 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 02:51:05,746 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 02:51:05,747 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 02:51:05,748 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 02:51:05,748 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 02:51:05,748 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 02:51:05,748 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 02:51:05,749 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 02:51:05,749 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 02:51:05,750 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 02:51:05,750 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-03 02:51:05,759 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 02:51:05,759 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 02:51:05,760 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 02:51:05,760 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 02:51:05,760 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 02:51:05,760 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 02:51:05,761 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 02:51:05,761 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 02:51:05,761 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 02:51:05,761 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 02:51:05,761 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 02:51:05,761 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 02:51:05,761 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 02:51:05,762 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 02:51:05,762 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 02:51:05,762 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 02:51:05,762 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 02:51:05,762 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 02:51:05,763 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 02:51:05,763 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 02:51:05,763 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 02:51:05,763 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 02:51:05,763 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 02:51:05,763 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 02:51:05,763 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 02:51:05,763 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 02:51:05,763 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 02:51:05,763 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 02:51:05,763 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 02:51:05,764 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 02:51:05,764 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 02:51:05,764 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 02:51:05,764 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 02:51:05,764 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 02:51:05,764 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 02:51:05,764 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 02:51:05,764 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f756365182c9801d4a2ac186a40692687a86b469 [2018-12-03 02:51:05,783 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 02:51:05,790 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 02:51:05,792 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 02:51:05,793 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 02:51:05,793 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 02:51:05,793 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/../../sv-benchmarks/c/bitvector/soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-12-03 02:51:05,831 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/data/9f337ee58/4fcae275867a41a3ad9f8d9e85147906/FLAG3398daa22 [2018-12-03 02:51:06,220 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 02:51:06,221 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/sv-benchmarks/c/bitvector/soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-12-03 02:51:06,225 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/data/9f337ee58/4fcae275867a41a3ad9f8d9e85147906/FLAG3398daa22 [2018-12-03 02:51:06,583 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/data/9f337ee58/4fcae275867a41a3ad9f8d9e85147906 [2018-12-03 02:51:06,585 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 02:51:06,586 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 02:51:06,586 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 02:51:06,586 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 02:51:06,588 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 02:51:06,589 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 02:51:06" (1/1) ... [2018-12-03 02:51:06,591 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f270acf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:51:06, skipping insertion in model container [2018-12-03 02:51:06,591 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 02:51:06" (1/1) ... [2018-12-03 02:51:06,595 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 02:51:06,613 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 02:51:06,728 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 02:51:06,731 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 02:51:06,756 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 02:51:06,764 INFO L195 MainTranslator]: Completed translation [2018-12-03 02:51:06,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:51:06 WrapperNode [2018-12-03 02:51:06,764 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 02:51:06,764 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 02:51:06,765 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 02:51:06,765 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 02:51:06,769 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:51:06" (1/1) ... [2018-12-03 02:51:06,774 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:51:06" (1/1) ... [2018-12-03 02:51:06,809 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 02:51:06,809 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 02:51:06,809 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 02:51:06,809 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 02:51:06,817 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:51:06" (1/1) ... [2018-12-03 02:51:06,817 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:51:06" (1/1) ... [2018-12-03 02:51:06,818 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:51:06" (1/1) ... [2018-12-03 02:51:06,818 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:51:06" (1/1) ... [2018-12-03 02:51:06,823 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:51:06" (1/1) ... [2018-12-03 02:51:06,827 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:51:06" (1/1) ... [2018-12-03 02:51:06,828 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:51:06" (1/1) ... [2018-12-03 02:51:06,830 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 02:51:06,830 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 02:51:06,830 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 02:51:06,830 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 02:51:06,831 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:51:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 02:51:06,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-03 02:51:06,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-03 02:51:06,863 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2018-12-03 02:51:06,863 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2018-12-03 02:51:06,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 02:51:06,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 02:51:06,863 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 02:51:06,863 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 02:51:06,863 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2018-12-03 02:51:06,863 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2018-12-03 02:51:06,863 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-03 02:51:06,864 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-03 02:51:07,079 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 02:51:07,079 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-03 02:51:07,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 02:51:07 BoogieIcfgContainer [2018-12-03 02:51:07,079 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 02:51:07,080 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 02:51:07,080 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 02:51:07,082 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 02:51:07,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 02:51:06" (1/3) ... [2018-12-03 02:51:07,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bff3a44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 02:51:07, skipping insertion in model container [2018-12-03 02:51:07,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:51:06" (2/3) ... [2018-12-03 02:51:07,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bff3a44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 02:51:07, skipping insertion in model container [2018-12-03 02:51:07,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 02:51:07" (3/3) ... [2018-12-03 02:51:07,084 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-12-03 02:51:07,090 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 02:51:07,095 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 02:51:07,109 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 02:51:07,133 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 02:51:07,133 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 02:51:07,133 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 02:51:07,134 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 02:51:07,134 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 02:51:07,134 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 02:51:07,134 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 02:51:07,134 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 02:51:07,145 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states. [2018-12-03 02:51:07,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 02:51:07,149 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:51:07,149 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-03 02:51:07,151 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:51:07,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:51:07,154 INFO L82 PathProgramCache]: Analyzing trace with hash -441638981, now seen corresponding path program 1 times [2018-12-03 02:51:07,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:51:07,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:51:07,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:51:07,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:51:07,184 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:51:07,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:51:07,328 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-03 02:51:07,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:51:07,330 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 02:51:07,331 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 37 with the following transitions: [2018-12-03 02:51:07,333 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [62], [63], [67], [69], [71], [73], [76], [89], [194], [197], [205], [229], [232], [234], [240], [241], [242], [244], [245], [246], [247], [248], [249], [250], [258] [2018-12-03 02:51:07,355 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 02:51:07,356 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 02:51:07,431 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 02:51:07,432 INFO L272 AbstractInterpreter]: Visited 19 different actions 27 times. Never merged. Never widened. Performed 71 root evaluator evaluations with a maximum evaluation depth of 3. Performed 71 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 29 variables. [2018-12-03 02:51:07,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:51:07,438 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 02:51:07,481 INFO L227 lantSequenceWeakener]: Weakened 10 states. On average, predicates are now at 68.83% of their original sizes. [2018-12-03 02:51:07,481 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 02:51:07,539 INFO L418 sIntCurrentIteration]: We unified 35 AI predicates to 35 [2018-12-03 02:51:07,539 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 02:51:07,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 02:51:07,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 16 [2018-12-03 02:51:07,540 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:51:07,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 02:51:07,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 02:51:07,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-12-03 02:51:07,547 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 12 states. [2018-12-03 02:51:08,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:51:08,230 INFO L93 Difference]: Finished difference Result 224 states and 366 transitions. [2018-12-03 02:51:08,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 02:51:08,231 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 36 [2018-12-03 02:51:08,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:51:08,238 INFO L225 Difference]: With dead ends: 224 [2018-12-03 02:51:08,238 INFO L226 Difference]: Without dead ends: 142 [2018-12-03 02:51:08,242 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-12-03 02:51:08,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-12-03 02:51:08,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 130. [2018-12-03 02:51:08,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-03 02:51:08,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 183 transitions. [2018-12-03 02:51:08,282 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 183 transitions. Word has length 36 [2018-12-03 02:51:08,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:51:08,282 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 183 transitions. [2018-12-03 02:51:08,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 02:51:08,283 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 183 transitions. [2018-12-03 02:51:08,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 02:51:08,284 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:51:08,284 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-03 02:51:08,284 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:51:08,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:51:08,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1149609499, now seen corresponding path program 1 times [2018-12-03 02:51:08,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:51:08,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:51:08,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:51:08,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:51:08,286 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:51:08,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:51:08,399 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-03 02:51:08,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:51:08,399 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 02:51:08,399 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 41 with the following transitions: [2018-12-03 02:51:08,399 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [62], [63], [67], [69], [71], [73], [78], [83], [85], [91], [96], [98], [194], [197], [205], [229], [232], [234], [240], [241], [242], [244], [245], [246], [247], [248], [249], [250], [258] [2018-12-03 02:51:08,400 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 02:51:08,401 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 02:51:08,414 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 02:51:08,414 INFO L272 AbstractInterpreter]: Visited 27 different actions 35 times. Never merged. Never widened. Performed 95 root evaluator evaluations with a maximum evaluation depth of 3. Performed 95 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 29 variables. [2018-12-03 02:51:08,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:51:08,415 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 02:51:08,434 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 62.65% of their original sizes. [2018-12-03 02:51:08,434 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 02:51:08,529 INFO L418 sIntCurrentIteration]: We unified 39 AI predicates to 39 [2018-12-03 02:51:08,529 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 02:51:08,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 02:51:08,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [9] total 24 [2018-12-03 02:51:08,530 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:51:08,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 02:51:08,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 02:51:08,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2018-12-03 02:51:08,532 INFO L87 Difference]: Start difference. First operand 130 states and 183 transitions. Second operand 17 states. [2018-12-03 02:51:09,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:51:09,219 INFO L93 Difference]: Finished difference Result 187 states and 264 transitions. [2018-12-03 02:51:09,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 02:51:09,219 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 40 [2018-12-03 02:51:09,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:51:09,221 INFO L225 Difference]: With dead ends: 187 [2018-12-03 02:51:09,221 INFO L226 Difference]: Without dead ends: 148 [2018-12-03 02:51:09,222 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 45 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2018-12-03 02:51:09,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-12-03 02:51:09,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 136. [2018-12-03 02:51:09,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-03 02:51:09,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 188 transitions. [2018-12-03 02:51:09,234 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 188 transitions. Word has length 40 [2018-12-03 02:51:09,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:51:09,234 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 188 transitions. [2018-12-03 02:51:09,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 02:51:09,234 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 188 transitions. [2018-12-03 02:51:09,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 02:51:09,235 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:51:09,235 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-03 02:51:09,236 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:51:09,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:51:09,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1042420980, now seen corresponding path program 1 times [2018-12-03 02:51:09,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:51:09,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:51:09,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:51:09,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:51:09,237 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:51:09,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:51:09,333 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-03 02:51:09,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:51:09,333 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 02:51:09,334 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2018-12-03 02:51:09,334 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [6], [35], [44], [48], [54], [62], [63], [67], [69], [71], [73], [78], [83], [85], [91], [96], [98], [194], [197], [205], [229], [232], [234], [240], [241], [242], [244], [245], [246], [247], [248], [249], [250], [258] [2018-12-03 02:51:09,335 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 02:51:09,335 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 02:51:09,377 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 02:51:09,377 INFO L272 AbstractInterpreter]: Visited 37 different actions 88 times. Merged at 13 different actions 25 times. Never widened. Performed 265 root evaluator evaluations with a maximum evaluation depth of 6. Performed 265 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 2 fixpoints after 2 different actions. Largest state had 29 variables. [2018-12-03 02:51:09,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:51:09,380 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 02:51:09,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:51:09,380 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/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-03 02:51:09,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:51:09,389 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 02:51:09,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:51:09,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:51:09,471 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-03 02:51:09,472 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 02:51:09,572 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-03 02:51:09,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 02:51:09,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 19 [2018-12-03 02:51:09,587 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 02:51:09,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 02:51:09,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 02:51:09,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2018-12-03 02:51:09,589 INFO L87 Difference]: Start difference. First operand 136 states and 188 transitions. Second operand 12 states. [2018-12-03 02:51:09,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:51:09,811 INFO L93 Difference]: Finished difference Result 214 states and 304 transitions. [2018-12-03 02:51:09,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 02:51:09,811 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 44 [2018-12-03 02:51:09,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:51:09,812 INFO L225 Difference]: With dead ends: 214 [2018-12-03 02:51:09,812 INFO L226 Difference]: Without dead ends: 176 [2018-12-03 02:51:09,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2018-12-03 02:51:09,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-12-03 02:51:09,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 150. [2018-12-03 02:51:09,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-12-03 02:51:09,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 208 transitions. [2018-12-03 02:51:09,823 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 208 transitions. Word has length 44 [2018-12-03 02:51:09,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:51:09,823 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 208 transitions. [2018-12-03 02:51:09,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 02:51:09,823 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 208 transitions. [2018-12-03 02:51:09,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 02:51:09,824 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:51:09,824 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-03 02:51:09,824 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:51:09,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:51:09,825 INFO L82 PathProgramCache]: Analyzing trace with hash -985162678, now seen corresponding path program 1 times [2018-12-03 02:51:09,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:51:09,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:51:09,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:51:09,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:51:09,826 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:51:09,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:51:09,952 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-03 02:51:09,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:51:09,952 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 02:51:09,952 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2018-12-03 02:51:09,953 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [6], [35], [44], [48], [54], [62], [63], [67], [69], [71], [73], [78], [83], [85], [91], [96], [98], [194], [199], [205], [229], [232], [234], [240], [241], [242], [244], [245], [246], [247], [248], [249], [250], [258] [2018-12-03 02:51:09,954 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 02:51:09,954 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 02:51:09,986 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 02:51:09,986 INFO L272 AbstractInterpreter]: Visited 37 different actions 92 times. Merged at 13 different actions 28 times. Never widened. Performed 281 root evaluator evaluations with a maximum evaluation depth of 6. Performed 281 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 2 fixpoints after 2 different actions. Largest state had 29 variables. [2018-12-03 02:51:09,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:51:09,988 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 02:51:09,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:51:09,988 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/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-03 02:51:10,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:51:10,001 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 02:51:10,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:51:10,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:51:10,146 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-03 02:51:10,146 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 02:51:10,470 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 02:51:10,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 02:51:10,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 14] total 31 [2018-12-03 02:51:10,485 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 02:51:10,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 02:51:10,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 02:51:10,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=839, Unknown=0, NotChecked=0, Total=930 [2018-12-03 02:51:10,486 INFO L87 Difference]: Start difference. First operand 150 states and 208 transitions. Second operand 19 states. [2018-12-03 02:51:10,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:51:10,972 INFO L93 Difference]: Finished difference Result 315 states and 459 transitions. [2018-12-03 02:51:10,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 02:51:10,972 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 44 [2018-12-03 02:51:10,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:51:10,973 INFO L225 Difference]: With dead ends: 315 [2018-12-03 02:51:10,973 INFO L226 Difference]: Without dead ends: 242 [2018-12-03 02:51:10,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 67 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=201, Invalid=1691, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 02:51:10,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-12-03 02:51:10,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 208. [2018-12-03 02:51:10,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-12-03 02:51:10,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 289 transitions. [2018-12-03 02:51:10,985 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 289 transitions. Word has length 44 [2018-12-03 02:51:10,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:51:10,986 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 289 transitions. [2018-12-03 02:51:10,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 02:51:10,986 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 289 transitions. [2018-12-03 02:51:10,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 02:51:10,987 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:51:10,987 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-03 02:51:10,987 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:51:10,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:51:10,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1720292238, now seen corresponding path program 1 times [2018-12-03 02:51:10,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:51:10,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:51:10,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:51:10,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:51:10,988 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:51:10,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:51:11,074 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-03 02:51:11,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:51:11,074 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 02:51:11,075 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2018-12-03 02:51:11,075 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [6], [35], [44], [50], [60], [62], [63], [67], [69], [71], [73], [78], [83], [85], [91], [96], [98], [194], [199], [205], [229], [232], [234], [240], [241], [242], [244], [245], [246], [247], [248], [249], [250], [258] [2018-12-03 02:51:11,076 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 02:51:11,076 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 02:51:11,105 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 02:51:11,105 INFO L272 AbstractInterpreter]: Visited 37 different actions 113 times. Merged at 13 different actions 35 times. Never widened. Performed 341 root evaluator evaluations with a maximum evaluation depth of 6. Performed 341 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Never found a fixpoint. Largest state had 29 variables. [2018-12-03 02:51:11,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:51:11,106 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 02:51:11,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:51:11,106 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 02:51:11,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:51:11,113 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 02:51:11,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:51:11,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:51:11,218 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-03 02:51:11,219 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 02:51:11,344 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-03 02:51:11,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 02:51:11,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 22 [2018-12-03 02:51:11,359 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 02:51:11,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 02:51:11,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 02:51:11,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2018-12-03 02:51:11,359 INFO L87 Difference]: Start difference. First operand 208 states and 289 transitions. Second operand 17 states. [2018-12-03 02:51:11,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:51:11,759 INFO L93 Difference]: Finished difference Result 359 states and 519 transitions. [2018-12-03 02:51:11,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 02:51:11,759 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 44 [2018-12-03 02:51:11,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:51:11,761 INFO L225 Difference]: With dead ends: 359 [2018-12-03 02:51:11,761 INFO L226 Difference]: Without dead ends: 295 [2018-12-03 02:51:11,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=1175, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 02:51:11,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-12-03 02:51:11,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 222. [2018-12-03 02:51:11,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-12-03 02:51:11,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 306 transitions. [2018-12-03 02:51:11,776 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 306 transitions. Word has length 44 [2018-12-03 02:51:11,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:51:11,776 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 306 transitions. [2018-12-03 02:51:11,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 02:51:11,776 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 306 transitions. [2018-12-03 02:51:11,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 02:51:11,777 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:51:11,778 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-03 02:51:11,778 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:51:11,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:51:11,778 INFO L82 PathProgramCache]: Analyzing trace with hash 770276810, now seen corresponding path program 1 times [2018-12-03 02:51:11,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:51:11,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:51:11,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:51:11,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:51:11,779 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:51:11,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:51:11,840 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-03 02:51:11,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:51:11,840 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 02:51:11,840 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2018-12-03 02:51:11,840 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [6], [35], [44], [48], [54], [62], [63], [67], [69], [71], [73], [78], [81], [85], [91], [94], [98], [194], [197], [205], [229], [232], [234], [240], [241], [242], [244], [245], [246], [247], [248], [249], [250], [258] [2018-12-03 02:51:11,841 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 02:51:11,842 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 02:51:11,869 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 02:51:11,869 INFO L272 AbstractInterpreter]: Visited 37 different actions 84 times. Merged at 11 different actions 23 times. Never widened. Performed 242 root evaluator evaluations with a maximum evaluation depth of 6. Performed 242 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Never found a fixpoint. Largest state had 29 variables. [2018-12-03 02:51:11,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:51:11,871 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 02:51:11,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:51:11,871 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/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-03 02:51:11,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:51:11,879 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 02:51:11,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:51:11,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:51:11,946 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-03 02:51:11,946 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 02:51:12,034 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-03 02:51:12,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 02:51:12,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 8] total 18 [2018-12-03 02:51:12,049 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:51:12,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 02:51:12,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 02:51:12,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2018-12-03 02:51:12,050 INFO L87 Difference]: Start difference. First operand 222 states and 306 transitions. Second operand 6 states. [2018-12-03 02:51:12,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:51:12,120 INFO L93 Difference]: Finished difference Result 311 states and 440 transitions. [2018-12-03 02:51:12,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 02:51:12,120 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-12-03 02:51:12,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:51:12,122 INFO L225 Difference]: With dead ends: 311 [2018-12-03 02:51:12,122 INFO L226 Difference]: Without dead ends: 268 [2018-12-03 02:51:12,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2018-12-03 02:51:12,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-12-03 02:51:12,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 228. [2018-12-03 02:51:12,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-12-03 02:51:12,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 313 transitions. [2018-12-03 02:51:12,132 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 313 transitions. Word has length 44 [2018-12-03 02:51:12,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:51:12,132 INFO L480 AbstractCegarLoop]: Abstraction has 228 states and 313 transitions. [2018-12-03 02:51:12,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 02:51:12,132 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 313 transitions. [2018-12-03 02:51:12,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 02:51:12,133 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:51:12,135 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-03 02:51:12,135 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:51:12,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:51:12,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1063865541, now seen corresponding path program 2 times [2018-12-03 02:51:12,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:51:12,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:51:12,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:51:12,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:51:12,136 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:51:12,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:51:12,302 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-03 02:51:12,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:51:12,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-03 02:51:12,302 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:51:12,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 02:51:12,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 02:51:12,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-12-03 02:51:12,303 INFO L87 Difference]: Start difference. First operand 228 states and 313 transitions. Second operand 14 states. [2018-12-03 02:51:12,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:51:12,529 INFO L93 Difference]: Finished difference Result 399 states and 574 transitions. [2018-12-03 02:51:12,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 02:51:12,530 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 48 [2018-12-03 02:51:12,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:51:12,531 INFO L225 Difference]: With dead ends: 399 [2018-12-03 02:51:12,531 INFO L226 Difference]: Without dead ends: 333 [2018-12-03 02:51:12,532 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-03 02:51:12,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-12-03 02:51:12,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 316. [2018-12-03 02:51:12,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-12-03 02:51:12,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 439 transitions. [2018-12-03 02:51:12,545 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 439 transitions. Word has length 48 [2018-12-03 02:51:12,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:51:12,545 INFO L480 AbstractCegarLoop]: Abstraction has 316 states and 439 transitions. [2018-12-03 02:51:12,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 02:51:12,545 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 439 transitions. [2018-12-03 02:51:12,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 02:51:12,546 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:51:12,546 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-03 02:51:12,546 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:51:12,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:51:12,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1641589375, now seen corresponding path program 1 times [2018-12-03 02:51:12,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:51:12,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:51:12,547 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 02:51:12,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:51:12,548 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:51:12,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:51:12,604 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-03 02:51:12,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:51:12,605 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 02:51:12,605 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 49 with the following transitions: [2018-12-03 02:51:12,605 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [6], [35], [44], [48], [50], [54], [60], [62], [63], [67], [69], [71], [73], [78], [81], [85], [91], [94], [98], [194], [197], [205], [229], [232], [234], [240], [241], [242], [244], [245], [246], [247], [248], [249], [250], [258] [2018-12-03 02:51:12,606 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 02:51:12,606 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 02:51:12,632 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 02:51:12,632 INFO L272 AbstractInterpreter]: Visited 39 different actions 128 times. Merged at 12 different actions 49 times. Never widened. Performed 332 root evaluator evaluations with a maximum evaluation depth of 6. Performed 332 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 3 fixpoints after 1 different actions. Largest state had 29 variables. [2018-12-03 02:51:12,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:51:12,634 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 02:51:12,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:51:12,634 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 02:51:12,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:51:12,640 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 02:51:12,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:51:12,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:51:12,670 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-03 02:51:12,670 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 02:51:12,894 WARN L832 $PredicateComparison]: unable to prove that (forall ((main_~b~0 Int)) (<= (mod main_~b~0 4294967296) (mod c_main_~a~0 4294967296))) is different from false [2018-12-03 02:51:13,103 WARN L832 $PredicateComparison]: unable to prove that (forall ((main_~b~0 Int)) (<= (mod main_~b~0 4294967296) (mod |c_main_#t~ret5| 4294967296))) is different from false [2018-12-03 02:51:13,316 WARN L832 $PredicateComparison]: unable to prove that (forall ((main_~b~0 Int)) (<= (mod main_~b~0 4294967296) (mod |c_base2flt_#res| 4294967296))) is different from false [2018-12-03 02:51:13,521 WARN L832 $PredicateComparison]: unable to prove that (forall ((main_~b~0 Int)) (<= (mod main_~b~0 4294967296) (mod c_base2flt_~__retres4~0 4294967296))) is different from false [2018-12-03 02:51:13,527 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-03 02:51:13,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 02:51:13,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2018-12-03 02:51:13,541 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 02:51:13,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 02:51:13,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 02:51:13,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=75, Unknown=4, NotChecked=76, Total=182 [2018-12-03 02:51:13,542 INFO L87 Difference]: Start difference. First operand 316 states and 439 transitions. Second operand 8 states. [2018-12-03 02:51:13,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:51:13,613 INFO L93 Difference]: Finished difference Result 388 states and 541 transitions. [2018-12-03 02:51:13,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 02:51:13,613 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 48 [2018-12-03 02:51:13,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:51:13,614 INFO L225 Difference]: With dead ends: 388 [2018-12-03 02:51:13,614 INFO L226 Difference]: Without dead ends: 349 [2018-12-03 02:51:13,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=37, Invalid=107, Unknown=4, NotChecked=92, Total=240 [2018-12-03 02:51:13,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-12-03 02:51:13,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 335. [2018-12-03 02:51:13,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-12-03 02:51:13,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 462 transitions. [2018-12-03 02:51:13,623 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 462 transitions. Word has length 48 [2018-12-03 02:51:13,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:51:13,623 INFO L480 AbstractCegarLoop]: Abstraction has 335 states and 462 transitions. [2018-12-03 02:51:13,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 02:51:13,623 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 462 transitions. [2018-12-03 02:51:13,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 02:51:13,624 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:51:13,624 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-03 02:51:13,624 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:51:13,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:51:13,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1698847677, now seen corresponding path program 1 times [2018-12-03 02:51:13,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:51:13,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:51:13,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:51:13,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:51:13,625 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:51:13,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 02:51:13,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 02:51:13,647 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-03 02:51:13,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 02:51:13 BoogieIcfgContainer [2018-12-03 02:51:13,666 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 02:51:13,666 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 02:51:13,666 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 02:51:13,666 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 02:51:13,667 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 02:51:07" (3/4) ... [2018-12-03 02:51:13,669 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-03 02:51:13,669 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 02:51:13,670 INFO L168 Benchmark]: Toolchain (without parser) took 7084.49 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 315.1 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -151.9 MB). Peak memory consumption was 163.2 MB. Max. memory is 11.5 GB. [2018-12-03 02:51:13,671 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 02:51:13,671 INFO L168 Benchmark]: CACSL2BoogieTranslator took 178.02 ms. Allocated memory is still 1.0 GB. Free memory was 952.4 MB in the beginning and 936.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-03 02:51:13,671 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 936.3 MB in the beginning and 1.1 GB in the end (delta: -182.2 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2018-12-03 02:51:13,671 INFO L168 Benchmark]: Boogie Preprocessor took 20.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 02:51:13,671 INFO L168 Benchmark]: RCFGBuilder took 249.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2018-12-03 02:51:13,672 INFO L168 Benchmark]: TraceAbstraction took 6585.99 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 185.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -10.1 MB). Peak memory consumption was 175.5 MB. Max. memory is 11.5 GB. [2018-12-03 02:51:13,672 INFO L168 Benchmark]: Witness Printer took 3.11 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 02:51:13,674 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 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 178.02 ms. Allocated memory is still 1.0 GB. Free memory was 952.4 MB in the beginning and 936.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 44.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 936.3 MB in the beginning and 1.1 GB in the end (delta: -182.2 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 249.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6585.99 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 185.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -10.1 MB). Peak memory consumption was 175.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.11 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 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, 6.5s OverallTime, 9 OverallIterations, 3 TraceHistogramMax, 2.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 943 SDtfs, 1124 SDslu, 8072 SDs, 0 SdLazy, 2425 SolverSat, 135 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 633 GetRequests, 441 SyntacticMatches, 8 SemanticMatches, 184 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=335occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 7 AbstIntIterations, 2 AbstIntStrong, 0.6614543114543113 AbsIntWeakeningRatio, 2.0 AbsIntAvgWeakeningVarsNumRemoved, 0.918918918918919 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 228 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 620 NumberOfCodeBlocks, 620 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 778 ConstructedInterpolants, 37 QuantifiedInterpolants, 122450 SizeOfPredicates, 24 NumberOfNonLiveVariables, 644 ConjunctsInSsa, 101 ConjunctsInUnsatCore, 18 InterpolantComputations, 2 PerfectInterpolantSequences, 203/283 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-03 02:51:14,945 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 02:51:14,946 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 02:51:14,952 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 02:51:14,952 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 02:51:14,953 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 02:51:14,953 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 02:51:14,954 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 02:51:14,955 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 02:51:14,955 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 02:51:14,955 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 02:51:14,956 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 02:51:14,956 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 02:51:14,956 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 02:51:14,957 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 02:51:14,957 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 02:51:14,958 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 02:51:14,959 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 02:51:14,959 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 02:51:14,960 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 02:51:14,961 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 02:51:14,961 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 02:51:14,962 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 02:51:14,962 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 02:51:14,962 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 02:51:14,963 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 02:51:14,963 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 02:51:14,964 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 02:51:14,964 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 02:51:14,964 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 02:51:14,965 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 02:51:14,965 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 02:51:14,965 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 02:51:14,965 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 02:51:14,966 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 02:51:14,966 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 02:51:14,966 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-12-03 02:51:14,974 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 02:51:14,974 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 02:51:14,974 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 02:51:14,974 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 02:51:14,974 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 02:51:14,975 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 02:51:14,975 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 02:51:14,975 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 02:51:14,975 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 02:51:14,975 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 02:51:14,975 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 02:51:14,975 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 02:51:14,975 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 02:51:14,976 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 02:51:14,976 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 02:51:14,976 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 02:51:14,976 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 02:51:14,976 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-03 02:51:14,976 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-03 02:51:14,976 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 02:51:14,976 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 02:51:14,977 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-03 02:51:14,977 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 02:51:14,977 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 02:51:14,977 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 02:51:14,977 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 02:51:14,977 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 02:51:14,977 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 02:51:14,977 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 02:51:14,978 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 02:51:14,978 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 02:51:14,978 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-03 02:51:14,978 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 02:51:14,978 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-03 02:51:14,978 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-03 02:51:14,978 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_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f756365182c9801d4a2ac186a40692687a86b469 [2018-12-03 02:51:14,996 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 02:51:15,003 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 02:51:15,005 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 02:51:15,006 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 02:51:15,006 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 02:51:15,006 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/../../sv-benchmarks/c/bitvector/soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-12-03 02:51:15,042 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/data/56ed565ac/565adfac367749138e403ff0e9d8c215/FLAGe1995fcaf [2018-12-03 02:51:15,458 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 02:51:15,458 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/sv-benchmarks/c/bitvector/soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-12-03 02:51:15,462 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/data/56ed565ac/565adfac367749138e403ff0e9d8c215/FLAGe1995fcaf [2018-12-03 02:51:15,470 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/data/56ed565ac/565adfac367749138e403ff0e9d8c215 [2018-12-03 02:51:15,472 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 02:51:15,472 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 02:51:15,473 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 02:51:15,473 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 02:51:15,475 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 02:51:15,475 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 02:51:15" (1/1) ... [2018-12-03 02:51:15,477 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3832628d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:51:15, skipping insertion in model container [2018-12-03 02:51:15,477 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 02:51:15" (1/1) ... [2018-12-03 02:51:15,481 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 02:51:15,496 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 02:51:15,604 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 02:51:15,607 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 02:51:15,633 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 02:51:15,642 INFO L195 MainTranslator]: Completed translation [2018-12-03 02:51:15,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:51:15 WrapperNode [2018-12-03 02:51:15,642 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 02:51:15,643 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 02:51:15,643 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 02:51:15,643 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 02:51:15,648 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:51:15" (1/1) ... [2018-12-03 02:51:15,654 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:51:15" (1/1) ... [2018-12-03 02:51:15,658 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 02:51:15,658 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 02:51:15,658 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 02:51:15,658 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 02:51:15,702 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:51:15" (1/1) ... [2018-12-03 02:51:15,702 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:51:15" (1/1) ... [2018-12-03 02:51:15,703 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:51:15" (1/1) ... [2018-12-03 02:51:15,703 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:51:15" (1/1) ... [2018-12-03 02:51:15,709 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:51:15" (1/1) ... [2018-12-03 02:51:15,713 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:51:15" (1/1) ... [2018-12-03 02:51:15,714 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:51:15" (1/1) ... [2018-12-03 02:51:15,715 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 02:51:15,716 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 02:51:15,716 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 02:51:15,716 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 02:51:15,716 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:51:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 02:51:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-03 02:51:15,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-03 02:51:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2018-12-03 02:51:15,747 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2018-12-03 02:51:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 02:51:15,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 02:51:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 02:51:15,747 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 02:51:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2018-12-03 02:51:15,747 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2018-12-03 02:51:15,748 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-03 02:51:15,748 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-03 02:51:15,950 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 02:51:15,950 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-03 02:51:15,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 02:51:15 BoogieIcfgContainer [2018-12-03 02:51:15,950 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 02:51:15,951 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 02:51:15,951 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 02:51:15,953 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 02:51:15,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 02:51:15" (1/3) ... [2018-12-03 02:51:15,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59abe99e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 02:51:15, skipping insertion in model container [2018-12-03 02:51:15,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:51:15" (2/3) ... [2018-12-03 02:51:15,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59abe99e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 02:51:15, skipping insertion in model container [2018-12-03 02:51:15,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 02:51:15" (3/3) ... [2018-12-03 02:51:15,955 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-12-03 02:51:15,960 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 02:51:15,965 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 02:51:15,973 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 02:51:15,990 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-03 02:51:15,991 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 02:51:15,991 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 02:51:15,991 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 02:51:15,991 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 02:51:15,991 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 02:51:15,991 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 02:51:15,991 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 02:51:15,991 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 02:51:16,002 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states. [2018-12-03 02:51:16,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 02:51:16,006 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:51:16,007 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-03 02:51:16,008 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:51:16,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:51:16,011 INFO L82 PathProgramCache]: Analyzing trace with hash -441638981, now seen corresponding path program 1 times [2018-12-03 02:51:16,013 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 02:51:16,013 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/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-03 02:51:16,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:51:16,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:51:16,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:51:16,134 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-03 02:51:16,134 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 02:51:16,167 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-03 02:51:16,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:51:16,170 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/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-03 02:51:16,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:51:16,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:51:16,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:51:16,201 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-03 02:51:16,201 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 02:51:16,235 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-03 02:51:16,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-03 02:51:16,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9] total 9 [2018-12-03 02:51:16,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 02:51:16,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 02:51:16,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 02:51:16,263 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 9 states. [2018-12-03 02:51:16,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:51:16,457 INFO L93 Difference]: Finished difference Result 199 states and 318 transitions. [2018-12-03 02:51:16,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 02:51:16,459 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-12-03 02:51:16,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:51:16,469 INFO L225 Difference]: With dead ends: 199 [2018-12-03 02:51:16,469 INFO L226 Difference]: Without dead ends: 120 [2018-12-03 02:51:16,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 135 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-03 02:51:16,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-12-03 02:51:16,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 105. [2018-12-03 02:51:16,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-03 02:51:16,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 154 transitions. [2018-12-03 02:51:16,514 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 154 transitions. Word has length 36 [2018-12-03 02:51:16,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:51:16,515 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 154 transitions. [2018-12-03 02:51:16,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 02:51:16,515 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 154 transitions. [2018-12-03 02:51:16,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 02:51:16,517 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:51:16,518 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-03 02:51:16,518 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:51:16,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:51:16,518 INFO L82 PathProgramCache]: Analyzing trace with hash 306755114, now seen corresponding path program 1 times [2018-12-03 02:51:16,519 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 02:51:16,519 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/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-03 02:51:16,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:51:16,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:51:16,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:51:16,576 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-03 02:51:16,576 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 02:51:16,616 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-03 02:51:16,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:51:16,617 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/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-03 02:51:16,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:51:16,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:51:16,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:51:16,690 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 02:51:16,690 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 02:51:16,783 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-03 02:51:16,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-03 02:51:16,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 10, 6] total 14 [2018-12-03 02:51:16,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 02:51:16,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 02:51:16,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-12-03 02:51:16,799 INFO L87 Difference]: Start difference. First operand 105 states and 154 transitions. Second operand 14 states. [2018-12-03 02:51:17,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:51:17,074 INFO L93 Difference]: Finished difference Result 344 states and 546 transitions. [2018-12-03 02:51:17,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 02:51:17,075 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 40 [2018-12-03 02:51:17,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:51:17,077 INFO L225 Difference]: With dead ends: 344 [2018-12-03 02:51:17,077 INFO L226 Difference]: Without dead ends: 274 [2018-12-03 02:51:17,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 143 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2018-12-03 02:51:17,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-12-03 02:51:17,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 156. [2018-12-03 02:51:17,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-12-03 02:51:17,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 237 transitions. [2018-12-03 02:51:17,093 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 237 transitions. Word has length 40 [2018-12-03 02:51:17,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:51:17,094 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 237 transitions. [2018-12-03 02:51:17,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 02:51:17,094 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 237 transitions. [2018-12-03 02:51:17,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 02:51:17,095 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:51:17,096 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-03 02:51:17,096 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:51:17,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:51:17,096 INFO L82 PathProgramCache]: Analyzing trace with hash 377249800, now seen corresponding path program 1 times [2018-12-03 02:51:17,096 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 02:51:17,096 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/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-03 02:51:17,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:51:17,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:51:17,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:51:17,158 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-03 02:51:17,158 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 02:51:17,195 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-03 02:51:17,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:51:17,196 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 02:51:17,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:51:17,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:51:17,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:51:17,281 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-03 02:51:17,281 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 02:51:17,392 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-03 02:51:17,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2018-12-03 02:51:17,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 8, 12] total 18 [2018-12-03 02:51:17,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 02:51:17,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 02:51:17,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2018-12-03 02:51:17,408 INFO L87 Difference]: Start difference. First operand 156 states and 237 transitions. Second operand 18 states. [2018-12-03 02:51:18,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:51:18,086 INFO L93 Difference]: Finished difference Result 377 states and 566 transitions. [2018-12-03 02:51:18,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 02:51:18,086 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 44 [2018-12-03 02:51:18,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:51:18,088 INFO L225 Difference]: With dead ends: 377 [2018-12-03 02:51:18,088 INFO L226 Difference]: Without dead ends: 301 [2018-12-03 02:51:18,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 154 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2018-12-03 02:51:18,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-12-03 02:51:18,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 251. [2018-12-03 02:51:18,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-12-03 02:51:18,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 362 transitions. [2018-12-03 02:51:18,110 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 362 transitions. Word has length 44 [2018-12-03 02:51:18,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:51:18,110 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 362 transitions. [2018-12-03 02:51:18,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 02:51:18,110 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 362 transitions. [2018-12-03 02:51:18,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 02:51:18,113 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:51:18,113 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-03 02:51:18,113 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:51:18,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:51:18,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1751112318, now seen corresponding path program 1 times [2018-12-03 02:51:18,114 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 02:51:18,114 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/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-03 02:51:18,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:51:18,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:51:18,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:51:18,179 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-03 02:51:18,180 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 02:51:18,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:51:18,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 02:51:18,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 02:51:18,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 02:51:18,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 02:51:18,181 INFO L87 Difference]: Start difference. First operand 251 states and 362 transitions. Second operand 8 states. [2018-12-03 02:51:18,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:51:18,259 INFO L93 Difference]: Finished difference Result 351 states and 509 transitions. [2018-12-03 02:51:18,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 02:51:18,260 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2018-12-03 02:51:18,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:51:18,262 INFO L225 Difference]: With dead ends: 351 [2018-12-03 02:51:18,262 INFO L226 Difference]: Without dead ends: 286 [2018-12-03 02:51:18,262 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-03 02:51:18,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-12-03 02:51:18,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 273. [2018-12-03 02:51:18,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-12-03 02:51:18,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 393 transitions. [2018-12-03 02:51:18,278 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 393 transitions. Word has length 44 [2018-12-03 02:51:18,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:51:18,279 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 393 transitions. [2018-12-03 02:51:18,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 02:51:18,279 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 393 transitions. [2018-12-03 02:51:18,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 02:51:18,281 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:51:18,281 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-03 02:51:18,281 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:51:18,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:51:18,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1399634249, now seen corresponding path program 1 times [2018-12-03 02:51:18,281 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 02:51:18,281 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/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-03 02:51:18,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:51:18,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:51:18,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:51:18,343 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-03 02:51:18,343 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 02:51:18,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:51:18,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 02:51:18,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 02:51:18,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 02:51:18,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 02:51:18,346 INFO L87 Difference]: Start difference. First operand 273 states and 393 transitions. Second operand 7 states. [2018-12-03 02:51:18,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:51:18,468 INFO L93 Difference]: Finished difference Result 522 states and 772 transitions. [2018-12-03 02:51:18,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 02:51:18,468 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-12-03 02:51:18,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:51:18,470 INFO L225 Difference]: With dead ends: 522 [2018-12-03 02:51:18,470 INFO L226 Difference]: Without dead ends: 428 [2018-12-03 02:51:18,470 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-03 02:51:18,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-12-03 02:51:18,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 358. [2018-12-03 02:51:18,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-12-03 02:51:18,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 515 transitions. [2018-12-03 02:51:18,483 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 515 transitions. Word has length 48 [2018-12-03 02:51:18,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:51:18,483 INFO L480 AbstractCegarLoop]: Abstraction has 358 states and 515 transitions. [2018-12-03 02:51:18,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 02:51:18,483 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 515 transitions. [2018-12-03 02:51:18,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 02:51:18,484 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:51:18,484 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-03 02:51:18,484 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:51:18,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:51:18,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1006607239, now seen corresponding path program 1 times [2018-12-03 02:51:18,485 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 02:51:18,485 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/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-03 02:51:18,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:51:18,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:51:18,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:51:18,640 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-03 02:51:18,640 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 02:51:18,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:51:18,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-03 02:51:18,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 02:51:18,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 02:51:18,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-12-03 02:51:18,642 INFO L87 Difference]: Start difference. First operand 358 states and 515 transitions. Second operand 13 states. [2018-12-03 02:51:18,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:51:18,968 INFO L93 Difference]: Finished difference Result 425 states and 606 transitions. [2018-12-03 02:51:18,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 02:51:18,968 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2018-12-03 02:51:18,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:51:18,969 INFO L225 Difference]: With dead ends: 425 [2018-12-03 02:51:18,969 INFO L226 Difference]: Without dead ends: 392 [2018-12-03 02:51:18,970 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-03 02:51:18,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2018-12-03 02:51:18,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 375. [2018-12-03 02:51:18,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-12-03 02:51:18,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 534 transitions. [2018-12-03 02:51:18,981 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 534 transitions. Word has length 48 [2018-12-03 02:51:18,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:51:18,981 INFO L480 AbstractCegarLoop]: Abstraction has 375 states and 534 transitions. [2018-12-03 02:51:18,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 02:51:18,981 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 534 transitions. [2018-12-03 02:51:18,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 02:51:18,982 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:51:18,982 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-03 02:51:18,982 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:51:18,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:51:18,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1305820667, now seen corresponding path program 1 times [2018-12-03 02:51:18,982 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 02:51:18,982 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 02:51:18,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:51:19,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:51:19,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:51:19,045 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-03 02:51:19,045 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 02:51:19,072 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-03 02:51:19,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:51:19,074 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 02:51:19,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:51:19,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:51:19,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:51:19,102 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-03 02:51:19,102 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 02:51:19,144 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-03 02:51:19,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-03 02:51:19,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9] total 9 [2018-12-03 02:51:19,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 02:51:19,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 02:51:19,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 02:51:19,159 INFO L87 Difference]: Start difference. First operand 375 states and 534 transitions. Second operand 9 states. [2018-12-03 02:51:19,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:51:19,302 INFO L93 Difference]: Finished difference Result 810 states and 1190 transitions. [2018-12-03 02:51:19,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 02:51:19,302 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2018-12-03 02:51:19,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:51:19,304 INFO L225 Difference]: With dead ends: 810 [2018-12-03 02:51:19,304 INFO L226 Difference]: Without dead ends: 695 [2018-12-03 02:51:19,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 179 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-12-03 02:51:19,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2018-12-03 02:51:19,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 438. [2018-12-03 02:51:19,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-12-03 02:51:19,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 621 transitions. [2018-12-03 02:51:19,326 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 621 transitions. Word has length 48 [2018-12-03 02:51:19,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:51:19,326 INFO L480 AbstractCegarLoop]: Abstraction has 438 states and 621 transitions. [2018-12-03 02:51:19,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 02:51:19,326 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 621 transitions. [2018-12-03 02:51:19,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 02:51:19,327 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:51:19,327 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-03 02:51:19,327 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:51:19,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:51:19,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1698847677, now seen corresponding path program 1 times [2018-12-03 02:51:19,328 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 02:51:19,328 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/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-03 02:51:19,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:51:19,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:51:19,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:51:19,442 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-03 02:51:19,442 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 02:51:19,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:51:19,626 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 02:51:19,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:51:19,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:51:19,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:51:19,663 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-03 02:51:19,663 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 02:51:19,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 02:51:19,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-12-03 02:51:19,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 02:51:19,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 02:51:19,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-12-03 02:51:19,686 INFO L87 Difference]: Start difference. First operand 438 states and 621 transitions. Second operand 11 states. [2018-12-03 02:51:19,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:51:19,935 INFO L93 Difference]: Finished difference Result 492 states and 695 transitions. [2018-12-03 02:51:19,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 02:51:19,936 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2018-12-03 02:51:19,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:51:19,938 INFO L225 Difference]: With dead ends: 492 [2018-12-03 02:51:19,938 INFO L226 Difference]: Without dead ends: 459 [2018-12-03 02:51:19,938 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-03 02:51:19,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-12-03 02:51:19,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 442. [2018-12-03 02:51:19,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2018-12-03 02:51:19,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 623 transitions. [2018-12-03 02:51:19,965 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 623 transitions. Word has length 48 [2018-12-03 02:51:19,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:51:19,965 INFO L480 AbstractCegarLoop]: Abstraction has 442 states and 623 transitions. [2018-12-03 02:51:19,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 02:51:19,965 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 623 transitions. [2018-12-03 02:51:19,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 02:51:19,966 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:51:19,967 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-03 02:51:19,967 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:51:19,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:51:19,967 INFO L82 PathProgramCache]: Analyzing trace with hash -294368905, now seen corresponding path program 1 times [2018-12-03 02:51:19,967 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 02:51:19,967 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/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-03 02:51:19,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:51:20,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:51:20,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:51:20,092 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-03 02:51:20,092 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 02:51:20,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:51:20,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-03 02:51:20,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 02:51:20,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 02:51:20,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-03 02:51:20,095 INFO L87 Difference]: Start difference. First operand 442 states and 623 transitions. Second operand 12 states. [2018-12-03 02:51:20,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:51:20,450 INFO L93 Difference]: Finished difference Result 545 states and 757 transitions. [2018-12-03 02:51:20,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 02:51:20,450 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2018-12-03 02:51:20,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:51:20,452 INFO L225 Difference]: With dead ends: 545 [2018-12-03 02:51:20,452 INFO L226 Difference]: Without dead ends: 446 [2018-12-03 02:51:20,452 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-03 02:51:20,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2018-12-03 02:51:20,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 411. [2018-12-03 02:51:20,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-12-03 02:51:20,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 575 transitions. [2018-12-03 02:51:20,467 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 575 transitions. Word has length 48 [2018-12-03 02:51:20,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:51:20,468 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 575 transitions. [2018-12-03 02:51:20,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 02:51:20,468 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 575 transitions. [2018-12-03 02:51:20,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 02:51:20,469 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:51:20,469 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-03 02:51:20,469 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:51:20,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:51:20,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1883881285, now seen corresponding path program 1 times [2018-12-03 02:51:20,469 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 02:51:20,469 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/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-03 02:51:20,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:51:20,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:51:20,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:51:20,574 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-03 02:51:20,574 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 02:51:20,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:51:20,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 02:51:20,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 02:51:20,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 02:51:20,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:51:20,576 INFO L87 Difference]: Start difference. First operand 411 states and 575 transitions. Second operand 6 states. [2018-12-03 02:51:21,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:51:21,538 INFO L93 Difference]: Finished difference Result 452 states and 624 transitions. [2018-12-03 02:51:21,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 02:51:21,538 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2018-12-03 02:51:21,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:51:21,540 INFO L225 Difference]: With dead ends: 452 [2018-12-03 02:51:21,540 INFO L226 Difference]: Without dead ends: 450 [2018-12-03 02:51:21,540 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-03 02:51:21,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2018-12-03 02:51:21,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 417. [2018-12-03 02:51:21,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-12-03 02:51:21,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 582 transitions. [2018-12-03 02:51:21,553 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 582 transitions. Word has length 48 [2018-12-03 02:51:21,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:51:21,553 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 582 transitions. [2018-12-03 02:51:21,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 02:51:21,553 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 582 transitions. [2018-12-03 02:51:21,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 02:51:21,554 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:51:21,554 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-03 02:51:21,554 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:51:21,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:51:21,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1826622983, now seen corresponding path program 1 times [2018-12-03 02:51:21,555 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 02:51:21,555 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/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-03 02:51:21,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:51:21,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:51:21,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:51:21,658 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-03 02:51:21,658 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 02:51:21,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:51:21,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 02:51:21,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 02:51:21,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 02:51:21,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:51:21,661 INFO L87 Difference]: Start difference. First operand 417 states and 582 transitions. Second operand 6 states. [2018-12-03 02:51:23,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:51:23,836 INFO L93 Difference]: Finished difference Result 434 states and 599 transitions. [2018-12-03 02:51:23,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 02:51:23,836 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2018-12-03 02:51:23,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:51:23,837 INFO L225 Difference]: With dead ends: 434 [2018-12-03 02:51:23,838 INFO L226 Difference]: Without dead ends: 432 [2018-12-03 02:51:23,838 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-03 02:51:23,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2018-12-03 02:51:23,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 415. [2018-12-03 02:51:23,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2018-12-03 02:51:23,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 578 transitions. [2018-12-03 02:51:23,851 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 578 transitions. Word has length 48 [2018-12-03 02:51:23,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:51:23,851 INFO L480 AbstractCegarLoop]: Abstraction has 415 states and 578 transitions. [2018-12-03 02:51:23,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 02:51:23,851 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 578 transitions. [2018-12-03 02:51:23,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 02:51:23,852 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:51:23,852 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-03 02:51:23,852 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:51:23,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:51:23,852 INFO L82 PathProgramCache]: Analyzing trace with hash 609641055, now seen corresponding path program 1 times [2018-12-03 02:51:23,852 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 02:51:23,852 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/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-03 02:51:23,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:51:23,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:51:23,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:51:23,898 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-03 02:51:23,898 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 02:51:23,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:51:23,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 02:51:23,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 02:51:23,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 02:51:23,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 02:51:23,900 INFO L87 Difference]: Start difference. First operand 415 states and 578 transitions. Second operand 7 states. [2018-12-03 02:51:24,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:51:24,033 INFO L93 Difference]: Finished difference Result 632 states and 907 transitions. [2018-12-03 02:51:24,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 02:51:24,033 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2018-12-03 02:51:24,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:51:24,035 INFO L225 Difference]: With dead ends: 632 [2018-12-03 02:51:24,035 INFO L226 Difference]: Without dead ends: 537 [2018-12-03 02:51:24,035 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-03 02:51:24,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2018-12-03 02:51:24,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 410. [2018-12-03 02:51:24,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-12-03 02:51:24,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 569 transitions. [2018-12-03 02:51:24,052 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 569 transitions. Word has length 49 [2018-12-03 02:51:24,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:51:24,052 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 569 transitions. [2018-12-03 02:51:24,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 02:51:24,052 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 569 transitions. [2018-12-03 02:51:24,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 02:51:24,053 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:51:24,053 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-03 02:51:24,053 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:51:24,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:51:24,053 INFO L82 PathProgramCache]: Analyzing trace with hash 666899357, now seen corresponding path program 1 times [2018-12-03 02:51:24,053 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 02:51:24,053 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/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-03 02:51:24,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:51:24,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:51:24,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:51:24,115 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-03 02:51:24,115 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 02:51:24,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:51:24,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:51:24,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:51:24,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:51:24,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:51:24,118 INFO L87 Difference]: Start difference. First operand 410 states and 569 transitions. Second operand 4 states. [2018-12-03 02:51:24,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:51:24,151 INFO L93 Difference]: Finished difference Result 663 states and 957 transitions. [2018-12-03 02:51:24,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 02:51:24,152 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-12-03 02:51:24,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:51:24,153 INFO L225 Difference]: With dead ends: 663 [2018-12-03 02:51:24,153 INFO L226 Difference]: Without dead ends: 530 [2018-12-03 02:51:24,154 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-03 02:51:24,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2018-12-03 02:51:24,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 474. [2018-12-03 02:51:24,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2018-12-03 02:51:24,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 655 transitions. [2018-12-03 02:51:24,171 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 655 transitions. Word has length 49 [2018-12-03 02:51:24,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:51:24,172 INFO L480 AbstractCegarLoop]: Abstraction has 474 states and 655 transitions. [2018-12-03 02:51:24,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:51:24,172 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 655 transitions. [2018-12-03 02:51:24,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 02:51:24,173 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:51:24,173 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-03 02:51:24,173 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:51:24,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:51:24,173 INFO L82 PathProgramCache]: Analyzing trace with hash -855742356, now seen corresponding path program 1 times [2018-12-03 02:51:24,173 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 02:51:24,174 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/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-03 02:51:24,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:51:24,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:51:24,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:51:24,208 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-03 02:51:24,208 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 02:51:24,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:51:24,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:51:24,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:51:24,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:51:24,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:51:24,210 INFO L87 Difference]: Start difference. First operand 474 states and 655 transitions. Second operand 4 states. [2018-12-03 02:51:24,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:51:24,262 INFO L93 Difference]: Finished difference Result 849 states and 1159 transitions. [2018-12-03 02:51:24,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 02:51:24,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-12-03 02:51:24,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:51:24,264 INFO L225 Difference]: With dead ends: 849 [2018-12-03 02:51:24,264 INFO L226 Difference]: Without dead ends: 381 [2018-12-03 02:51:24,265 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-03 02:51:24,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-12-03 02:51:24,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 369. [2018-12-03 02:51:24,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-12-03 02:51:24,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 487 transitions. [2018-12-03 02:51:24,290 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 487 transitions. Word has length 49 [2018-12-03 02:51:24,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:51:24,291 INFO L480 AbstractCegarLoop]: Abstraction has 369 states and 487 transitions. [2018-12-03 02:51:24,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:51:24,291 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 487 transitions. [2018-12-03 02:51:24,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 02:51:24,292 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:51:24,292 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-03 02:51:24,292 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:51:24,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:51:24,292 INFO L82 PathProgramCache]: Analyzing trace with hash 849971633, now seen corresponding path program 1 times [2018-12-03 02:51:24,292 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 02:51:24,292 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/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-03 02:51:24,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:51:24,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:51:24,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:51:24,336 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-03 02:51:24,336 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 02:51:24,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:51:24,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:51:24,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:51:24,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:51:24,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:51:24,338 INFO L87 Difference]: Start difference. First operand 369 states and 487 transitions. Second operand 5 states. [2018-12-03 02:51:24,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:51:24,376 INFO L93 Difference]: Finished difference Result 376 states and 493 transitions. [2018-12-03 02:51:24,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 02:51:24,376 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-12-03 02:51:24,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:51:24,378 INFO L225 Difference]: With dead ends: 376 [2018-12-03 02:51:24,378 INFO L226 Difference]: Without dead ends: 369 [2018-12-03 02:51:24,379 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-03 02:51:24,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-12-03 02:51:24,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2018-12-03 02:51:24,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-12-03 02:51:24,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 483 transitions. [2018-12-03 02:51:24,406 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 483 transitions. Word has length 50 [2018-12-03 02:51:24,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:51:24,406 INFO L480 AbstractCegarLoop]: Abstraction has 369 states and 483 transitions. [2018-12-03 02:51:24,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:51:24,406 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 483 transitions. [2018-12-03 02:51:24,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 02:51:24,408 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:51:24,408 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-03 02:51:24,408 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:51:24,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:51:24,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1699165264, now seen corresponding path program 1 times [2018-12-03 02:51:24,408 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 02:51:24,409 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/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-03 02:51:24,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:51:24,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:51:24,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:51:24,470 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-03 02:51:24,470 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 02:51:24,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:51:24,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:51:24,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:51:24,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:51:24,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:51:24,472 INFO L87 Difference]: Start difference. First operand 369 states and 483 transitions. Second operand 4 states. [2018-12-03 02:51:24,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:51:24,501 INFO L93 Difference]: Finished difference Result 411 states and 536 transitions. [2018-12-03 02:51:24,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 02:51:24,502 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2018-12-03 02:51:24,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:51:24,503 INFO L225 Difference]: With dead ends: 411 [2018-12-03 02:51:24,503 INFO L226 Difference]: Without dead ends: 386 [2018-12-03 02:51:24,503 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-03 02:51:24,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-12-03 02:51:24,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 361. [2018-12-03 02:51:24,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-12-03 02:51:24,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 471 transitions. [2018-12-03 02:51:24,521 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 471 transitions. Word has length 53 [2018-12-03 02:51:24,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:51:24,521 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 471 transitions. [2018-12-03 02:51:24,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:51:24,521 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 471 transitions. [2018-12-03 02:51:24,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 02:51:24,522 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:51:24,522 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-03 02:51:24,522 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:51:24,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:51:24,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1987036572, now seen corresponding path program 1 times [2018-12-03 02:51:24,522 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 02:51:24,522 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 02:51:24,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:51:24,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:51:24,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:51:24,563 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-03 02:51:24,563 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 02:51:24,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:51:24,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:51:24,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:51:24,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:51:24,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:51:24,565 INFO L87 Difference]: Start difference. First operand 361 states and 471 transitions. Second operand 4 states. [2018-12-03 02:51:24,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:51:24,584 INFO L93 Difference]: Finished difference Result 378 states and 490 transitions. [2018-12-03 02:51:24,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:51:24,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-12-03 02:51:24,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:51:24,585 INFO L225 Difference]: With dead ends: 378 [2018-12-03 02:51:24,585 INFO L226 Difference]: Without dead ends: 305 [2018-12-03 02:51:24,586 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-03 02:51:24,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-12-03 02:51:24,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 303. [2018-12-03 02:51:24,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-12-03 02:51:24,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 384 transitions. [2018-12-03 02:51:24,597 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 384 transitions. Word has length 54 [2018-12-03 02:51:24,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:51:24,597 INFO L480 AbstractCegarLoop]: Abstraction has 303 states and 384 transitions. [2018-12-03 02:51:24,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:51:24,597 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 384 transitions. [2018-12-03 02:51:24,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 02:51:24,598 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:51:24,598 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-03 02:51:24,598 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:51:24,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:51:24,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1813382670, now seen corresponding path program 1 times [2018-12-03 02:51:24,599 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 02:51:24,599 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/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-03 02:51:24,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:51:24,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:51:24,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:51:24,762 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-03 02:51:24,762 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 02:51:24,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:51:24,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-03 02:51:24,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 02:51:24,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 02:51:24,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-12-03 02:51:24,764 INFO L87 Difference]: Start difference. First operand 303 states and 384 transitions. Second operand 13 states. [2018-12-03 02:51:24,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:51:24,972 INFO L93 Difference]: Finished difference Result 366 states and 462 transitions. [2018-12-03 02:51:24,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 02:51:24,973 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2018-12-03 02:51:24,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:51:24,974 INFO L225 Difference]: With dead ends: 366 [2018-12-03 02:51:24,974 INFO L226 Difference]: Without dead ends: 321 [2018-12-03 02:51:24,974 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-03 02:51:24,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-12-03 02:51:24,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 298. [2018-12-03 02:51:24,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-12-03 02:51:24,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 376 transitions. [2018-12-03 02:51:24,985 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 376 transitions. Word has length 56 [2018-12-03 02:51:24,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:51:24,985 INFO L480 AbstractCegarLoop]: Abstraction has 298 states and 376 transitions. [2018-12-03 02:51:24,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 02:51:24,985 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 376 transitions. [2018-12-03 02:51:24,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 02:51:24,986 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:51:24,986 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-03 02:51:24,986 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:51:24,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:51:24,986 INFO L82 PathProgramCache]: Analyzing trace with hash -848138954, now seen corresponding path program 1 times [2018-12-03 02:51:24,987 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 02:51:24,987 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/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-03 02:51:25,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:51:25,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:51:25,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:51:27,167 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-03 02:51:27,167 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 02:51:27,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:51:27,266 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 02:51:27,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:51:27,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:51:27,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:51:27,332 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-03 02:51:27,332 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 02:51:27,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 02:51:27,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-12-03 02:51:27,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 02:51:27,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 02:51:27,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=150, Unknown=1, NotChecked=0, Total=182 [2018-12-03 02:51:27,408 INFO L87 Difference]: Start difference. First operand 298 states and 376 transitions. Second operand 11 states. [2018-12-03 02:51:27,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:51:27,695 INFO L93 Difference]: Finished difference Result 350 states and 443 transitions. [2018-12-03 02:51:27,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 02:51:27,696 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2018-12-03 02:51:27,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:51:27,697 INFO L225 Difference]: With dead ends: 350 [2018-12-03 02:51:27,697 INFO L226 Difference]: Without dead ends: 319 [2018-12-03 02:51:27,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 112 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=64, Invalid=277, Unknown=1, NotChecked=0, Total=342 [2018-12-03 02:51:27,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-12-03 02:51:27,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 296. [2018-12-03 02:51:27,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-12-03 02:51:27,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 372 transitions. [2018-12-03 02:51:27,715 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 372 transitions. Word has length 56 [2018-12-03 02:51:27,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:51:27,715 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 372 transitions. [2018-12-03 02:51:27,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 02:51:27,715 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 372 transitions. [2018-12-03 02:51:27,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 02:51:27,716 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:51:27,716 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-03 02:51:27,716 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:51:27,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:51:27,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1591720731, now seen corresponding path program 1 times [2018-12-03 02:51:27,717 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 02:51:27,717 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/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-03 02:51:27,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:51:27,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:51:27,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:51:27,766 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-03 02:51:27,766 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 02:51:27,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:51:27,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 02:51:27,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 02:51:27,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 02:51:27,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:51:27,768 INFO L87 Difference]: Start difference. First operand 296 states and 372 transitions. Second operand 6 states. [2018-12-03 02:51:27,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:51:27,876 INFO L93 Difference]: Finished difference Result 378 states and 489 transitions. [2018-12-03 02:51:27,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 02:51:27,877 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-12-03 02:51:27,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:51:27,878 INFO L225 Difference]: With dead ends: 378 [2018-12-03 02:51:27,878 INFO L226 Difference]: Without dead ends: 331 [2018-12-03 02:51:27,879 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-03 02:51:27,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-12-03 02:51:27,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 302. [2018-12-03 02:51:27,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-12-03 02:51:27,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 378 transitions. [2018-12-03 02:51:27,899 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 378 transitions. Word has length 55 [2018-12-03 02:51:27,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:51:27,899 INFO L480 AbstractCegarLoop]: Abstraction has 302 states and 378 transitions. [2018-12-03 02:51:27,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 02:51:27,899 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 378 transitions. [2018-12-03 02:51:27,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 02:51:27,900 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:51:27,900 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-03 02:51:27,900 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:51:27,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:51:27,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1440743184, now seen corresponding path program 1 times [2018-12-03 02:51:27,901 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 02:51:27,901 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/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-03 02:51:27,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:51:27,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:51:27,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:51:29,679 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-03 02:51:29,679 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 02:51:29,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:51:29,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-03 02:51:29,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 02:51:29,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 02:51:29,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-12-03 02:51:29,681 INFO L87 Difference]: Start difference. First operand 302 states and 378 transitions. Second operand 12 states. [2018-12-03 02:51:34,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:51:34,524 INFO L93 Difference]: Finished difference Result 349 states and 438 transitions. [2018-12-03 02:51:34,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 02:51:34,524 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-12-03 02:51:34,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:51:34,525 INFO L225 Difference]: With dead ends: 349 [2018-12-03 02:51:34,525 INFO L226 Difference]: Without dead ends: 313 [2018-12-03 02:51:34,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=93, Invalid=368, Unknown=1, NotChecked=0, Total=462 [2018-12-03 02:51:34,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-12-03 02:51:34,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 300. [2018-12-03 02:51:34,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-12-03 02:51:34,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 374 transitions. [2018-12-03 02:51:34,537 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 374 transitions. Word has length 56 [2018-12-03 02:51:34,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:51:34,538 INFO L480 AbstractCegarLoop]: Abstraction has 300 states and 374 transitions. [2018-12-03 02:51:34,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 02:51:34,538 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 374 transitions. [2018-12-03 02:51:34,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 02:51:34,538 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:51:34,539 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-03 02:51:34,539 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:51:34,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:51:34,539 INFO L82 PathProgramCache]: Analyzing trace with hash -52797642, now seen corresponding path program 1 times [2018-12-03 02:51:34,539 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 02:51:34,539 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/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-03 02:51:34,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:51:34,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:51:34,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:51:34,603 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-03 02:51:34,603 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 02:51:34,631 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-03 02:51:34,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:51:34,632 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 02:51:34,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:51:34,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:51:34,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:51:34,654 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-03 02:51:34,655 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 02:51:34,685 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-03 02:51:34,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-03 02:51:34,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10, 10] total 10 [2018-12-03 02:51:34,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 02:51:34,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 02:51:34,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-03 02:51:34,699 INFO L87 Difference]: Start difference. First operand 300 states and 374 transitions. Second operand 10 states. [2018-12-03 02:51:34,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:51:34,825 INFO L93 Difference]: Finished difference Result 403 states and 493 transitions. [2018-12-03 02:51:34,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 02:51:34,825 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2018-12-03 02:51:34,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:51:34,826 INFO L225 Difference]: With dead ends: 403 [2018-12-03 02:51:34,826 INFO L226 Difference]: Without dead ends: 327 [2018-12-03 02:51:34,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 210 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-12-03 02:51:34,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-12-03 02:51:34,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 278. [2018-12-03 02:51:34,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-12-03 02:51:34,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 348 transitions. [2018-12-03 02:51:34,837 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 348 transitions. Word has length 56 [2018-12-03 02:51:34,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:51:34,837 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 348 transitions. [2018-12-03 02:51:34,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 02:51:34,837 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 348 transitions. [2018-12-03 02:51:34,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 02:51:34,838 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:51:34,838 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-03 02:51:34,838 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:51:34,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:51:34,838 INFO L82 PathProgramCache]: Analyzing trace with hash -475499468, now seen corresponding path program 1 times [2018-12-03 02:51:34,838 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 02:51:34,838 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/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-03 02:51:34,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:51:34,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:51:34,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:51:41,076 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-03 02:51:41,076 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 02:51:41,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:51:41,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 02:51:41,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 02:51:41,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 02:51:41,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=37, Unknown=3, NotChecked=0, Total=56 [2018-12-03 02:51:41,078 INFO L87 Difference]: Start difference. First operand 278 states and 348 transitions. Second operand 8 states. [2018-12-03 02:51:54,856 WARN L180 SmtUtils]: Spent 5.72 s on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2018-12-03 02:51:55,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:51:55,809 INFO L93 Difference]: Finished difference Result 301 states and 371 transitions. [2018-12-03 02:51:55,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 02:51:55,809 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2018-12-03 02:51:55,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:51:55,810 INFO L225 Difference]: With dead ends: 301 [2018-12-03 02:51:55,810 INFO L226 Difference]: Without dead ends: 299 [2018-12-03 02:51:55,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=25, Invalid=61, Unknown=4, NotChecked=0, Total=90 [2018-12-03 02:51:55,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-12-03 02:51:55,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 283. [2018-12-03 02:51:55,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-12-03 02:51:55,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 353 transitions. [2018-12-03 02:51:55,821 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 353 transitions. Word has length 56 [2018-12-03 02:51:55,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:51:55,821 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 353 transitions. [2018-12-03 02:51:55,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 02:51:55,821 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 353 transitions. [2018-12-03 02:51:55,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 02:51:55,822 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:51:55,822 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-03 02:51:55,822 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:51:55,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:51:55,822 INFO L82 PathProgramCache]: Analyzing trace with hash -695289963, now seen corresponding path program 1 times [2018-12-03 02:51:55,822 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 02:51:55,822 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/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-03 02:51:55,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:51:55,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:51:55,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:51:55,910 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-03 02:51:55,911 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 02:51:55,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:51:55,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-03 02:51:55,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 02:51:55,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 02:51:55,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-12-03 02:51:55,912 INFO L87 Difference]: Start difference. First operand 283 states and 353 transitions. Second operand 12 states. [2018-12-03 02:51:56,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:51:56,133 INFO L93 Difference]: Finished difference Result 352 states and 443 transitions. [2018-12-03 02:51:56,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 02:51:56,133 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-12-03 02:51:56,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:51:56,134 INFO L225 Difference]: With dead ends: 352 [2018-12-03 02:51:56,135 INFO L226 Difference]: Without dead ends: 327 [2018-12-03 02:51:56,135 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-03 02:51:56,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-12-03 02:51:56,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 299. [2018-12-03 02:51:56,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-12-03 02:51:56,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 375 transitions. [2018-12-03 02:51:56,147 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 375 transitions. Word has length 56 [2018-12-03 02:51:56,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:51:56,148 INFO L480 AbstractCegarLoop]: Abstraction has 299 states and 375 transitions. [2018-12-03 02:51:56,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 02:51:56,148 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 375 transitions. [2018-12-03 02:51:56,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 02:51:56,148 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:51:56,148 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-03 02:51:56,149 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:51:56,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:51:56,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1684269273, now seen corresponding path program 1 times [2018-12-03 02:51:56,149 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 02:51:56,149 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/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-03 02:51:56,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:51:56,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:51:56,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:51:56,208 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-03 02:51:56,208 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 02:51:56,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:51:56,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 02:51:56,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 02:51:56,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 02:51:56,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 02:51:56,209 INFO L87 Difference]: Start difference. First operand 299 states and 375 transitions. Second operand 8 states. [2018-12-03 02:51:56,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:51:56,376 INFO L93 Difference]: Finished difference Result 367 states and 465 transitions. [2018-12-03 02:51:56,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 02:51:56,377 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2018-12-03 02:51:56,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:51:56,378 INFO L225 Difference]: With dead ends: 367 [2018-12-03 02:51:56,378 INFO L226 Difference]: Without dead ends: 348 [2018-12-03 02:51:56,378 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-03 02:51:56,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-12-03 02:51:56,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 298. [2018-12-03 02:51:56,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-12-03 02:51:56,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 382 transitions. [2018-12-03 02:51:56,391 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 382 transitions. Word has length 56 [2018-12-03 02:51:56,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:51:56,391 INFO L480 AbstractCegarLoop]: Abstraction has 298 states and 382 transitions. [2018-12-03 02:51:56,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 02:51:56,391 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 382 transitions. [2018-12-03 02:51:56,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 02:51:56,391 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:51:56,391 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-03 02:51:56,391 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:51:56,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:51:56,392 INFO L82 PathProgramCache]: Analyzing trace with hash -2092005707, now seen corresponding path program 1 times [2018-12-03 02:51:56,392 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 02:51:56,392 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/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-03 02:51:56,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:51:56,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:51:56,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:52:02,948 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-03 02:52:02,948 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 02:52:02,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:52:02,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 02:52:02,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 02:52:02,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 02:52:02,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=38, Unknown=3, NotChecked=0, Total=56 [2018-12-03 02:52:02,950 INFO L87 Difference]: Start difference. First operand 298 states and 382 transitions. Second operand 8 states. [2018-12-03 02:52:11,016 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 24 [2018-12-03 02:52:16,627 WARN L180 SmtUtils]: Spent 2.12 s on a formula simplification that was a NOOP. DAG size: 24 [2018-12-03 02:52:21,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:52:21,560 INFO L93 Difference]: Finished difference Result 314 states and 397 transitions. [2018-12-03 02:52:21,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 02:52:21,560 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2018-12-03 02:52:21,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:52:21,561 INFO L225 Difference]: With dead ends: 314 [2018-12-03 02:52:21,561 INFO L226 Difference]: Without dead ends: 312 [2018-12-03 02:52:21,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=31, Invalid=76, Unknown=3, NotChecked=0, Total=110 [2018-12-03 02:52:21,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-12-03 02:52:21,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 297. [2018-12-03 02:52:21,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-12-03 02:52:21,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 380 transitions. [2018-12-03 02:52:21,576 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 380 transitions. Word has length 57 [2018-12-03 02:52:21,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:52:21,576 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 380 transitions. [2018-12-03 02:52:21,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 02:52:21,576 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 380 transitions. [2018-12-03 02:52:21,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 02:52:21,576 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:52:21,576 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-03 02:52:21,576 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:52:21,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:52:21,577 INFO L82 PathProgramCache]: Analyzing trace with hash -364789831, now seen corresponding path program 1 times [2018-12-03 02:52:21,577 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 02:52:21,577 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/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-03 02:52:21,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:52:21,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:52:21,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:52:21,614 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-03 02:52:21,614 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 02:52:21,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:52:21,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:52:21,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:52:21,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:52:21,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:52:21,616 INFO L87 Difference]: Start difference. First operand 297 states and 380 transitions. Second operand 5 states. [2018-12-03 02:52:21,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:52:21,683 INFO L93 Difference]: Finished difference Result 332 states and 420 transitions. [2018-12-03 02:52:21,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 02:52:21,684 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2018-12-03 02:52:21,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:52:21,684 INFO L225 Difference]: With dead ends: 332 [2018-12-03 02:52:21,684 INFO L226 Difference]: Without dead ends: 309 [2018-12-03 02:52:21,685 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-03 02:52:21,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-12-03 02:52:21,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 297. [2018-12-03 02:52:21,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-12-03 02:52:21,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 378 transitions. [2018-12-03 02:52:21,697 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 378 transitions. Word has length 57 [2018-12-03 02:52:21,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:52:21,698 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 378 transitions. [2018-12-03 02:52:21,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:52:21,698 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 378 transitions. [2018-12-03 02:52:21,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 02:52:21,698 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:52:21,698 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-03 02:52:21,698 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:52:21,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:52:21,698 INFO L82 PathProgramCache]: Analyzing trace with hash 306992977, now seen corresponding path program 1 times [2018-12-03 02:52:21,698 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 02:52:21,699 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/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-03 02:52:21,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:52:21,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:52:21,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:52:21,731 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-03 02:52:21,731 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 02:52:21,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:52:21,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:52:21,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:52:21,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:52:21,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:52:21,733 INFO L87 Difference]: Start difference. First operand 297 states and 378 transitions. Second operand 4 states. [2018-12-03 02:52:21,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:52:21,758 INFO L93 Difference]: Finished difference Result 306 states and 386 transitions. [2018-12-03 02:52:21,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:52:21,758 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-12-03 02:52:21,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:52:21,759 INFO L225 Difference]: With dead ends: 306 [2018-12-03 02:52:21,759 INFO L226 Difference]: Without dead ends: 264 [2018-12-03 02:52:21,759 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-03 02:52:21,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-12-03 02:52:21,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 254. [2018-12-03 02:52:21,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-12-03 02:52:21,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 316 transitions. [2018-12-03 02:52:21,771 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 316 transitions. Word has length 58 [2018-12-03 02:52:21,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:52:21,771 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 316 transitions. [2018-12-03 02:52:21,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:52:21,771 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 316 transitions. [2018-12-03 02:52:21,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-03 02:52:21,771 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:52:21,771 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-03 02:52:21,771 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:52:21,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:52:21,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1560523616, now seen corresponding path program 1 times [2018-12-03 02:52:21,772 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 02:52:21,772 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/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-03 02:52:21,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:52:21,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:52:21,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:52:21,842 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-03 02:52:21,842 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 02:52:21,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:52:21,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 02:52:21,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 02:52:21,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 02:52:21,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 02:52:21,843 INFO L87 Difference]: Start difference. First operand 254 states and 316 transitions. Second operand 8 states. [2018-12-03 02:52:22,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:52:22,051 INFO L93 Difference]: Finished difference Result 348 states and 445 transitions. [2018-12-03 02:52:22,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 02:52:22,052 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2018-12-03 02:52:22,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:52:22,053 INFO L225 Difference]: With dead ends: 348 [2018-12-03 02:52:22,053 INFO L226 Difference]: Without dead ends: 308 [2018-12-03 02:52:22,053 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-03 02:52:22,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-12-03 02:52:22,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 286. [2018-12-03 02:52:22,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-12-03 02:52:22,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 361 transitions. [2018-12-03 02:52:22,069 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 361 transitions. Word has length 62 [2018-12-03 02:52:22,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:52:22,069 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 361 transitions. [2018-12-03 02:52:22,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 02:52:22,069 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 361 transitions. [2018-12-03 02:52:22,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-03 02:52:22,070 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:52:22,070 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-03 02:52:22,070 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:52:22,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:52:22,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1628619175, now seen corresponding path program 1 times [2018-12-03 02:52:22,070 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 02:52:22,070 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/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-03 02:52:22,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:52:22,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:52:22,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:52:22,116 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-03 02:52:22,116 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 02:52:22,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:52:22,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 02:52:22,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 02:52:22,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 02:52:22,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:52:22,118 INFO L87 Difference]: Start difference. First operand 286 states and 361 transitions. Second operand 6 states. [2018-12-03 02:52:22,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:52:22,196 INFO L93 Difference]: Finished difference Result 377 states and 489 transitions. [2018-12-03 02:52:22,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 02:52:22,196 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-12-03 02:52:22,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:52:22,197 INFO L225 Difference]: With dead ends: 377 [2018-12-03 02:52:22,197 INFO L226 Difference]: Without dead ends: 304 [2018-12-03 02:52:22,198 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-03 02:52:22,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-12-03 02:52:22,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 268. [2018-12-03 02:52:22,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-12-03 02:52:22,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 322 transitions. [2018-12-03 02:52:22,213 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 322 transitions. Word has length 64 [2018-12-03 02:52:22,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:52:22,213 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 322 transitions. [2018-12-03 02:52:22,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 02:52:22,213 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 322 transitions. [2018-12-03 02:52:22,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-03 02:52:22,214 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:52:22,214 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-03 02:52:22,214 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:52:22,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:52:22,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1905751366, now seen corresponding path program 1 times [2018-12-03 02:52:22,214 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 02:52:22,214 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/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-03 02:52:22,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:52:22,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:52:22,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:52:22,310 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-03 02:52:22,310 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 02:52:22,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:52:22,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 02:52:22,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 02:52:22,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 02:52:22,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:52:22,312 INFO L87 Difference]: Start difference. First operand 268 states and 322 transitions. Second operand 6 states. [2018-12-03 02:52:22,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:52:22,360 INFO L93 Difference]: Finished difference Result 309 states and 374 transitions. [2018-12-03 02:52:22,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 02:52:22,361 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-12-03 02:52:22,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:52:22,361 INFO L225 Difference]: With dead ends: 309 [2018-12-03 02:52:22,361 INFO L226 Difference]: Without dead ends: 307 [2018-12-03 02:52:22,362 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-03 02:52:22,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-12-03 02:52:22,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 277. [2018-12-03 02:52:22,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-12-03 02:52:22,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 333 transitions. [2018-12-03 02:52:22,374 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 333 transitions. Word has length 64 [2018-12-03 02:52:22,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:52:22,374 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 333 transitions. [2018-12-03 02:52:22,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 02:52:22,374 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 333 transitions. [2018-12-03 02:52:22,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-03 02:52:22,375 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:52:22,375 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-03 02:52:22,375 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:52:22,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:52:22,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1397816770, now seen corresponding path program 1 times [2018-12-03 02:52:22,375 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 02:52:22,375 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/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-03 02:52:22,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:52:22,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:52:22,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:52:22,453 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-03 02:52:22,453 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 02:52:22,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:52:22,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 02:52:22,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 02:52:22,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 02:52:22,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:52:22,455 INFO L87 Difference]: Start difference. First operand 277 states and 333 transitions. Second operand 6 states. [2018-12-03 02:52:22,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:52:22,493 INFO L93 Difference]: Finished difference Result 306 states and 365 transitions. [2018-12-03 02:52:22,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 02:52:22,494 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-12-03 02:52:22,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:52:22,494 INFO L225 Difference]: With dead ends: 306 [2018-12-03 02:52:22,495 INFO L226 Difference]: Without dead ends: 304 [2018-12-03 02:52:22,495 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-03 02:52:22,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-12-03 02:52:22,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 281. [2018-12-03 02:52:22,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-12-03 02:52:22,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 336 transitions. [2018-12-03 02:52:22,518 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 336 transitions. Word has length 64 [2018-12-03 02:52:22,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:52:22,518 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 336 transitions. [2018-12-03 02:52:22,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 02:52:22,518 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 336 transitions. [2018-12-03 02:52:22,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 02:52:22,519 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:52:22,519 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-03 02:52:22,519 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:52:22,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:52:22,519 INFO L82 PathProgramCache]: Analyzing trace with hash -186874661, now seen corresponding path program 1 times [2018-12-03 02:52:22,519 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 02:52:22,520 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/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-03 02:52:22,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:52:22,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:52:22,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:52:23,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-03 02:52:23,249 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 02:52:23,578 WARN L180 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2018-12-03 02:52:25,079 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-03 02:52:25,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:52:25,080 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 02:52:25,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:52:25,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:52:25,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:52:25,270 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-03 02:52:25,270 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 02:52:25,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 02:52:25,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [14, 15] total 26 [2018-12-03 02:52:25,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 02:52:25,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 02:52:25,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2018-12-03 02:52:25,285 INFO L87 Difference]: Start difference. First operand 281 states and 336 transitions. Second operand 26 states. [2018-12-03 02:52:25,698 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2018-12-03 02:52:27,169 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2018-12-03 02:52:27,672 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2018-12-03 02:52:29,249 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2018-12-03 02:52:29,956 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2018-12-03 02:52:30,657 WARN L180 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2018-12-03 02:52:31,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:52:31,549 INFO L93 Difference]: Finished difference Result 375 states and 460 transitions. [2018-12-03 02:52:31,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 02:52:31,550 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 69 [2018-12-03 02:52:31,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:52:31,551 INFO L225 Difference]: With dead ends: 375 [2018-12-03 02:52:31,551 INFO L226 Difference]: Without dead ends: 347 [2018-12-03 02:52:31,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 176 SyntacticMatches, 5 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=359, Invalid=2091, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 02:52:31,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-12-03 02:52:31,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 300. [2018-12-03 02:52:31,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-12-03 02:52:31,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 361 transitions. [2018-12-03 02:52:31,570 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 361 transitions. Word has length 69 [2018-12-03 02:52:31,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:52:31,571 INFO L480 AbstractCegarLoop]: Abstraction has 300 states and 361 transitions. [2018-12-03 02:52:31,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 02:52:31,571 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 361 transitions. [2018-12-03 02:52:31,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-03 02:52:31,571 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:52:31,572 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-03 02:52:31,572 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:52:31,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:52:31,572 INFO L82 PathProgramCache]: Analyzing trace with hash 457791470, now seen corresponding path program 1 times [2018-12-03 02:52:31,572 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 02:52:31,572 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/cvc4 Starting monitored process 43 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 02:52:31,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:52:31,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:52:31,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:52:31,671 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-03 02:52:31,672 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 02:52:31,784 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-03 02:52:31,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:52:31,785 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 02:52:31,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:52:31,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:52:31,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:52:31,810 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-03 02:52:31,811 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 02:52:31,903 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-03 02:52:31,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-03 02:52:31,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11] total 14 [2018-12-03 02:52:31,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 02:52:31,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 02:52:31,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-12-03 02:52:31,918 INFO L87 Difference]: Start difference. First operand 300 states and 361 transitions. Second operand 14 states. [2018-12-03 02:52:32,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:52:32,260 INFO L93 Difference]: Finished difference Result 327 states and 392 transitions. [2018-12-03 02:52:32,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 02:52:32,260 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 70 [2018-12-03 02:52:32,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:52:32,261 INFO L225 Difference]: With dead ends: 327 [2018-12-03 02:52:32,261 INFO L226 Difference]: Without dead ends: 320 [2018-12-03 02:52:32,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 261 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2018-12-03 02:52:32,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-12-03 02:52:32,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 297. [2018-12-03 02:52:32,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-12-03 02:52:32,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 358 transitions. [2018-12-03 02:52:32,281 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 358 transitions. Word has length 70 [2018-12-03 02:52:32,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:52:32,281 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 358 transitions. [2018-12-03 02:52:32,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 02:52:32,282 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 358 transitions. [2018-12-03 02:52:32,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-03 02:52:32,282 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:52:32,282 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-03 02:52:32,282 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:52:32,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:52:32,283 INFO L82 PathProgramCache]: Analyzing trace with hash -297341722, now seen corresponding path program 2 times [2018-12-03 02:52:32,283 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 02:52:32,283 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/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-03 02:52:32,297 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-03 02:52:32,334 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-03 02:52:32,334 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 02:52:32,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:52:32,426 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-03 02:52:32,427 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 02:52:32,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:52:32,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-03 02:52:32,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 02:52:32,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 02:52:32,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-12-03 02:52:32,428 INFO L87 Difference]: Start difference. First operand 297 states and 358 transitions. Second operand 12 states. [2018-12-03 02:52:32,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:52:32,676 INFO L93 Difference]: Finished difference Result 320 states and 382 transitions. [2018-12-03 02:52:32,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 02:52:32,677 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-12-03 02:52:32,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:52:32,678 INFO L225 Difference]: With dead ends: 320 [2018-12-03 02:52:32,678 INFO L226 Difference]: Without dead ends: 313 [2018-12-03 02:52:32,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2018-12-03 02:52:32,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-12-03 02:52:32,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 289. [2018-12-03 02:52:32,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-12-03 02:52:32,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 348 transitions. [2018-12-03 02:52:32,697 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 348 transitions. Word has length 70 [2018-12-03 02:52:32,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:52:32,697 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 348 transitions. [2018-12-03 02:52:32,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 02:52:32,697 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 348 transitions. [2018-12-03 02:52:32,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-03 02:52:32,697 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:52:32,698 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-03 02:52:32,698 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:52:32,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:52:32,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1221744938, now seen corresponding path program 1 times [2018-12-03 02:52:32,698 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 02:52:32,698 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/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-03 02:52:32,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 02:52:32,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:52:32,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:52:32,766 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-03 02:52:32,766 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 02:52:32,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:52:32,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 02:52:32,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 02:52:32,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 02:52:32,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:52:32,768 INFO L87 Difference]: Start difference. First operand 289 states and 348 transitions. Second operand 6 states. [2018-12-03 02:52:32,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:52:32,982 INFO L93 Difference]: Finished difference Result 387 states and 474 transitions. [2018-12-03 02:52:32,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 02:52:32,983 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2018-12-03 02:52:32,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:52:32,984 INFO L225 Difference]: With dead ends: 387 [2018-12-03 02:52:32,984 INFO L226 Difference]: Without dead ends: 368 [2018-12-03 02:52:32,984 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-03 02:52:32,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-12-03 02:52:33,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 285. [2018-12-03 02:52:33,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-12-03 02:52:33,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 345 transitions. [2018-12-03 02:52:33,005 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 345 transitions. Word has length 70 [2018-12-03 02:52:33,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:52:33,006 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 345 transitions. [2018-12-03 02:52:33,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 02:52:33,006 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 345 transitions. [2018-12-03 02:52:33,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-03 02:52:33,006 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:52:33,006 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-03 02:52:33,006 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:52:33,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:52:33,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1115137352, now seen corresponding path program 1 times [2018-12-03 02:52:33,007 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 02:52:33,007 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/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-03 02:52:33,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:52:33,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:52:33,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:52:33,181 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-03 02:52:33,181 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 02:52:33,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:52:33,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 02:52:33,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 02:52:33,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 02:52:33,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 02:52:33,183 INFO L87 Difference]: Start difference. First operand 285 states and 345 transitions. Second operand 9 states. [2018-12-03 02:52:33,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:52:33,612 INFO L93 Difference]: Finished difference Result 335 states and 405 transitions. [2018-12-03 02:52:33,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 02:52:33,613 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2018-12-03 02:52:33,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:52:33,614 INFO L225 Difference]: With dead ends: 335 [2018-12-03 02:52:33,614 INFO L226 Difference]: Without dead ends: 294 [2018-12-03 02:52:33,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-12-03 02:52:33,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-12-03 02:52:33,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 266. [2018-12-03 02:52:33,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-12-03 02:52:33,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 314 transitions. [2018-12-03 02:52:33,634 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 314 transitions. Word has length 70 [2018-12-03 02:52:33,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:52:33,634 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 314 transitions. [2018-12-03 02:52:33,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 02:52:33,634 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 314 transitions. [2018-12-03 02:52:33,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-03 02:52:33,635 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:52:33,635 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-03 02:52:33,635 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:52:33,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:52:33,635 INFO L82 PathProgramCache]: Analyzing trace with hash -40698028, now seen corresponding path program 1 times [2018-12-03 02:52:33,635 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 02:52:33,635 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/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-03 02:52:33,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:52:33,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:52:33,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:52:33,716 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-03 02:52:33,717 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 02:52:33,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:52:33,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 02:52:33,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 02:52:33,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 02:52:33,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:52:33,719 INFO L87 Difference]: Start difference. First operand 266 states and 314 transitions. Second operand 6 states. [2018-12-03 02:52:33,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:52:33,769 INFO L93 Difference]: Finished difference Result 287 states and 336 transitions. [2018-12-03 02:52:33,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 02:52:33,769 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2018-12-03 02:52:33,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:52:33,770 INFO L225 Difference]: With dead ends: 287 [2018-12-03 02:52:33,770 INFO L226 Difference]: Without dead ends: 283 [2018-12-03 02:52:33,770 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-03 02:52:33,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-12-03 02:52:33,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 253. [2018-12-03 02:52:33,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-12-03 02:52:33,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 297 transitions. [2018-12-03 02:52:33,789 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 297 transitions. Word has length 72 [2018-12-03 02:52:33,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:52:33,790 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 297 transitions. [2018-12-03 02:52:33,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 02:52:33,790 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 297 transitions. [2018-12-03 02:52:33,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-03 02:52:33,790 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:52:33,790 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-03 02:52:33,790 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:52:33,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:52:33,790 INFO L82 PathProgramCache]: Analyzing trace with hash 16560274, now seen corresponding path program 1 times [2018-12-03 02:52:33,790 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 02:52:33,791 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/cvc4 Starting monitored process 49 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 02:52:33,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:52:33,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:52:33,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:52:34,094 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-03 02:52:34,094 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 02:52:34,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:52:34,495 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 02:52:34,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:52:34,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:52:34,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:52:34,637 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-03 02:52:34,637 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 02:52:34,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 02:52:34,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 17 [2018-12-03 02:52:34,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 02:52:34,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 02:52:34,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=340, Unknown=0, NotChecked=0, Total=380 [2018-12-03 02:52:34,654 INFO L87 Difference]: Start difference. First operand 253 states and 297 transitions. Second operand 17 states. [2018-12-03 02:52:35,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:52:35,719 INFO L93 Difference]: Finished difference Result 302 states and 348 transitions. [2018-12-03 02:52:35,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 02:52:35,719 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 72 [2018-12-03 02:52:35,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:52:35,720 INFO L225 Difference]: With dead ends: 302 [2018-12-03 02:52:35,720 INFO L226 Difference]: Without dead ends: 158 [2018-12-03 02:52:35,720 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-03 02:52:35,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-12-03 02:52:35,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 138. [2018-12-03 02:52:35,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-12-03 02:52:35,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 168 transitions. [2018-12-03 02:52:35,731 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 168 transitions. Word has length 72 [2018-12-03 02:52:35,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:52:35,731 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 168 transitions. [2018-12-03 02:52:35,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 02:52:35,731 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 168 transitions. [2018-12-03 02:52:35,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-03 02:52:35,731 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:52:35,731 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-03 02:52:35,731 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:52:35,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:52:35,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1073890760, now seen corresponding path program 1 times [2018-12-03 02:52:35,732 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 02:52:35,732 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/cvc4 Starting monitored process 51 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 02:52:35,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:52:35,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:52:35,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:52:35,768 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-03 02:52:35,768 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 02:52:35,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:52:35,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:52:35,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:52:35,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:52:35,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:52:35,770 INFO L87 Difference]: Start difference. First operand 138 states and 168 transitions. Second operand 4 states. [2018-12-03 02:52:35,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:52:35,799 INFO L93 Difference]: Finished difference Result 162 states and 194 transitions. [2018-12-03 02:52:35,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:52:35,800 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2018-12-03 02:52:35,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:52:35,800 INFO L225 Difference]: With dead ends: 162 [2018-12-03 02:52:35,800 INFO L226 Difference]: Without dead ends: 138 [2018-12-03 02:52:35,801 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-03 02:52:35,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-12-03 02:52:35,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-12-03 02:52:35,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-12-03 02:52:35,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 162 transitions. [2018-12-03 02:52:35,812 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 162 transitions. Word has length 71 [2018-12-03 02:52:35,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:52:35,812 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 162 transitions. [2018-12-03 02:52:35,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:52:35,812 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 162 transitions. [2018-12-03 02:52:35,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-03 02:52:35,813 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:52:35,813 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-03 02:52:35,813 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:52:35,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:52:35,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1571950312, now seen corresponding path program 1 times [2018-12-03 02:52:35,813 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 02:52:35,813 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/cvc4 Starting monitored process 52 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 02:52:35,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:52:35,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:52:35,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:52:35,860 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-03 02:52:35,860 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 02:52:35,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:52:35,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:52:35,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:52:35,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:52:35,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:52:35,861 INFO L87 Difference]: Start difference. First operand 138 states and 162 transitions. Second operand 5 states. [2018-12-03 02:52:35,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:52:35,887 INFO L93 Difference]: Finished difference Result 148 states and 171 transitions. [2018-12-03 02:52:35,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 02:52:35,887 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-12-03 02:52:35,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:52:35,887 INFO L225 Difference]: With dead ends: 148 [2018-12-03 02:52:35,887 INFO L226 Difference]: Without dead ends: 82 [2018-12-03 02:52:35,887 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-03 02:52:35,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-03 02:52:35,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-12-03 02:52:35,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-03 02:52:35,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2018-12-03 02:52:35,892 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 73 [2018-12-03 02:52:35,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:52:35,893 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2018-12-03 02:52:35,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:52:35,893 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2018-12-03 02:52:35,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-03 02:52:35,893 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:52:35,893 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-03 02:52:35,893 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:52:35,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:52:35,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1289345495, now seen corresponding path program 1 times [2018-12-03 02:52:35,893 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 02:52:35,894 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/cvc4 Starting monitored process 53 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 02:52:35,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:52:35,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:52:35,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:52:36,707 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-03 02:52:36,707 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 02:52:36,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:52:36,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-03 02:52:36,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 02:52:36,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 02:52:36,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-12-03 02:52:36,710 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand 12 states. [2018-12-03 02:52:41,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:52:41,427 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2018-12-03 02:52:41,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 02:52:41,427 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 77 [2018-12-03 02:52:41,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:52:41,427 INFO L225 Difference]: With dead ends: 90 [2018-12-03 02:52:41,428 INFO L226 Difference]: Without dead ends: 72 [2018-12-03 02:52:41,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=52, Invalid=253, Unknown=1, NotChecked=0, Total=306 [2018-12-03 02:52:41,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-03 02:52:41,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-12-03 02:52:41,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-03 02:52:41,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2018-12-03 02:52:41,432 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 77 [2018-12-03 02:52:41,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:52:41,432 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2018-12-03 02:52:41,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 02:52:41,432 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2018-12-03 02:52:41,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-03 02:52:41,432 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:52:41,432 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-03 02:52:41,433 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:52:41,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:52:41,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1480434104, now seen corresponding path program 1 times [2018-12-03 02:52:41,433 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 02:52:41,433 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/cvc4 Starting monitored process 54 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 02:52:41,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:52:41,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:52:41,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:52:41,634 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-03 02:52:41,635 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 02:52:41,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:52:41,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-03 02:52:41,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 02:52:41,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 02:52:41,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-03 02:52:41,637 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand 10 states. [2018-12-03 02:52:41,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:52:41,896 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2018-12-03 02:52:41,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 02:52:41,897 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2018-12-03 02:52:41,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:52:41,897 INFO L225 Difference]: With dead ends: 72 [2018-12-03 02:52:41,897 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 02:52:41,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-12-03 02:52:41,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 02:52:41,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 02:52:41,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 02:52:41,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 02:52:41,898 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2018-12-03 02:52:41,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:52:41,898 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 02:52:41,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 02:52:41,898 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 02:52:41,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 02:52:41,901 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 02:52:42,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:52:42,021 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 161 [2018-12-03 02:52:42,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:52:42,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:52:42,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:52:42,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:52:42,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:52:42,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:52:42,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:52:42,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:52:42,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:52:42,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:52:43,596 WARN L180 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 157 DAG size of output: 95 [2018-12-03 02:52:52,821 WARN L180 SmtUtils]: Spent 9.22 s on a formula simplification. DAG size of input: 146 DAG size of output: 62 [2018-12-03 02:52:54,017 WARN L180 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 138 DAG size of output: 54 [2018-12-03 02:52:54,241 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2018-12-03 02:53:14,052 WARN L180 SmtUtils]: Spent 19.80 s on a formula simplification. DAG size of input: 352 DAG size of output: 220 [2018-12-03 02:54:24,691 WARN L180 SmtUtils]: Spent 1.18 m on a formula simplification. DAG size of input: 192 DAG size of output: 139 [2018-12-03 02:54:24,695 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-03 02:54:24,695 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-03 02:54:24,695 INFO L448 ceAbstractionStarter]: For program point L19(lines 19 24) no Hoare annotation was computed. [2018-12-03 02:54:24,695 INFO L448 ceAbstractionStarter]: For program point L48(lines 47 62) no Hoare annotation was computed. [2018-12-03 02:54:24,695 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-03 02:54:24,695 INFO L448 ceAbstractionStarter]: For program point L28(lines 27 42) no Hoare annotation was computed. [2018-12-03 02:54:24,695 INFO L448 ceAbstractionStarter]: For program point L49(lines 47 62) no Hoare annotation was computed. [2018-12-03 02:54:24,695 INFO L448 ceAbstractionStarter]: For program point L37(lines 37 41) no Hoare annotation was computed. [2018-12-03 02:54:24,695 INFO L444 ceAbstractionStarter]: At program point L37-1(lines 27 42) the Hoare annotation is: (not (= (_ bv0 32) |base2flt_#in~m|)) [2018-12-03 02:54:24,695 INFO L448 ceAbstractionStarter]: For program point L25(lines 25 65) no Hoare annotation was computed. [2018-12-03 02:54:24,695 INFO L451 ceAbstractionStarter]: At program point base2fltENTRY(lines 14 72) the Hoare annotation is: true [2018-12-03 02:54:24,696 INFO L448 ceAbstractionStarter]: For program point base2fltFINAL(lines 14 72) no Hoare annotation was computed. [2018-12-03 02:54:24,696 INFO L444 ceAbstractionStarter]: At program point L63(lines 25 65) the Hoare annotation is: (not (= (_ bv0 32) |base2flt_#in~m|)) [2018-12-03 02:54:24,696 INFO L448 ceAbstractionStarter]: For program point base2fltEXIT(lines 14 72) no Hoare annotation was computed. [2018-12-03 02:54:24,696 INFO L444 ceAbstractionStarter]: At program point L47-2(lines 47 62) the Hoare annotation is: (not (= (_ bv0 32) |base2flt_#in~m|)) [2018-12-03 02:54:24,696 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-03 02:54:24,696 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-03 02:54:24,696 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-03 02:54:24,696 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-03 02:54:24,696 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 214 345) no Hoare annotation was computed. [2018-12-03 02:54:24,696 INFO L444 ceAbstractionStarter]: At program point L242(line 242) the Hoare annotation is: (= (_ bv0 32) main_~zero~0) [2018-12-03 02:54:24,696 INFO L448 ceAbstractionStarter]: For program point L242-1(line 242) no Hoare annotation was computed. [2018-12-03 02:54:24,696 INFO L448 ceAbstractionStarter]: For program point L267(lines 267 300) no Hoare annotation was computed. [2018-12-03 02:54:24,696 INFO L448 ceAbstractionStarter]: For program point L267-1(lines 238 344) no Hoare annotation was computed. [2018-12-03 02:54:24,696 INFO L448 ceAbstractionStarter]: For program point L309(lines 309 313) no Hoare annotation was computed. [2018-12-03 02:54:24,696 INFO L448 ceAbstractionStarter]: For program point L309-2(lines 309 313) no Hoare annotation was computed. [2018-12-03 02:54:24,696 INFO L448 ceAbstractionStarter]: For program point L268(lines 268 297) no Hoare annotation was computed. [2018-12-03 02:54:24,696 INFO L448 ceAbstractionStarter]: For program point L285(lines 285 289) no Hoare annotation was computed. [2018-12-03 02:54:24,696 INFO L448 ceAbstractionStarter]: For program point L285-2(lines 285 289) no Hoare annotation was computed. [2018-12-03 02:54:24,696 INFO L448 ceAbstractionStarter]: For program point L244(lines 244 253) no Hoare annotation was computed. [2018-12-03 02:54:24,696 INFO L448 ceAbstractionStarter]: For program point L244-2(lines 238 344) no Hoare annotation was computed. [2018-12-03 02:54:24,697 INFO L448 ceAbstractionStarter]: For program point L269(lines 269 278) no Hoare annotation was computed. [2018-12-03 02:54:24,697 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 214 345) no Hoare annotation was computed. [2018-12-03 02:54:24,697 INFO L444 ceAbstractionStarter]: At program point L269-2(lines 269 278) the Hoare annotation is: (let ((.cse11 (bvult main_~a~0 main_~r_add~0)) (.cse10 (= (_ bv1 32) main_~tmp___2~0)) (.cse2 (exists ((main_~zero~0 (_ BitVec 32))) (bvugt main_~b~0 main_~zero~0))) (.cse12 (exists ((main_~zero~0 (_ BitVec 32))) (bvugt main_~a~0 main_~zero~0))) (.cse3 (= (_ bv0 32) main_~zero~0)) (.cse14 (= (bvadd main_~tmp___1~0 (_ bv4294967295 32)) (_ bv0 32)))) (let ((.cse0 (= main_~tmp___1~0 (_ bv0 32))) (.cse15 (not (bvult main_~r_add~0 main_~a~0))) (.cse1 (= main_~tmp___2~0 (_ bv0 32))) (.cse16 (and .cse11 .cse10 .cse2 .cse12 .cse3 .cse14))) (let ((.cse4 (not (bvult main_~a~0 main_~b~0))) (.cse13 (= (bvadd main_~r_add~0 (_ bv1 32)) (_ bv0 32))) (.cse5 (= (bvadd main_~tmp~2 (_ bv4294967295 32)) (_ bv0 32))) (.cse6 (= (bvadd main_~tmp___0~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse7 (= (bvadd main_~sb~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse8 (= (bvadd main_~sa~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse9 (or (and .cse0 .cse15 .cse1 .cse2 .cse12 .cse3) .cse16))) (or (and .cse0 (= main_~a~0 main_~r_add~0) .cse1 .cse2 .cse3 .cse4) (and (not (= (bvadd (bvlshr main_~b~0 (_ bv24 32)) (_ bv4294967041 32)) (_ bv0 32))) .cse5 .cse6 .cse7 (exists ((v_addflt_~ma~0_81 (_ BitVec 32))) (= main_~r_add~0 (bvor (bvand (_ bv16777215 32) v_addflt_~ma~0_81) (bvshl (bvadd (bvlshr main_~b~0 (_ bv24 32)) (_ bv1 32)) (_ bv24 32))))) .cse8 .cse9) (and .cse10 (or (and (= main_~b~0 main_~r_add~0) .cse11 .cse12 .cse3) (and .cse12 .cse3 .cse13 (= (bvadd main_~b~0 (_ bv1 32)) (_ bv0 32)))) .cse14) (and (or (and .cse0 .cse15 .cse1 .cse2 .cse3 .cse4) (and .cse16 .cse4) (and .cse10 .cse2 .cse12 .cse3 .cse14 .cse13)) .cse5 .cse6 .cse7 .cse8) (and .cse5 .cse6 .cse7 .cse8 .cse9 (exists ((addflt_~delta~0 (_ BitVec 32)) (addflt_~b (_ BitVec 32))) (let ((.cse19 (bvneg (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) main_~b~0))))) (let ((.cse18 (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~b)) addflt_~delta~0)) (.cse20 (bvneg .cse19))) (let ((.cse17 (bvadd .cse18 .cse20))) (and (= (_ bv0 32) (bvand (_ bv33554432 32) .cse17)) (not (= (bvadd .cse18 .cse19 .cse20) (_ bv0 32))) (= main_~r_add~0 (bvor (bvand (_ bv16777215 32) .cse17) (bvshl (bvlshr main_~b~0 (_ bv24 32)) (_ bv24 32)))))))))))))) [2018-12-03 02:54:24,697 INFO L448 ceAbstractionStarter]: For program point L319(lines 319 328) no Hoare annotation was computed. [2018-12-03 02:54:24,697 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 214 345) the Hoare annotation is: true [2018-12-03 02:54:24,697 INFO L448 ceAbstractionStarter]: For program point L319-2(lines 318 334) no Hoare annotation was computed. [2018-12-03 02:54:24,697 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_~a~0 main_~zero~0))) (.cse2 (exists ((main_~zero~0 (_ BitVec 32))) (bvugt main_~b~0 main_~zero~0))) (.cse1 (= (_ bv0 32) main_~zero~0))) (or (and (= main_~tmp___0~0 (_ bv0 32)) (= main_~b~0 (_ bv0 32)) (= (_ bv0 32) main_~sb~0)) (and .cse0 .cse1 (= (bvadd main_~b~0 (_ bv1 32)) (_ bv0 32))) (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)) .cse2 .cse0 .cse1 (= (bvadd main_~sa~0 (_ bv4294967295 32)) (_ bv0 32))) (and (= (_ bv4294967295 32) main_~a~0) .cse2 .cse1) (and (not (bvugt main_~a~0 (_ bv0 32))) (= (_ bv0 32) main_~sa~0) .cse2 .cse1 (= main_~tmp~2 (_ bv0 32))))) [2018-12-03 02:54:24,697 INFO L448 ceAbstractionStarter]: For program point L304(lines 304 340) no Hoare annotation was computed. [2018-12-03 02:54:24,698 INFO L448 ceAbstractionStarter]: For program point L304-1(lines 304 340) no Hoare annotation was computed. [2018-12-03 02:54:24,698 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-03 02:54:24,698 INFO L448 ceAbstractionStarter]: For program point L280(lines 268 295) no Hoare annotation was computed. [2018-12-03 02:54:24,698 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 251) no Hoare annotation was computed. [2018-12-03 02:54:24,698 INFO L448 ceAbstractionStarter]: For program point L247-2(lines 247 251) no Hoare annotation was computed. [2018-12-03 02:54:24,698 INFO L444 ceAbstractionStarter]: At program point L305(lines 301 341) the Hoare annotation is: (or (= main_~a~0 main_~r_add~0) (and (= main_~b~0 main_~r_add~0) (exists ((main_~zero~0 (_ BitVec 32))) (bvugt main_~b~0 main_~zero~0)) (= (_ bv0 32) main_~zero~0))) [2018-12-03 02:54:24,698 INFO L448 ceAbstractionStarter]: For program point L272(lines 272 276) no Hoare annotation was computed. [2018-12-03 02:54:24,698 INFO L448 ceAbstractionStarter]: For program point L272-2(lines 272 276) no Hoare annotation was computed. [2018-12-03 02:54:24,698 INFO L448 ceAbstractionStarter]: For program point L322(lines 322 326) no Hoare annotation was computed. [2018-12-03 02:54:24,698 INFO L448 ceAbstractionStarter]: For program point L322-2(lines 322 326) no Hoare annotation was computed. [2018-12-03 02:54:24,698 INFO L448 ceAbstractionStarter]: For program point L306-1(lines 304 338) no Hoare annotation was computed. [2018-12-03 02:54:24,698 INFO L451 ceAbstractionStarter]: At program point L240(line 240) the Hoare annotation is: true [2018-12-03 02:54:24,698 INFO L448 ceAbstractionStarter]: For program point L240-1(line 240) no Hoare annotation was computed. [2018-12-03 02:54:24,698 INFO L448 ceAbstractionStarter]: For program point L265(line 265) no Hoare annotation was computed. [2018-12-03 02:54:24,698 INFO L448 ceAbstractionStarter]: For program point L257(lines 257 261) no Hoare annotation was computed. [2018-12-03 02:54:24,698 INFO L448 ceAbstractionStarter]: For program point L257-2(lines 257 261) no Hoare annotation was computed. [2018-12-03 02:54:24,698 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))))) (.cse9 (exists ((main_~zero~0 (_ BitVec 32))) (bvugt main_~a~0 main_~zero~0))) (.cse10 (= (_ bv0 32) main_~zero~0)) (.cse8 (exists ((main_~zero~0 (_ BitVec 32))) (bvugt main_~b~0 main_~zero~0))) (.cse7 (not (bvult main_~r_add~0 main_~a~0)))) (let ((.cse0 (and .cse6 (and (or (and (= main_~b~0 main_~r_add~0) .cse9 .cse10) (and (and (= main_~a~0 main_~r_add~0) .cse10) .cse8)) .cse7))) (.cse3 (= (bvadd main_~tmp___3~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse4 (= (_ bv1 32) main_~tmp___4~0)) (.cse1 (= main_~tmp___3~0 (_ bv0 32))) (.cse2 (= main_~tmp___4~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse0 .cse4) (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 ((.cse5 (and .cse6 (and .cse7 .cse8 .cse9 .cse10)))) (or (and .cse5 .cse3 .cse4) (and .cse5 .cse1 .cse2))) (= (bvadd main_~sa~0 (_ bv4294967295 32)) (_ bv0 32)))))) [2018-12-03 02:54:24,699 INFO L444 ceAbstractionStarter]: At program point L241(line 241) the Hoare annotation is: (= (_ bv0 32) main_~zero~0) [2018-12-03 02:54:24,699 INFO L448 ceAbstractionStarter]: For program point L241-1(line 241) no Hoare annotation was computed. [2018-12-03 02:54:24,699 INFO L448 ceAbstractionStarter]: For program point L128(line 128) no Hoare annotation was computed. [2018-12-03 02:54:24,699 INFO L451 ceAbstractionStarter]: At program point addfltENTRY(lines 73 136) the Hoare annotation is: true [2018-12-03 02:54:24,699 INFO L448 ceAbstractionStarter]: For program point addfltFINAL(lines 73 136) no Hoare annotation was computed. [2018-12-03 02:54:24,699 INFO L448 ceAbstractionStarter]: For program point L116(lines 116 121) no Hoare annotation was computed. [2018-12-03 02:54:24,699 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 113) no Hoare annotation was computed. [2018-12-03 02:54:24,699 INFO L444 ceAbstractionStarter]: At program point L104(line 104) the Hoare annotation is: (and (not (= (_ bv0 32) |addflt_#in~b|)) (let ((.cse0 (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) |addflt_#in~b|))) (.cse2 (bvadd (bvlshr |addflt_#in~b| (_ bv24 32)) (_ bv4294967168 32))) (.cse1 (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))))) (or (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|)) .cse1 (= addflt_~a |addflt_#in~a|) (= .cse2 addflt_~eb~0) (= (bvadd (bvlshr addflt_~a (_ bv24 32)) (_ bv4294967168 32)) addflt_~ea~0)) (and (= .cse0 addflt_~ma~0) (= .cse2 addflt_~ea~0) (= (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) |addflt_#in~a|)) addflt_~mb~0) (= addflt_~b |addflt_#in~a|) .cse1 (= (bvadd (bvlshr |addflt_#in~a| (_ bv24 32)) (_ bv4294967168 32)) addflt_~eb~0) (bvult |addflt_#in~a| addflt_~a) (= addflt_~a |addflt_#in~b|)))) (bvugt |addflt_#in~a| (_ bv0 32))) [2018-12-03 02:54:24,699 INFO L448 ceAbstractionStarter]: For program point L104-1(line 104) no Hoare annotation was computed. [2018-12-03 02:54:24,700 INFO L444 ceAbstractionStarter]: At program point L133(lines 83 135) the Hoare annotation is: (let ((.cse34 (bvshl (bvadd addflt_~ea~0 (_ bv128 32)) (_ bv24 32))) (.cse7 (= (_ bv4294967295 32) |addflt_#in~b|))) (let ((.cse1 (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))) (.cse0 (not .cse7)) (.cse12 (not (= (bvadd |addflt_#in~a| (_ bv1 32)) (_ bv0 32)))) (.cse6 (= (_ bv0 32) |addflt_#in~a|)) (.cse11 (= (_ bv0 32) |addflt_#in~b|)) (.cse8 (let ((.cse36 (bvadd addflt_~mb~0 addflt_~ma~0))) (or (not (= (bvand (_ bv33554432 32) .cse36) (_ bv0 32))) (not (bvult (bvor (bvand (_ bv16777215 32) .cse36) .cse34) |addflt_#in~a|))))) (.cse9 (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) .cse34) |addflt_#in~a|)) (not (= (bvand (_ bv33554432 32) .cse35) (_ bv0 32)))))) (.cse10 (not (bvult (bvor (bvand (_ bv16777215 32) addflt_~ma~0) .cse34) |addflt_#in~a|))) (.cse4 (= addflt_~b |addflt_#in~a|)) (.cse5 (= addflt_~a |addflt_#in~a|)) (.cse13 (= addflt_~__retres10~0 |addflt_#in~a|)) (.cse22 (= addflt_~__retres10~0 |addflt_#in~b|)) (.cse19 (= addflt_~a |addflt_#in~b|))) (and (let ((.cse3 (and .cse7 (= (bvadd addflt_~a (_ bv1 32)) (_ bv0 32))))) (or .cse0 (let ((.cse2 (or (and .cse3 .cse4) (and .cse3 .cse5)))) (or (and .cse1 (not (= (_ bv33554431 32) addflt_~ma~0)) .cse2) (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)) .cse2))) (and .cse6 .cse3))) (or (or .cse1 (and .cse8 .cse9 .cse10)) .cse11 .cse12) (or .cse0 .cse12 (and (= (bvadd addflt_~ma~0 (_ bv4227858434 32)) (_ bv0 32)) (= (_ bv127 32) addflt_~eb~0))) (or (not .cse11) .cse13) (let ((.cse15 (= addflt_~b |addflt_#in~b|)) (.cse14 (bvlshr |addflt_#in~a| (_ bv24 32)))) (let ((.cse23 (bvadd .cse14 (_ bv4294967168 32))) (.cse16 (let ((.cse32 (let ((.cse33 (not (bvult addflt_~a addflt_~b)))) (or (and .cse33 .cse4) (and .cse33 .cse5))))) (or (and .cse19 .cse32) (and .cse15 .cse32))))) (let ((.cse18 (bvlshr |addflt_#in~b| (_ bv24 32))) (.cse17 (and .cse10 (not (bvult addflt_~__retres10~0 |addflt_#in~a|)) .cse16)) (.cse24 (= (bvadd addflt_~__retres10~0 (_ bv1 32)) (_ bv0 32))) (.cse20 (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) |addflt_#in~a|)) (bvadd (bvneg .cse23) addflt_~ea~0))) (.cse21 (bvult |addflt_#in~a| addflt_~a))) (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))))) (not (= (bvadd .cse14 (_ bv4294967041 32)) (_ bv0 32))) (= (bvadd .cse14 (_ bv4294967169 32)) addflt_~ea~0) .cse5 .cse15 .cse16) (and (exists ((v_addflt_~ma~0_81 (_ BitVec 32))) (= (bvor (bvand (_ bv16777215 32) v_addflt_~ma~0_81) (bvshl (bvadd (bvlshr |addflt_#in~b| (_ bv24 32)) (_ bv1 32)) (_ bv24 32))) addflt_~__retres10~0)) .cse17 (= (bvadd .cse18 (_ bv4294967169 32)) addflt_~ea~0) (not (= (bvadd .cse18 (_ bv4294967041 32)) (_ bv0 32))) .cse19) (and .cse6 .cse4) (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))) (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)) (= .cse20 addflt_~mb~0) .cse4 .cse21 .cse22 .cse19) (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) (= .cse23 addflt_~ea~0) .cse5 .cse15 (or .cse17 (and .cse24 (not (= (_ bv0 32) (bvand (_ bv33554432 32) addflt_~ma~0))) .cse16))) (and .cse5 .cse11 .cse15) (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))) .cse24 (not (= (_ bv0 32) .cse20)) .cse16 .cse21) (and (exists ((addflt_~a (_ BitVec 32))) (let ((.cse26 (bvlshr addflt_~a (_ bv24 32)))) (let ((.cse27 (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) |addflt_#in~a|)) (bvadd (bvneg (bvadd (bvlshr |addflt_#in~a| (_ bv24 32)) (_ bv4294967168 32))) .cse26 (_ bv4294967168 32))))) (let ((.cse25 (bvadd (bvneg (bvneg .cse27)) (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~a))))) (and (= addflt_~__retres10~0 (bvor (bvand (_ bv16777215 32) .cse25) (bvshl .cse26 (_ bv24 32)))) (bvult |addflt_#in~a| addflt_~a) (= (_ bv0 32) (bvand (_ bv33554432 32) .cse25)) (not (= .cse27 (_ bv0 32)))))))) .cse8 .cse9 .cse10 (exists ((addflt_~delta~0 (_ BitVec 32)) (addflt_~b (_ BitVec 32))) (let ((.cse28 (bvneg (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) |addflt_#in~b|))))) (let ((.cse30 (bvneg .cse28)) (.cse29 (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~b)) addflt_~delta~0))) (let ((.cse31 (bvadd .cse30 .cse29))) (and (not (= (bvadd .cse28 .cse29 .cse30) (_ bv0 32))) (= addflt_~__retres10~0 (bvor (bvand (_ bv16777215 32) .cse31) (bvshl (bvlshr |addflt_#in~b| (_ bv24 32)) (_ bv24 32)))) (= (_ bv0 32) (bvand (_ bv33554432 32) .cse31))))))) .cse16))))) (or (bvugt |addflt_#in~a| (_ bv0 32)) (and .cse5 .cse13) (and .cse22 .cse19))))) [2018-12-03 02:54:24,700 INFO L448 ceAbstractionStarter]: For program point addfltEXIT(lines 73 136) no Hoare annotation was computed. [2018-12-03 02:54:24,700 INFO L448 ceAbstractionStarter]: For program point L84(lines 84 90) no Hoare annotation was computed. [2018-12-03 02:54:24,700 INFO L448 ceAbstractionStarter]: For program point L115(lines 115 126) no Hoare annotation was computed. [2018-12-03 02:54:24,700 INFO L448 ceAbstractionStarter]: For program point L84-2(lines 83 135) no Hoare annotation was computed. [2018-12-03 02:54:24,700 INFO L444 ceAbstractionStarter]: At program point L115-2(lines 115 126) the Hoare annotation is: (and (not (= (_ bv0 32) |addflt_#in~b|)) (let ((.cse9 (bvlshr |addflt_#in~b| (_ bv24 32))) (.cse3 (= addflt_~b |addflt_#in~b|)) (.cse10 (= addflt_~a |addflt_#in~b|)) (.cse2 (= addflt_~a |addflt_#in~a|))) (let ((.cse6 (let ((.cse15 (let ((.cse17 (not (bvult addflt_~a addflt_~b)))) (or (and .cse2 .cse17) (and (= addflt_~b |addflt_#in~a|) .cse17))))) (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 ((.cse16 (= (_ bv0 32) (bvand (_ bv33554432 32) addflt_~ma~0)))) (or (and .cse15 .cse16 .cse10) (and .cse15 .cse16 .cse3)))) (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 .cse15 .cse3) (and .cse15 .cse10)))))) (.cse5 (bvlshr |addflt_#in~a| (_ bv24 32))) (.cse8 (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) |addflt_#in~b|))) (.cse7 (bvadd .cse9 (_ bv4294967168 32)))) (let ((.cse0 (= (bvlshr .cse8 (bvadd (bvlshr addflt_~a (_ bv24 32)) (bvneg .cse7) (_ bv4294967168 32))) addflt_~mb~0)) (.cse1 (bvadd .cse5 (_ bv4294967168 32))) (.cse4 (let ((.cse13 (bvshl (bvadd addflt_~ea~0 (_ bv128 32)) (_ bv24 32)))) (let ((.cse11 (not (bvult (bvor (bvand (_ bv16777215 32) addflt_~ma~0) .cse13) |addflt_#in~a|)))) (or (and .cse2 .cse11 .cse6) (and (let ((.cse12 (bvadd addflt_~mb~0 addflt_~ma~0))) (or (not (= (bvand (_ bv33554432 32) .cse12) (_ bv0 32))) (not (bvult (bvor (bvand (_ bv16777215 32) .cse12) .cse13) |addflt_#in~a|)))) (let ((.cse14 (bvadd (bvlshr addflt_~mb~0 (bvadd addflt_~ea~0 (bvneg addflt_~eb~0))) addflt_~ma~0))) (or (not (bvult (bvor (bvand (_ bv16777215 32) .cse14) .cse13) |addflt_#in~a|)) (not (= (bvand (_ bv33554432 32) .cse14) (_ bv0 32))))) .cse11 .cse6)))))) (or (and .cse0 (= .cse1 addflt_~ea~0) .cse2 .cse3 .cse4) (and .cse0 (not (= (bvadd .cse5 (_ bv4294967041 32)) (_ bv0 32))) (= (bvadd .cse5 (_ bv4294967169 32)) addflt_~ea~0) .cse2 .cse6) (and (= .cse7 addflt_~ea~0) .cse6 (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 .cse8) addflt_~ma~0)))) (and (= (bvadd .cse9 (_ bv4294967169 32)) addflt_~ea~0) (not (= (bvadd .cse9 (_ bv4294967041 32)) (_ bv0 32))) .cse10 .cse4))))) (bvugt |addflt_#in~a| (_ bv0 32)) (not (= (bvadd |addflt_#in~a| (_ bv1 32)) (_ bv0 32)))) [2018-12-03 02:54:24,700 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2018-12-03 02:54:24,700 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) no Hoare annotation was computed. [2018-12-03 02:54:24,700 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 5 10) no Hoare annotation was computed. [2018-12-03 02:54:24,700 INFO L448 ceAbstractionStarter]: For program point L7(line 7) no Hoare annotation was computed. [2018-12-03 02:54:24,700 INFO L448 ceAbstractionStarter]: For program point L6(lines 6 8) no Hoare annotation was computed. [2018-12-03 02:54:24,701 INFO L448 ceAbstractionStarter]: For program point L6-2(lines 5 10) no Hoare annotation was computed. [2018-12-03 02:54:24,708 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~zero~0,QUANTIFIED] [2018-12-03 02:54:24,709 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~zero~0,QUANTIFIED] [2018-12-03 02:54:24,714 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-03 02:54:24,714 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-03 02:54:24,715 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-03 02:54:24,715 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-03 02:54:24,715 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-03 02:54:24,715 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-03 02:54:24,715 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~ma~0,QUANTIFIED] [2018-12-03 02:54:24,716 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_addflt_~ma~0_81,QUANTIFIED] [2018-12-03 02:54:24,716 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-03 02:54:24,716 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-03 02:54:24,717 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-03 02:54:24,717 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-03 02:54:24,717 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-03 02:54:24,717 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-03 02:54:24,718 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-03 02:54:24,718 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-03 02:54:24,718 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-03 02:54:24,718 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-03 02:54:24,719 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-03 02:54:24,719 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-03 02:54:24,719 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-03 02:54:24,719 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-03 02:54:24,719 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-03 02:54:24,720 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-03 02:54:24,720 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-03 02:54:24,720 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-03 02:54:24,720 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-03 02:54:24,720 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-03 02:54:24,720 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-03 02:54:24,721 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-03 02:54:24,724 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-03 02:54:24,724 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-03 02:54:24,725 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-03 02:54:24,725 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-03 02:54:24,725 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-03 02:54:24,725 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-03 02:54:24,725 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~ma~0,QUANTIFIED] [2018-12-03 02:54:24,726 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_addflt_~ma~0_81,QUANTIFIED] [2018-12-03 02:54:24,726 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-03 02:54:24,726 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-03 02:54:24,726 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-03 02:54:24,726 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-03 02:54:24,727 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-03 02:54:24,727 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-03 02:54:24,727 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-03 02:54:24,727 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-03 02:54:24,727 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-03 02:54:24,728 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-03 02:54:24,728 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-03 02:54:24,728 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-03 02:54:24,728 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-03 02:54:24,728 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-03 02:54:24,729 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-03 02:54:24,729 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-03 02:54:24,729 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-03 02:54:24,729 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-03 02:54:24,729 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-03 02:54:24,730 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-03 02:54:24,730 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-03 02:54:24,730 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-03 02:54:24,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 02:54:24 BoogieIcfgContainer [2018-12-03 02:54:24,734 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 02:54:24,735 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 02:54:24,735 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 02:54:24,735 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 02:54:24,735 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 02:51:15" (3/4) ... [2018-12-03 02:54:24,738 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-03 02:54:24,743 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-03 02:54:24,743 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure base2flt [2018-12-03 02:54:24,743 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-03 02:54:24,743 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure addflt [2018-12-03 02:54:24,743 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-12-03 02:54:24,748 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2018-12-03 02:54:24,748 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-03 02:54:24,748 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-03 02:54:24,767 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(0bv32 == \old(m)) || (0bv32 == __retres4 && m == \old(m)) [2018-12-03 02:54:24,767 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(0bv32 == \old(m)) [2018-12-03 02:54:24,767 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(0bv32 == \old(m)) [2018-12-03 02:54:24,767 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(0bv32 == \old(m)) [2018-12-03 02:54:24,767 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: a == r_add || ((b == r_add && (\exists main_~zero~0 : bv32 :: ~bvugt32(b, main_~zero~0))) && 0bv32 == zero) [2018-12-03 02:54:24,768 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(4294967295bv32 == \old(b)) || (((\exists addflt_~delta~0 : bv32, addflt_~b : bv32 :: ~bvadd64(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0), 33554431bv32) == ma) && !(33554431bv32 == ma)) && (((4294967295bv32 == \old(b) && ~bvadd64(a, 1bv32) == 0bv32) && b == \old(a)) || ((4294967295bv32 == \old(b) && ~bvadd64(a, 1bv32) == 0bv32) && a == \old(a)))) || (((\exists addflt_~delta~0 : bv32, addflt_~b : bv32 :: ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0) == mb) && ~bvadd64(ma, 4261412865bv32) == 0bv32) && (((4294967295bv32 == \old(b) && ~bvadd64(a, 1bv32) == 0bv32) && b == \old(a)) || ((4294967295bv32 == \old(b) && ~bvadd64(a, 1bv32) == 0bv32) && a == \old(a))))) || (0bv32 == \old(a) && 4294967295bv32 == \old(b) && ~bvadd64(a, 1bv32) == 0bv32)) && ((((\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))) && ((!(4294967295bv32 == \old(b)) || !(~bvadd64(\old(a), 1bv32) == 0bv32)) || (~bvadd64(ma, 4227858434bv32) == 0bv32 && 127bv32 == eb))) && (!(0bv32 == \old(b)) || __retres10 == \old(a))) && (((((((((((((\exists addflt_~ma~0 : bv32 :: __retres10 == ~bvor32(addflt_~ma~0, ~bvshl32(~bvadd64(~bvlshr64(\old(a), 24bv32), 1bv32), 24bv32))) && !(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967041bv32) == 0bv32)) && ~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967169bv32) == ea) && a == \old(a)) && b == \old(b)) && ((a == \old(b) && ((!~bvult64(a, b) && b == \old(a)) || (!~bvult64(a, b) && a == \old(a)))) || (b == \old(b) && ((!~bvult64(a, b) && b == \old(a)) || (!~bvult64(a, b) && a == \old(a)))))) || (((((\exists v_addflt_~ma~0_81 : bv32 :: ~bvor32(~bvand64(16777215bv32, v_addflt_~ma~0_81), ~bvshl32(~bvadd64(~bvlshr64(\old(b), 24bv32), 1bv32), 24bv32)) == __retres10) && (!~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a)) && !~bvult64(__retres10, \old(a))) && ((a == \old(b) && ((!~bvult64(a, b) && b == \old(a)) || (!~bvult64(a, b) && a == \old(a)))) || (b == \old(b) && ((!~bvult64(a, b) && b == \old(a)) || (!~bvult64(a, b) && a == \old(a)))))) && ~bvadd64(~bvlshr64(\old(b), 24bv32), 4294967169bv32) == ea) && !(~bvadd64(~bvlshr64(\old(b), 24bv32), 4294967041bv32) == 0bv32)) && a == \old(b))) || (0bv32 == \old(a) && b == \old(a))) || (((((((\exists addflt_~a : bv32 :: (ma == ~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~a)) && ~bvult64(\old(a), addflt_~a)) && ~bvadd64(~bvlshr64(addflt_~a, 24bv32), 4294967168bv32) == ea) && (\exists addflt_~delta~0 : bv32, addflt_~b : bv32, addflt_~a : bv32 :: ~bvlshr64(~bvadd64(~bvneg32(~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0))), ~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~a))), 1bv32) == ma)) && ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ea)) == mb) && b == \old(a)) && ~bvult64(\old(a), a)) && __retres10 == \old(b)) && a == \old(b))) || ((((~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b))), ~bvadd64(~bvlshr64(a, 24bv32), ~bvneg32(~bvadd64(~bvlshr64(\old(b), 24bv32), 4294967168bv32)), 4294967168bv32)) == mb && ~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32) == ea) && a == \old(a)) && b == \old(b)) && (((!~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a)) && !~bvult64(__retres10, \old(a))) && ((a == \old(b) && ((!~bvult64(a, b) && b == \old(a)) || (!~bvult64(a, b) && a == \old(a)))) || (b == \old(b) && ((!~bvult64(a, b) && b == \old(a)) || (!~bvult64(a, b) && a == \old(a)))))) || ((~bvadd64(__retres10, 1bv32) == 0bv32 && !(0bv32 == ~bvand64(33554432bv32, ma))) && ((a == \old(b) && ((!~bvult64(a, b) && b == \old(a)) || (!~bvult64(a, b) && a == \old(a)))) || (b == \old(b) && ((!~bvult64(a, b) && b == \old(a)) || (!~bvult64(a, b) && a == \old(a))))))))) || ((a == \old(a) && 0bv32 == \old(b)) && 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) && ~bvadd64(__retres10, 1bv32) == 0bv32) && !(0bv32 == ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ea)))) && ((a == \old(b) && ((!~bvult64(a, b) && b == \old(a)) || (!~bvult64(a, b) && a == \old(a)))) || (b == \old(b) && ((!~bvult64(a, b) && b == \old(a)) || (!~bvult64(a, b) && a == \old(a)))))) && ~bvult64(\old(a), a))) || ((((((\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))) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a))) && (\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))))) && ((a == \old(b) && ((!~bvult64(a, b) && b == \old(a)) || (!~bvult64(a, b) && a == \old(a)))) || (b == \old(b) && ((!~bvult64(a, b) && b == \old(a)) || (!~bvult64(a, b) && a == \old(a)))))))) && ((~bvugt32(\old(a), 0bv32) || (a == \old(a) && __retres10 == \old(a))) || (__retres10 == \old(b) && a == \old(b))) [2018-12-03 02:54:24,788 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_bc9abfad-74fb-4b5d-846a-44d85a319640/bin-2019/utaipan/witness.graphml [2018-12-03 02:54:24,788 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 02:54:24,788 INFO L168 Benchmark]: Toolchain (without parser) took 189316.56 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 285.7 MB). Free memory was 943.4 MB in the beginning and 944.4 MB in the end (delta: -977.2 kB). Peak memory consumption was 284.8 MB. Max. memory is 11.5 GB. [2018-12-03 02:54:24,789 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 02:54:24,789 INFO L168 Benchmark]: CACSL2BoogieTranslator took 169.72 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-03 02:54:24,789 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.82 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-03 02:54:24,789 INFO L168 Benchmark]: Boogie Preprocessor took 57.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 927.3 MB in the beginning and 1.1 GB in the end (delta: -206.7 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2018-12-03 02:54:24,789 INFO L168 Benchmark]: RCFGBuilder took 234.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2018-12-03 02:54:24,789 INFO L168 Benchmark]: TraceAbstraction took 188783.47 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 140.0 MB). Free memory was 1.1 GB in the beginning and 953.3 MB in the end (delta: 155.7 MB). Peak memory consumption was 455.9 MB. Max. memory is 11.5 GB. [2018-12-03 02:54:24,790 INFO L168 Benchmark]: Witness Printer took 53.21 ms. Allocated memory is still 1.3 GB. Free memory was 953.3 MB in the beginning and 944.4 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 11.5 GB. [2018-12-03 02:54:24,791 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 169.72 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.82 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 57.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 927.3 MB in the beginning and 1.1 GB in the end (delta: -206.7 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 234.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 188783.47 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 140.0 MB). Free memory was 1.1 GB in the beginning and 953.3 MB in the end (delta: 155.7 MB). Peak memory consumption was 455.9 MB. Max. memory is 11.5 GB. * Witness Printer took 53.21 ms. Allocated memory is still 1.3 GB. Free memory was 953.3 MB in the beginning and 944.4 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 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_~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[v_addflt_~ma~0_81,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_~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_~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[v_addflt_~ma~0_81,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_~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] * 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-03 02:54:24,793 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~zero~0,QUANTIFIED] [2018-12-03 02:54:24,794 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~zero~0,QUANTIFIED] Derived loop invariant: a == r_add || ((b == r_add && (\exists main_~zero~0 : bv32 :: ~bvugt32(b, main_~zero~0))) && 0bv32 == zero) - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: !(0bv32 == \old(m)) || (0bv32 == __retres4 && m == \old(m)) - InvariantResult [Line: 83]: Loop Invariant [2018-12-03 02:54:24,794 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-03 02:54:24,794 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-03 02:54:24,794 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-03 02:54:24,794 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-03 02:54:24,795 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-03 02:54:24,795 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-03 02:54:24,795 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~ma~0,QUANTIFIED] [2018-12-03 02:54:24,795 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_addflt_~ma~0_81,QUANTIFIED] [2018-12-03 02:54:24,795 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-03 02:54:24,796 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-03 02:54:24,796 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-03 02:54:24,796 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-03 02:54:24,796 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-03 02:54:24,796 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-03 02:54:24,797 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-03 02:54:24,797 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-03 02:54:24,797 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-03 02:54:24,797 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-03 02:54:24,797 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-03 02:54:24,797 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-03 02:54:24,798 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-03 02:54:24,798 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-03 02:54:24,798 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-03 02:54:24,798 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-03 02:54:24,798 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-03 02:54:24,798 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-03 02:54:24,798 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-03 02:54:24,799 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-03 02:54:24,799 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-03 02:54:24,799 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-03 02:54:24,800 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-03 02:54:24,801 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-03 02:54:24,801 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-03 02:54:24,801 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-03 02:54:24,801 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-03 02:54:24,801 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-03 02:54:24,802 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~ma~0,QUANTIFIED] [2018-12-03 02:54:24,802 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_addflt_~ma~0_81,QUANTIFIED] [2018-12-03 02:54:24,802 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-03 02:54:24,802 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-03 02:54:24,802 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-03 02:54:24,803 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-03 02:54:24,803 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-03 02:54:24,803 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-03 02:54:24,803 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-03 02:54:24,803 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-03 02:54:24,803 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-03 02:54:24,803 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-03 02:54:24,803 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-03 02:54:24,804 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-03 02:54:24,804 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-03 02:54:24,804 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-03 02:54:24,804 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-03 02:54:24,804 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-03 02:54:24,804 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-03 02:54:24,804 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-03 02:54:24,804 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-03 02:54:24,804 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-03 02:54:24,805 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-03 02:54:24,805 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] Derived loop invariant: ((((((!(4294967295bv32 == \old(b)) || (((\exists addflt_~delta~0 : bv32, addflt_~b : bv32 :: ~bvadd64(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0), 33554431bv32) == ma) && !(33554431bv32 == ma)) && (((4294967295bv32 == \old(b) && ~bvadd64(a, 1bv32) == 0bv32) && b == \old(a)) || ((4294967295bv32 == \old(b) && ~bvadd64(a, 1bv32) == 0bv32) && a == \old(a)))) || (((\exists addflt_~delta~0 : bv32, addflt_~b : bv32 :: ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0) == mb) && ~bvadd64(ma, 4261412865bv32) == 0bv32) && (((4294967295bv32 == \old(b) && ~bvadd64(a, 1bv32) == 0bv32) && b == \old(a)) || ((4294967295bv32 == \old(b) && ~bvadd64(a, 1bv32) == 0bv32) && a == \old(a))))) || (0bv32 == \old(a) && 4294967295bv32 == \old(b) && ~bvadd64(a, 1bv32) == 0bv32)) && ((((\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))) && ((!(4294967295bv32 == \old(b)) || !(~bvadd64(\old(a), 1bv32) == 0bv32)) || (~bvadd64(ma, 4227858434bv32) == 0bv32 && 127bv32 == eb))) && (!(0bv32 == \old(b)) || __retres10 == \old(a))) && (((((((((((((\exists addflt_~ma~0 : bv32 :: __retres10 == ~bvor32(addflt_~ma~0, ~bvshl32(~bvadd64(~bvlshr64(\old(a), 24bv32), 1bv32), 24bv32))) && !(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967041bv32) == 0bv32)) && ~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967169bv32) == ea) && a == \old(a)) && b == \old(b)) && ((a == \old(b) && ((!~bvult64(a, b) && b == \old(a)) || (!~bvult64(a, b) && a == \old(a)))) || (b == \old(b) && ((!~bvult64(a, b) && b == \old(a)) || (!~bvult64(a, b) && a == \old(a)))))) || (((((\exists v_addflt_~ma~0_81 : bv32 :: ~bvor32(~bvand64(16777215bv32, v_addflt_~ma~0_81), ~bvshl32(~bvadd64(~bvlshr64(\old(b), 24bv32), 1bv32), 24bv32)) == __retres10) && (!~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a)) && !~bvult64(__retres10, \old(a))) && ((a == \old(b) && ((!~bvult64(a, b) && b == \old(a)) || (!~bvult64(a, b) && a == \old(a)))) || (b == \old(b) && ((!~bvult64(a, b) && b == \old(a)) || (!~bvult64(a, b) && a == \old(a)))))) && ~bvadd64(~bvlshr64(\old(b), 24bv32), 4294967169bv32) == ea) && !(~bvadd64(~bvlshr64(\old(b), 24bv32), 4294967041bv32) == 0bv32)) && a == \old(b))) || (0bv32 == \old(a) && b == \old(a))) || (((((((\exists addflt_~a : bv32 :: (ma == ~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~a)) && ~bvult64(\old(a), addflt_~a)) && ~bvadd64(~bvlshr64(addflt_~a, 24bv32), 4294967168bv32) == ea) && (\exists addflt_~delta~0 : bv32, addflt_~b : bv32, addflt_~a : bv32 :: ~bvlshr64(~bvadd64(~bvneg32(~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0))), ~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~a))), 1bv32) == ma)) && ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ea)) == mb) && b == \old(a)) && ~bvult64(\old(a), a)) && __retres10 == \old(b)) && a == \old(b))) || ((((~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b))), ~bvadd64(~bvlshr64(a, 24bv32), ~bvneg32(~bvadd64(~bvlshr64(\old(b), 24bv32), 4294967168bv32)), 4294967168bv32)) == mb && ~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32) == ea) && a == \old(a)) && b == \old(b)) && (((!~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a)) && !~bvult64(__retres10, \old(a))) && ((a == \old(b) && ((!~bvult64(a, b) && b == \old(a)) || (!~bvult64(a, b) && a == \old(a)))) || (b == \old(b) && ((!~bvult64(a, b) && b == \old(a)) || (!~bvult64(a, b) && a == \old(a)))))) || ((~bvadd64(__retres10, 1bv32) == 0bv32 && !(0bv32 == ~bvand64(33554432bv32, ma))) && ((a == \old(b) && ((!~bvult64(a, b) && b == \old(a)) || (!~bvult64(a, b) && a == \old(a)))) || (b == \old(b) && ((!~bvult64(a, b) && b == \old(a)) || (!~bvult64(a, b) && a == \old(a))))))))) || ((a == \old(a) && 0bv32 == \old(b)) && 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) && ~bvadd64(__retres10, 1bv32) == 0bv32) && !(0bv32 == ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ea)))) && ((a == \old(b) && ((!~bvult64(a, b) && b == \old(a)) || (!~bvult64(a, b) && a == \old(a)))) || (b == \old(b) && ((!~bvult64(a, b) && b == \old(a)) || (!~bvult64(a, b) && a == \old(a)))))) && ~bvult64(\old(a), a))) || ((((((\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))) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a))) && (\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))))) && ((a == \old(b) && ((!~bvult64(a, b) && b == \old(a)) || (!~bvult64(a, b) && a == \old(a)))) || (b == \old(b) && ((!~bvult64(a, b) && b == \old(a)) || (!~bvult64(a, b) && a == \old(a)))))))) && ((~bvugt32(\old(a), 0bv32) || (a == \old(a) && __retres10 == \old(a))) || (__retres10 == \old(b) && a == \old(b))) - 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, 188.7s OverallTime, 43 OverallIterations, 4 TraceHistogramMax, 59.3s AutomataDifference, 0.0s DeadEndRemovalTime, 102.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 4748 SDtfs, 2639 SDslu, 27800 SDs, 0 SdLazy, 7466 SolverSat, 414 SolverUnsat, 9 SolverUnknown, 0 SolverNotchecked, 29.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3841 GetRequests, 3343 SyntacticMatches, 28 SemanticMatches, 470 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 802 ImplicationChecksByTransitivity, 49.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=474occurred in iteration=13, 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, 43 MinimizatonAttempts, 1498 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 449 PreInvPairs, 554 NumberOfFragments, 3064 HoareAnnotationTreeSize, 449 FomulaSimplifications, 7021178 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 22 FomulaSimplificationsInter, 283440 FormulaSimplificationTreeSizeReductionInter, 102.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 23.2s InterpolantComputationTime, 3008 NumberOfCodeBlocks, 3008 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 3599 ConstructedInterpolants, 104 QuantifiedInterpolants, 655754 SizeOfPredicates, 269 NumberOfNonLiveVariables, 5210 ConjunctsInSsa, 493 ConjunctsInUnsatCore, 66 InterpolantComputations, 36 PerfectInterpolantSequences, 1196/1316 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...