./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/soft_float_5_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_e3a88c21-880e-4ab4-9d7d-c6fc0b138923/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e3a88c21-880e-4ab4-9d7d-c6fc0b138923/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e3a88c21-880e-4ab4-9d7d-c6fc0b138923/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e3a88c21-880e-4ab4-9d7d-c6fc0b138923/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/soft_float_5_true-unreach-call_true-no-overflow_true-termination.c.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_e3a88c21-880e-4ab4-9d7d-c6fc0b138923/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e3a88c21-880e-4ab4-9d7d-c6fc0b138923/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 12b1dd0058eac32d4e9fcabcf1e935c527e522e6 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 15:06:13,101 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 15:06:13,102 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 15:06:13,108 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 15:06:13,108 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 15:06:13,109 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 15:06:13,110 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 15:06:13,110 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 15:06:13,111 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 15:06:13,112 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 15:06:13,112 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 15:06:13,112 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 15:06:13,113 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 15:06:13,113 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 15:06:13,114 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 15:06:13,114 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 15:06:13,115 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 15:06:13,116 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 15:06:13,117 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 15:06:13,117 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 15:06:13,118 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 15:06:13,119 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 15:06:13,120 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 15:06:13,120 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 15:06:13,120 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 15:06:13,121 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 15:06:13,121 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 15:06:13,122 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 15:06:13,122 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 15:06:13,122 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 15:06:13,123 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 15:06:13,123 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 15:06:13,123 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 15:06:13,123 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 15:06:13,124 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 15:06:13,124 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 15:06:13,124 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e3a88c21-880e-4ab4-9d7d-c6fc0b138923/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-02 15:06:13,131 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 15:06:13,131 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 15:06:13,132 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 15:06:13,132 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 15:06:13,132 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 15:06:13,132 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 15:06:13,133 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 15:06:13,133 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 15:06:13,133 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 15:06:13,133 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 15:06:13,133 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 15:06:13,133 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 15:06:13,133 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 15:06:13,133 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 15:06:13,133 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 15:06:13,133 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 15:06:13,134 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 15:06:13,134 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 15:06:13,134 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 15:06:13,134 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 15:06:13,134 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 15:06:13,134 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 15:06:13,134 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 15:06:13,134 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 15:06:13,134 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 15:06:13,134 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 15:06:13,135 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 15:06:13,135 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 15:06:13,135 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 15:06:13,135 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 15:06:13,135 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_e3a88c21-880e-4ab4-9d7d-c6fc0b138923/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 12b1dd0058eac32d4e9fcabcf1e935c527e522e6 [2018-12-02 15:06:13,153 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 15:06:13,161 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 15:06:13,164 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 15:06:13,165 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 15:06:13,165 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 15:06:13,166 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e3a88c21-880e-4ab4-9d7d-c6fc0b138923/bin-2019/uautomizer/../../sv-benchmarks/c/bitvector/soft_float_5_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-12-02 15:06:13,206 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e3a88c21-880e-4ab4-9d7d-c6fc0b138923/bin-2019/uautomizer/data/50300554c/e64879e8e4724eb1b053da1d5ec2f6d8/FLAG12cb8c50c [2018-12-02 15:06:13,642 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 15:06:13,643 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e3a88c21-880e-4ab4-9d7d-c6fc0b138923/sv-benchmarks/c/bitvector/soft_float_5_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-12-02 15:06:13,647 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e3a88c21-880e-4ab4-9d7d-c6fc0b138923/bin-2019/uautomizer/data/50300554c/e64879e8e4724eb1b053da1d5ec2f6d8/FLAG12cb8c50c [2018-12-02 15:06:13,656 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e3a88c21-880e-4ab4-9d7d-c6fc0b138923/bin-2019/uautomizer/data/50300554c/e64879e8e4724eb1b053da1d5ec2f6d8 [2018-12-02 15:06:13,657 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 15:06:13,658 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 15:06:13,659 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 15:06:13,659 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 15:06:13,661 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 15:06:13,662 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:06:13" (1/1) ... [2018-12-02 15:06:13,663 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f49b694 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:06:13, skipping insertion in model container [2018-12-02 15:06:13,664 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:06:13" (1/1) ... [2018-12-02 15:06:13,668 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 15:06:13,686 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 15:06:13,795 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 15:06:13,797 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 15:06:13,820 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 15:06:13,828 INFO L195 MainTranslator]: Completed translation [2018-12-02 15:06:13,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:06:13 WrapperNode [2018-12-02 15:06:13,828 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 15:06:13,829 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 15:06:13,829 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 15:06:13,829 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 15:06:13,834 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:06:13" (1/1) ... [2018-12-02 15:06:13,838 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:06:13" (1/1) ... [2018-12-02 15:06:13,870 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 15:06:13,871 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 15:06:13,871 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 15:06:13,871 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 15:06:13,876 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:06:13" (1/1) ... [2018-12-02 15:06:13,876 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:06:13" (1/1) ... [2018-12-02 15:06:13,877 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:06:13" (1/1) ... [2018-12-02 15:06:13,878 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:06:13" (1/1) ... [2018-12-02 15:06:13,882 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:06:13" (1/1) ... [2018-12-02 15:06:13,885 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:06:13" (1/1) ... [2018-12-02 15:06:13,886 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:06:13" (1/1) ... [2018-12-02 15:06:13,887 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 15:06:13,887 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 15:06:13,887 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 15:06:13,887 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 15:06:13,888 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:06:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e3a88c21-880e-4ab4-9d7d-c6fc0b138923/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 15:06:13,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 15:06:13,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 15:06:13,918 INFO L130 BoogieDeclarations]: Found specification of procedure mulflt [2018-12-02 15:06:13,918 INFO L138 BoogieDeclarations]: Found implementation of procedure mulflt [2018-12-02 15:06:13,918 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2018-12-02 15:06:13,918 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2018-12-02 15:06:13,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 15:06:13,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 15:06:13,918 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 15:06:13,919 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 15:06:13,919 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-02 15:06:13,919 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-02 15:06:14,093 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 15:06:14,093 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-02 15:06:14,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:06:14 BoogieIcfgContainer [2018-12-02 15:06:14,094 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 15:06:14,094 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 15:06:14,094 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 15:06:14,096 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 15:06:14,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:06:13" (1/3) ... [2018-12-02 15:06:14,097 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d9f4172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:06:14, skipping insertion in model container [2018-12-02 15:06:14,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:06:13" (2/3) ... [2018-12-02 15:06:14,097 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d9f4172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:06:14, skipping insertion in model container [2018-12-02 15:06:14,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:06:14" (3/3) ... [2018-12-02 15:06:14,098 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_5_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-12-02 15:06:14,106 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 15:06:14,112 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 15:06:14,122 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 15:06:14,140 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 15:06:14,140 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 15:06:14,140 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 15:06:14,141 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 15:06:14,141 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 15:06:14,141 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 15:06:14,141 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 15:06:14,141 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 15:06:14,141 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 15:06:14,151 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-12-02 15:06:14,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 15:06:14,156 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:06:14,156 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:06:14,158 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:06:14,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:06:14,161 INFO L82 PathProgramCache]: Analyzing trace with hash -848954410, now seen corresponding path program 1 times [2018-12-02 15:06:14,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:06:14,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:06:14,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:06:14,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:06:14,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:06:14,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:06:14,277 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-02 15:06:14,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:06:14,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:06:14,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 15:06:14,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:06:14,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:06:14,290 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 3 states. [2018-12-02 15:06:14,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:06:14,315 INFO L93 Difference]: Finished difference Result 118 states and 174 transitions. [2018-12-02 15:06:14,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:06:14,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-12-02 15:06:14,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:06:14,322 INFO L225 Difference]: With dead ends: 118 [2018-12-02 15:06:14,322 INFO L226 Difference]: Without dead ends: 52 [2018-12-02 15:06:14,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:06:14,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-02 15:06:14,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-02 15:06:14,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-02 15:06:14,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 70 transitions. [2018-12-02 15:06:14,349 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 70 transitions. Word has length 48 [2018-12-02 15:06:14,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:06:14,351 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 70 transitions. [2018-12-02 15:06:14,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 15:06:14,351 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 70 transitions. [2018-12-02 15:06:14,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-02 15:06:14,352 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:06:14,352 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:06:14,352 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:06:14,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:06:14,353 INFO L82 PathProgramCache]: Analyzing trace with hash -796554308, now seen corresponding path program 1 times [2018-12-02 15:06:14,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:06:14,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:06:14,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:06:14,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:06:14,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:06:14,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:06:14,396 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-02 15:06:14,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:06:14,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 15:06:14,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 15:06:14,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 15:06:14,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 15:06:14,398 INFO L87 Difference]: Start difference. First operand 52 states and 70 transitions. Second operand 4 states. [2018-12-02 15:06:14,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:06:14,422 INFO L93 Difference]: Finished difference Result 64 states and 84 transitions. [2018-12-02 15:06:14,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 15:06:14,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-12-02 15:06:14,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:06:14,424 INFO L225 Difference]: With dead ends: 64 [2018-12-02 15:06:14,424 INFO L226 Difference]: Without dead ends: 52 [2018-12-02 15:06:14,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 15:06:14,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-02 15:06:14,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-02 15:06:14,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-02 15:06:14,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 69 transitions. [2018-12-02 15:06:14,428 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 69 transitions. Word has length 50 [2018-12-02 15:06:14,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:06:14,429 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 69 transitions. [2018-12-02 15:06:14,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 15:06:14,429 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 69 transitions. [2018-12-02 15:06:14,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-02 15:06:14,429 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:06:14,429 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:06:14,430 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:06:14,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:06:14,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1817622662, now seen corresponding path program 1 times [2018-12-02 15:06:14,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:06:14,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:06:14,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:06:14,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:06:14,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:06:14,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:06:14,474 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 15:06:14,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:06:14,474 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e3a88c21-880e-4ab4-9d7d-c6fc0b138923/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:06:14,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:06:14,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:06:14,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:06:14,559 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 15:06:14,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:06:14,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7] total 9 [2018-12-02 15:06:14,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 15:06:14,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 15:06:14,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-02 15:06:14,574 INFO L87 Difference]: Start difference. First operand 52 states and 69 transitions. Second operand 9 states. [2018-12-02 15:06:14,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:06:14,701 INFO L93 Difference]: Finished difference Result 147 states and 207 transitions. [2018-12-02 15:06:14,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 15:06:14,701 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-12-02 15:06:14,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:06:14,703 INFO L225 Difference]: With dead ends: 147 [2018-12-02 15:06:14,703 INFO L226 Difference]: Without dead ends: 103 [2018-12-02 15:06:14,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-02 15:06:14,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-02 15:06:14,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 82. [2018-12-02 15:06:14,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-02 15:06:14,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 112 transitions. [2018-12-02 15:06:14,714 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 112 transitions. Word has length 50 [2018-12-02 15:06:14,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:06:14,714 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 112 transitions. [2018-12-02 15:06:14,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 15:06:14,714 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 112 transitions. [2018-12-02 15:06:14,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 15:06:14,715 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:06:14,716 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 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] [2018-12-02 15:06:14,716 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:06:14,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:06:14,716 INFO L82 PathProgramCache]: Analyzing trace with hash -30301019, now seen corresponding path program 1 times [2018-12-02 15:06:14,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:06:14,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:06:14,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:06:14,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:06:14,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:06:14,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:06:14,738 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 15:06:14,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:06:14,739 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e3a88c21-880e-4ab4-9d7d-c6fc0b138923/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:06:14,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:06:14,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:06:14,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:06:14,769 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 15:06:14,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 15:06:14,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2018-12-02 15:06:14,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 15:06:14,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 15:06:14,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 15:06:14,791 INFO L87 Difference]: Start difference. First operand 82 states and 112 transitions. Second operand 4 states. [2018-12-02 15:06:14,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:06:14,839 INFO L93 Difference]: Finished difference Result 161 states and 225 transitions. [2018-12-02 15:06:14,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 15:06:14,840 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-12-02 15:06:14,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:06:14,841 INFO L225 Difference]: With dead ends: 161 [2018-12-02 15:06:14,841 INFO L226 Difference]: Without dead ends: 97 [2018-12-02 15:06:14,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 15:06:14,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-02 15:06:14,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 89. [2018-12-02 15:06:14,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-02 15:06:14,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 123 transitions. [2018-12-02 15:06:14,849 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 123 transitions. Word has length 55 [2018-12-02 15:06:14,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:06:14,850 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 123 transitions. [2018-12-02 15:06:14,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 15:06:14,850 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 123 transitions. [2018-12-02 15:06:14,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-02 15:06:14,851 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:06:14,851 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 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] [2018-12-02 15:06:14,851 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:06:14,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:06:14,852 INFO L82 PathProgramCache]: Analyzing trace with hash 410874573, now seen corresponding path program 1 times [2018-12-02 15:06:14,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:06:14,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:06:14,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:06:14,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:06:14,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:06:14,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:06:14,874 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 15:06:14,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:06:14,875 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e3a88c21-880e-4ab4-9d7d-c6fc0b138923/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:06:14,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:06:14,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:06:14,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:06:14,902 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 15:06:14,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 15:06:14,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2018-12-02 15:06:14,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 15:06:14,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 15:06:14,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 15:06:14,917 INFO L87 Difference]: Start difference. First operand 89 states and 123 transitions. Second operand 4 states. [2018-12-02 15:06:14,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:06:14,951 INFO L93 Difference]: Finished difference Result 175 states and 249 transitions. [2018-12-02 15:06:14,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 15:06:14,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-12-02 15:06:14,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:06:14,952 INFO L225 Difference]: With dead ends: 175 [2018-12-02 15:06:14,953 INFO L226 Difference]: Without dead ends: 106 [2018-12-02 15:06:14,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 15:06:14,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-02 15:06:14,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 95. [2018-12-02 15:06:14,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-02 15:06:14,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 132 transitions. [2018-12-02 15:06:14,962 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 132 transitions. Word has length 56 [2018-12-02 15:06:14,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:06:14,962 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 132 transitions. [2018-12-02 15:06:14,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 15:06:14,962 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 132 transitions. [2018-12-02 15:06:14,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-02 15:06:14,963 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:06:14,963 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 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] [2018-12-02 15:06:14,963 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:06:14,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:06:14,964 INFO L82 PathProgramCache]: Analyzing trace with hash -227603191, now seen corresponding path program 1 times [2018-12-02 15:06:14,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:06:14,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:06:14,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:06:14,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:06:14,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:06:14,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:06:15,017 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 15:06:15,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:06:15,018 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e3a88c21-880e-4ab4-9d7d-c6fc0b138923/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:06:15,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:06:15,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:06:15,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:06:15,070 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-02 15:06:15,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 15:06:15,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2018-12-02 15:06:15,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 15:06:15,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 15:06:15,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-02 15:06:15,085 INFO L87 Difference]: Start difference. First operand 95 states and 132 transitions. Second operand 9 states. [2018-12-02 15:06:15,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:06:15,235 INFO L93 Difference]: Finished difference Result 185 states and 263 transitions. [2018-12-02 15:06:15,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 15:06:15,236 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2018-12-02 15:06:15,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:06:15,237 INFO L225 Difference]: With dead ends: 185 [2018-12-02 15:06:15,237 INFO L226 Difference]: Without dead ends: 99 [2018-12-02 15:06:15,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-12-02 15:06:15,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-02 15:06:15,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 87. [2018-12-02 15:06:15,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-02 15:06:15,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 117 transitions. [2018-12-02 15:06:15,244 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 117 transitions. Word has length 56 [2018-12-02 15:06:15,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:06:15,244 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 117 transitions. [2018-12-02 15:06:15,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 15:06:15,244 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 117 transitions. [2018-12-02 15:06:15,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-02 15:06:15,245 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:06:15,245 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:06:15,245 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:06:15,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:06:15,246 INFO L82 PathProgramCache]: Analyzing trace with hash 743896390, now seen corresponding path program 1 times [2018-12-02 15:06:15,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:06:15,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:06:15,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:06:15,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:06:15,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:06:15,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:06:15,298 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 15:06:15,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:06:15,298 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e3a88c21-880e-4ab4-9d7d-c6fc0b138923/bin-2019/uautomizer/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-02 15:06:15,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:06:15,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:06:15,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:06:15,389 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 15:06:15,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:06:15,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10] total 12 [2018-12-02 15:06:15,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 15:06:15,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 15:06:15,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-12-02 15:06:15,408 INFO L87 Difference]: Start difference. First operand 87 states and 117 transitions. Second operand 12 states. [2018-12-02 15:06:15,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:06:15,746 INFO L93 Difference]: Finished difference Result 190 states and 258 transitions. [2018-12-02 15:06:15,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-02 15:06:15,746 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2018-12-02 15:06:15,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:06:15,747 INFO L225 Difference]: With dead ends: 190 [2018-12-02 15:06:15,747 INFO L226 Difference]: Without dead ends: 113 [2018-12-02 15:06:15,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2018-12-02 15:06:15,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-02 15:06:15,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 79. [2018-12-02 15:06:15,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-02 15:06:15,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 103 transitions. [2018-12-02 15:06:15,755 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 103 transitions. Word has length 57 [2018-12-02 15:06:15,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:06:15,755 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 103 transitions. [2018-12-02 15:06:15,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 15:06:15,755 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 103 transitions. [2018-12-02 15:06:15,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-02 15:06:15,756 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:06:15,756 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 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] [2018-12-02 15:06:15,756 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:06:15,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:06:15,756 INFO L82 PathProgramCache]: Analyzing trace with hash 2063636268, now seen corresponding path program 1 times [2018-12-02 15:06:15,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:06:15,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:06:15,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:06:15,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:06:15,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:06:15,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:06:15,778 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 15:06:15,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:06:15,778 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e3a88c21-880e-4ab4-9d7d-c6fc0b138923/bin-2019/uautomizer/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-02 15:06:15,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:06:15,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:06:15,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:06:15,810 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 15:06:15,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:06:15,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-12-02 15:06:15,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 15:06:15,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 15:06:15,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 15:06:15,825 INFO L87 Difference]: Start difference. First operand 79 states and 103 transitions. Second operand 5 states. [2018-12-02 15:06:15,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:06:15,875 INFO L93 Difference]: Finished difference Result 157 states and 206 transitions. [2018-12-02 15:06:15,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 15:06:15,876 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2018-12-02 15:06:15,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:06:15,877 INFO L225 Difference]: With dead ends: 157 [2018-12-02 15:06:15,877 INFO L226 Difference]: Without dead ends: 88 [2018-12-02 15:06:15,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 15:06:15,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-02 15:06:15,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. [2018-12-02 15:06:15,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-02 15:06:15,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 106 transitions. [2018-12-02 15:06:15,887 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 106 transitions. Word has length 58 [2018-12-02 15:06:15,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:06:15,887 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 106 transitions. [2018-12-02 15:06:15,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 15:06:15,887 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 106 transitions. [2018-12-02 15:06:15,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 15:06:15,888 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:06:15,888 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:06:15,889 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:06:15,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:06:15,889 INFO L82 PathProgramCache]: Analyzing trace with hash -2121428149, now seen corresponding path program 1 times [2018-12-02 15:06:15,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:06:15,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:06:15,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:06:15,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:06:15,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:06:15,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:06:15,949 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 15:06:15,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:06:15,950 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e3a88c21-880e-4ab4-9d7d-c6fc0b138923/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:06:15,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:06:15,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:06:15,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:06:16,022 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-02 15:06:16,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:06:16,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 11 [2018-12-02 15:06:16,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 15:06:16,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 15:06:16,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-12-02 15:06:16,038 INFO L87 Difference]: Start difference. First operand 81 states and 106 transitions. Second operand 11 states. [2018-12-02 15:06:16,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:06:16,239 INFO L93 Difference]: Finished difference Result 183 states and 241 transitions. [2018-12-02 15:06:16,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 15:06:16,239 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2018-12-02 15:06:16,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:06:16,240 INFO L225 Difference]: With dead ends: 183 [2018-12-02 15:06:16,240 INFO L226 Difference]: Without dead ends: 97 [2018-12-02 15:06:16,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-12-02 15:06:16,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-02 15:06:16,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 73. [2018-12-02 15:06:16,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-02 15:06:16,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 92 transitions. [2018-12-02 15:06:16,249 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 92 transitions. Word has length 60 [2018-12-02 15:06:16,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:06:16,250 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 92 transitions. [2018-12-02 15:06:16,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 15:06:16,250 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 92 transitions. [2018-12-02 15:06:16,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 15:06:16,251 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:06:16,251 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 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] [2018-12-02 15:06:16,251 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:06:16,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:06:16,251 INFO L82 PathProgramCache]: Analyzing trace with hash 812533343, now seen corresponding path program 1 times [2018-12-02 15:06:16,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:06:16,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:06:16,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:06:16,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:06:16,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:06:16,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:06:16,290 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 15:06:16,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:06:16,291 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e3a88c21-880e-4ab4-9d7d-c6fc0b138923/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:06:16,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:06:16,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:06:16,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:06:16,317 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 25 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 15:06:16,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:06:16,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-12-02 15:06:16,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 15:06:16,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 15:06:16,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 15:06:16,333 INFO L87 Difference]: Start difference. First operand 73 states and 92 transitions. Second operand 6 states. [2018-12-02 15:06:16,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:06:16,401 INFO L93 Difference]: Finished difference Result 152 states and 191 transitions. [2018-12-02 15:06:16,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 15:06:16,402 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-02 15:06:16,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:06:16,402 INFO L225 Difference]: With dead ends: 152 [2018-12-02 15:06:16,403 INFO L226 Difference]: Without dead ends: 89 [2018-12-02 15:06:16,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-02 15:06:16,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-02 15:06:16,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 75. [2018-12-02 15:06:16,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-02 15:06:16,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 95 transitions. [2018-12-02 15:06:16,411 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 95 transitions. Word has length 66 [2018-12-02 15:06:16,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:06:16,411 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 95 transitions. [2018-12-02 15:06:16,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 15:06:16,412 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 95 transitions. [2018-12-02 15:06:16,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-02 15:06:16,412 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:06:16,412 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1] [2018-12-02 15:06:16,413 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:06:16,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:06:16,413 INFO L82 PathProgramCache]: Analyzing trace with hash 151306208, now seen corresponding path program 1 times [2018-12-02 15:06:16,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:06:16,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:06:16,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:06:16,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:06:16,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:06:16,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:06:16,475 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 15:06:16,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:06:16,475 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e3a88c21-880e-4ab4-9d7d-c6fc0b138923/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:06:16,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:06:16,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:06:16,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:06:16,587 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-02 15:06:16,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:06:16,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 15 [2018-12-02 15:06:16,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-02 15:06:16,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-02 15:06:16,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2018-12-02 15:06:16,604 INFO L87 Difference]: Start difference. First operand 75 states and 95 transitions. Second operand 15 states. [2018-12-02 15:06:17,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:06:17,032 INFO L93 Difference]: Finished difference Result 191 states and 248 transitions. [2018-12-02 15:06:17,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-02 15:06:17,032 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 68 [2018-12-02 15:06:17,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:06:17,033 INFO L225 Difference]: With dead ends: 191 [2018-12-02 15:06:17,033 INFO L226 Difference]: Without dead ends: 126 [2018-12-02 15:06:17,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=845, Unknown=0, NotChecked=0, Total=992 [2018-12-02 15:06:17,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-12-02 15:06:17,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 93. [2018-12-02 15:06:17,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-02 15:06:17,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 121 transitions. [2018-12-02 15:06:17,044 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 121 transitions. Word has length 68 [2018-12-02 15:06:17,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:06:17,044 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 121 transitions. [2018-12-02 15:06:17,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-02 15:06:17,044 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 121 transitions. [2018-12-02 15:06:17,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-02 15:06:17,045 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:06:17,045 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:06:17,045 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:06:17,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:06:17,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1869856774, now seen corresponding path program 1 times [2018-12-02 15:06:17,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:06:17,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:06:17,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:06:17,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:06:17,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:06:17,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:06:17,095 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 15:06:17,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:06:17,096 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e3a88c21-880e-4ab4-9d7d-c6fc0b138923/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:06:17,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:06:17,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:06:17,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:06:17,124 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 25 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 15:06:17,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:06:17,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-12-02 15:06:17,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 15:06:17,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 15:06:17,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-02 15:06:17,139 INFO L87 Difference]: Start difference. First operand 93 states and 121 transitions. Second operand 7 states. [2018-12-02 15:06:17,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:06:17,197 INFO L93 Difference]: Finished difference Result 199 states and 260 transitions. [2018-12-02 15:06:17,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 15:06:17,198 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2018-12-02 15:06:17,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:06:17,198 INFO L225 Difference]: With dead ends: 199 [2018-12-02 15:06:17,199 INFO L226 Difference]: Without dead ends: 116 [2018-12-02 15:06:17,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-12-02 15:06:17,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-02 15:06:17,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 95. [2018-12-02 15:06:17,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-02 15:06:17,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 124 transitions. [2018-12-02 15:06:17,214 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 124 transitions. Word has length 69 [2018-12-02 15:06:17,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:06:17,214 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 124 transitions. [2018-12-02 15:06:17,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 15:06:17,214 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 124 transitions. [2018-12-02 15:06:17,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-02 15:06:17,215 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:06:17,215 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:06:17,215 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:06:17,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:06:17,216 INFO L82 PathProgramCache]: Analyzing trace with hash -336734405, now seen corresponding path program 1 times [2018-12-02 15:06:17,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:06:17,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:06:17,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:06:17,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:06:17,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:06:17,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:06:17,269 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 15:06:17,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:06:17,270 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e3a88c21-880e-4ab4-9d7d-c6fc0b138923/bin-2019/uautomizer/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-02 15:06:17,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:06:17,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:06:17,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:06:17,401 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-02 15:06:17,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:06:17,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 16 [2018-12-02 15:06:17,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-02 15:06:17,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-02 15:06:17,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-12-02 15:06:17,425 INFO L87 Difference]: Start difference. First operand 95 states and 124 transitions. Second operand 16 states. [2018-12-02 15:06:17,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:06:17,849 INFO L93 Difference]: Finished difference Result 218 states and 285 transitions. [2018-12-02 15:06:17,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-02 15:06:17,849 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 71 [2018-12-02 15:06:17,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:06:17,850 INFO L225 Difference]: With dead ends: 218 [2018-12-02 15:06:17,850 INFO L226 Difference]: Without dead ends: 127 [2018-12-02 15:06:17,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2018-12-02 15:06:17,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-02 15:06:17,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 99. [2018-12-02 15:06:17,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-02 15:06:17,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 129 transitions. [2018-12-02 15:06:17,863 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 129 transitions. Word has length 71 [2018-12-02 15:06:17,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:06:17,863 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 129 transitions. [2018-12-02 15:06:17,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-02 15:06:17,863 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 129 transitions. [2018-12-02 15:06:17,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-02 15:06:17,864 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:06:17,864 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:06:17,864 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:06:17,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:06:17,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1685507205, now seen corresponding path program 1 times [2018-12-02 15:06:17,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:06:17,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:06:17,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:06:17,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:06:17,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:06:17,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:06:17,903 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 4 proven. 35 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 15:06:17,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:06:17,904 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e3a88c21-880e-4ab4-9d7d-c6fc0b138923/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:06:17,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:06:17,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:06:17,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:06:17,927 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 25 proven. 26 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 15:06:17,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:06:17,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-12-02 15:06:17,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 15:06:17,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 15:06:17,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-12-02 15:06:17,953 INFO L87 Difference]: Start difference. First operand 99 states and 129 transitions. Second operand 8 states. [2018-12-02 15:06:18,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:06:18,057 INFO L93 Difference]: Finished difference Result 218 states and 285 transitions. [2018-12-02 15:06:18,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 15:06:18,057 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 72 [2018-12-02 15:06:18,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:06:18,058 INFO L225 Difference]: With dead ends: 218 [2018-12-02 15:06:18,058 INFO L226 Difference]: Without dead ends: 129 [2018-12-02 15:06:18,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2018-12-02 15:06:18,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-12-02 15:06:18,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 101. [2018-12-02 15:06:18,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-02 15:06:18,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 132 transitions. [2018-12-02 15:06:18,066 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 132 transitions. Word has length 72 [2018-12-02 15:06:18,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:06:18,066 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 132 transitions. [2018-12-02 15:06:18,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 15:06:18,066 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 132 transitions. [2018-12-02 15:06:18,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-02 15:06:18,067 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:06:18,067 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:06:18,067 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:06:18,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:06:18,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1387490822, now seen corresponding path program 1 times [2018-12-02 15:06:18,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:06:18,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:06:18,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:06:18,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:06:18,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:06:18,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:06:18,134 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 4 proven. 40 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 15:06:18,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:06:18,134 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e3a88c21-880e-4ab4-9d7d-c6fc0b138923/bin-2019/uautomizer/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-02 15:06:18,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:06:18,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:06:18,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:06:18,253 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-12-02 15:06:18,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:06:18,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2018-12-02 15:06:18,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-02 15:06:18,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-02 15:06:18,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-12-02 15:06:18,268 INFO L87 Difference]: Start difference. First operand 101 states and 132 transitions. Second operand 16 states. [2018-12-02 15:06:18,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:06:18,633 INFO L93 Difference]: Finished difference Result 215 states and 283 transitions. [2018-12-02 15:06:18,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-02 15:06:18,634 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 74 [2018-12-02 15:06:18,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:06:18,634 INFO L225 Difference]: With dead ends: 215 [2018-12-02 15:06:18,634 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 15:06:18,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=562, Unknown=0, NotChecked=0, Total=650 [2018-12-02 15:06:18,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 15:06:18,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 15:06:18,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 15:06:18,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 15:06:18,636 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 74 [2018-12-02 15:06:18,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:06:18,636 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 15:06:18,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-02 15:06:18,636 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 15:06:18,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 15:06:18,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-02 15:06:21,437 WARN L180 SmtUtils]: Spent 2.28 s on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2018-12-02 15:06:21,580 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 22 [2018-12-02 15:06:21,591 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-02 15:06:21,591 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-02 15:06:21,591 INFO L448 ceAbstractionStarter]: For program point mulfltEXIT(lines 137 209) no Hoare annotation was computed. [2018-12-02 15:06:21,592 INFO L448 ceAbstractionStarter]: For program point L184(lines 184 201) no Hoare annotation was computed. [2018-12-02 15:06:21,592 INFO L448 ceAbstractionStarter]: For program point L184-2(lines 184 201) no Hoare annotation was computed. [2018-12-02 15:06:21,592 INFO L448 ceAbstractionStarter]: For program point L193(lines 193 198) no Hoare annotation was computed. [2018-12-02 15:06:21,592 INFO L448 ceAbstractionStarter]: For program point mulfltFINAL(lines 137 209) no Hoare annotation was computed. [2018-12-02 15:06:21,592 INFO L451 ceAbstractionStarter]: At program point mulfltENTRY(lines 137 209) the Hoare annotation is: true [2018-12-02 15:06:21,592 INFO L448 ceAbstractionStarter]: For program point L185(lines 185 190) no Hoare annotation was computed. [2018-12-02 15:06:21,592 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 154) no Hoare annotation was computed. [2018-12-02 15:06:21,592 INFO L448 ceAbstractionStarter]: For program point L148-2(lines 147 208) no Hoare annotation was computed. [2018-12-02 15:06:21,592 INFO L448 ceAbstractionStarter]: For program point L175(lines 175 180) no Hoare annotation was computed. [2018-12-02 15:06:21,592 INFO L444 ceAbstractionStarter]: At program point L206(lines 147 208) the Hoare annotation is: (let ((.cse0 (exists ((v_mulflt_~a_6 Int)) (< (mod v_mulflt_~a_6 4294967296) (mod |mulflt_#in~b| 4294967296)))) (.cse2 (= mulflt_~b |mulflt_#in~b|)) (.cse1 (= 0 mulflt_~__retres10~1))) (or (and .cse0 .cse1) (and .cse0 (= mulflt_~b |mulflt_#in~a|) (not (= (mod |mulflt_#in~a| 4294967296) 0))) (and (= mulflt_~a |mulflt_#in~a|) .cse2 (not (= 0 (mod |mulflt_#in~b| 4294967296)))) (and .cse2 .cse1))) [2018-12-02 15:06:21,592 INFO L448 ceAbstractionStarter]: For program point L169(lines 169 174) no Hoare annotation was computed. [2018-12-02 15:06:21,592 INFO L448 ceAbstractionStarter]: For program point L19(lines 19 24) no Hoare annotation was computed. [2018-12-02 15:06:21,593 INFO L448 ceAbstractionStarter]: For program point L48(lines 47 62) no Hoare annotation was computed. [2018-12-02 15:06:21,593 INFO L444 ceAbstractionStarter]: At program point L69(lines 18 71) the Hoare annotation is: (let ((.cse0 (<= |base2flt_#in~e| base2flt_~e)) (.cse1 (<= base2flt_~e |base2flt_#in~e|))) (or (and (= 0 base2flt_~__retres4~0) .cse0 (= base2flt_~m |base2flt_#in~m|) .cse1) (or (<= (+ |base2flt_#in~m| 4261412865) 0) (<= 16777216 |base2flt_#in~m|)) (and .cse0 (<= (+ |base2flt_#in~e| 128) 0)) (and (<= 127 |base2flt_#in~e|) .cse1) (forall ((base2flt_~m Int)) (or (< base2flt_~m |base2flt_#in~m|) (< |base2flt_#in~m| base2flt_~m) (< 0 (mod base2flt_~m 4294967296)))))) [2018-12-02 15:06:21,593 INFO L448 ceAbstractionStarter]: For program point L28(lines 27 42) no Hoare annotation was computed. [2018-12-02 15:06:21,593 INFO L448 ceAbstractionStarter]: For program point L49(lines 47 62) no Hoare annotation was computed. [2018-12-02 15:06:21,593 INFO L448 ceAbstractionStarter]: For program point L37(lines 37 41) no Hoare annotation was computed. [2018-12-02 15:06:21,593 INFO L444 ceAbstractionStarter]: At program point L37-1(lines 27 42) the Hoare annotation is: (and (forall ((base2flt_~m Int)) (or (< base2flt_~m |base2flt_#in~m|) (< |base2flt_#in~m| base2flt_~m) (< 0 (mod base2flt_~m 4294967296)))) (<= base2flt_~e |base2flt_#in~e|)) [2018-12-02 15:06:21,593 INFO L448 ceAbstractionStarter]: For program point L25(lines 25 65) no Hoare annotation was computed. [2018-12-02 15:06:21,593 INFO L451 ceAbstractionStarter]: At program point base2fltENTRY(lines 14 72) the Hoare annotation is: true [2018-12-02 15:06:21,593 INFO L448 ceAbstractionStarter]: For program point base2fltFINAL(lines 14 72) no Hoare annotation was computed. [2018-12-02 15:06:21,593 INFO L444 ceAbstractionStarter]: At program point L63(lines 25 65) the Hoare annotation is: (or (let ((.cse1 (div base2flt_~m 4294967296))) (let ((.cse0 (+ .cse1 1))) (and (or (<= |base2flt_#in~m| base2flt_~m) (< 0 .cse0)) (or (<= .cse0 0) (<= (+ (* 4294967296 .cse1) 16777216) |base2flt_#in~m|))))) (forall ((base2flt_~m Int)) (or (< base2flt_~m |base2flt_#in~m|) (< |base2flt_#in~m| base2flt_~m) (< 0 (mod base2flt_~m 4294967296))))) [2018-12-02 15:06:21,593 INFO L448 ceAbstractionStarter]: For program point base2fltEXIT(lines 14 72) no Hoare annotation was computed. [2018-12-02 15:06:21,594 INFO L444 ceAbstractionStarter]: At program point L47-2(lines 47 62) the Hoare annotation is: (let ((.cse2 (div base2flt_~m 4294967296))) (let ((.cse0 (+ .cse2 1))) (let ((.cse1 (<= .cse0 0))) (and (<= |base2flt_#in~e| base2flt_~e) (or (<= |base2flt_#in~m| base2flt_~m) (< 0 .cse0)) (or .cse1 (<= (+ (* 4294967296 .cse2) 16777216) |base2flt_#in~m|)) (or (<= base2flt_~m |base2flt_#in~m|) .cse1))))) [2018-12-02 15:06:21,594 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-02 15:06:21,594 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-02 15:06:21,594 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-02 15:06:21,594 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-02 15:06:21,594 INFO L448 ceAbstractionStarter]: For program point L250(lines 250 254) no Hoare annotation was computed. [2018-12-02 15:06:21,594 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 210 266) no Hoare annotation was computed. [2018-12-02 15:06:21,594 INFO L448 ceAbstractionStarter]: For program point L250-2(lines 250 254) no Hoare annotation was computed. [2018-12-02 15:06:21,594 INFO L448 ceAbstractionStarter]: For program point L246(lines 246 262) no Hoare annotation was computed. [2018-12-02 15:06:21,594 INFO L448 ceAbstractionStarter]: For program point L246-1(lines 246 262) no Hoare annotation was computed. [2018-12-02 15:06:21,594 INFO L448 ceAbstractionStarter]: For program point L244(line 244) no Hoare annotation was computed. [2018-12-02 15:06:21,594 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 210 266) no Hoare annotation was computed. [2018-12-02 15:06:21,594 INFO L448 ceAbstractionStarter]: For program point L236(lines 236 240) no Hoare annotation was computed. [2018-12-02 15:06:21,594 INFO L448 ceAbstractionStarter]: For program point L236-2(lines 236 240) no Hoare annotation was computed. [2018-12-02 15:06:21,594 INFO L444 ceAbstractionStarter]: At program point L230(line 230) the Hoare annotation is: (= 0 main_~zero~0) [2018-12-02 15:06:21,595 INFO L448 ceAbstractionStarter]: For program point L230-1(line 230) no Hoare annotation was computed. [2018-12-02 15:06:21,595 INFO L451 ceAbstractionStarter]: At program point L228(line 228) the Hoare annotation is: true [2018-12-02 15:06:21,595 INFO L448 ceAbstractionStarter]: For program point L228-1(line 228) no Hoare annotation was computed. [2018-12-02 15:06:21,595 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 210 266) the Hoare annotation is: true [2018-12-02 15:06:21,595 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 256) no Hoare annotation was computed. [2018-12-02 15:06:21,595 INFO L444 ceAbstractionStarter]: At program point L247-2(lines 247 256) the Hoare annotation is: (and (= main_~tmp___1~0 0) (= main_~tmp___0~0 0)) [2018-12-02 15:06:21,595 INFO L448 ceAbstractionStarter]: For program point L233(lines 233 242) no Hoare annotation was computed. [2018-12-02 15:06:21,595 INFO L444 ceAbstractionStarter]: At program point L231(line 231) the Hoare annotation is: (= 0 main_~zero~0) [2018-12-02 15:06:21,595 INFO L444 ceAbstractionStarter]: At program point L233-2(lines 233 242) the Hoare annotation is: (or (<= (+ main_~sb~0 1) 0) (and (<= (mod main_~b~0 4294967296) 0) (= 0 main_~zero~0)) (and (<= 1 main_~tmp~2) (<= 1 main_~sb~0))) [2018-12-02 15:06:21,595 INFO L448 ceAbstractionStarter]: For program point L231-1(line 231) no Hoare annotation was computed. [2018-12-02 15:06:21,595 INFO L444 ceAbstractionStarter]: At program point L229(line 229) the Hoare annotation is: (= 0 main_~zero~0) [2018-12-02 15:06:21,595 INFO L448 ceAbstractionStarter]: For program point L229-1(line 229) no Hoare annotation was computed. [2018-12-02 15:06:21,595 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2018-12-02 15:06:21,595 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 5 10) no Hoare annotation was computed. [2018-12-02 15:06:21,596 INFO L448 ceAbstractionStarter]: For program point L7(line 7) no Hoare annotation was computed. [2018-12-02 15:06:21,596 INFO L448 ceAbstractionStarter]: For program point L6(lines 6 8) no Hoare annotation was computed. [2018-12-02 15:06:21,596 INFO L448 ceAbstractionStarter]: For program point L6-2(lines 5 10) no Hoare annotation was computed. [2018-12-02 15:06:21,596 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) no Hoare annotation was computed. [2018-12-02 15:06:21,600 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-12-02 15:06:21,601 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-12-02 15:06:21,601 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-12-02 15:06:21,607 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-12-02 15:06:21,607 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-12-02 15:06:21,607 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-12-02 15:06:21,608 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-12-02 15:06:21,609 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-12-02 15:06:21,609 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-12-02 15:06:21,609 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-12-02 15:06:21,609 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-12-02 15:06:21,609 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-12-02 15:06:21,610 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_mulflt_~a_6,QUANTIFIED] [2018-12-02 15:06:21,611 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_mulflt_~a_6,QUANTIFIED] [2018-12-02 15:06:21,611 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_mulflt_~a_6,QUANTIFIED] [2018-12-02 15:06:21,611 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_mulflt_~a_6,QUANTIFIED] [2018-12-02 15:06:21,612 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-12-02 15:06:21,612 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-12-02 15:06:21,612 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-12-02 15:06:21,613 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-12-02 15:06:21,613 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-12-02 15:06:21,613 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-12-02 15:06:21,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 03:06:21 BoogieIcfgContainer [2018-12-02 15:06:21,614 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 15:06:21,615 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 15:06:21,615 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 15:06:21,615 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 15:06:21,615 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:06:14" (3/4) ... [2018-12-02 15:06:21,618 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 15:06:21,622 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 15:06:21,622 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure mulflt [2018-12-02 15:06:21,622 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure base2flt [2018-12-02 15:06:21,622 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 15:06:21,622 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-12-02 15:06:21,626 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2018-12-02 15:06:21,626 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-02 15:06:21,626 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 15:06:21,643 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((0 == __retres4 && \old(e) <= e) && m == \old(m)) && e <= \old(e)) || \old(m) + 4261412865 <= 0 || 16777216 <= \old(m)) || (\old(e) <= e && \old(e) + 128 <= 0)) || (127 <= \old(e) && e <= \old(e))) || (forall base2flt_~m : int :: (base2flt_~m < \old(m) || \old(m) < base2flt_~m) || 0 < base2flt_~m % 4294967296) [2018-12-02 15:06:21,643 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (forall base2flt_~m : int :: (base2flt_~m < \old(m) || \old(m) < base2flt_~m) || 0 < base2flt_~m % 4294967296) && e <= \old(e) [2018-12-02 15:06:21,643 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(e) <= e && (\old(m) <= m || 0 < m / 4294967296 + 1)) && (m / 4294967296 + 1 <= 0 || 4294967296 * (m / 4294967296) + 16777216 <= \old(m))) && (m <= \old(m) || m / 4294967296 + 1 <= 0) [2018-12-02 15:06:21,643 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(m) <= m || 0 < m / 4294967296 + 1) && (m / 4294967296 + 1 <= 0 || 4294967296 * (m / 4294967296) + 16777216 <= \old(m))) || (forall base2flt_~m : int :: (base2flt_~m < \old(m) || \old(m) < base2flt_~m) || 0 < base2flt_~m % 4294967296) [2018-12-02 15:06:21,644 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\exists v_mulflt_~a_6 : int :: v_mulflt_~a_6 % 4294967296 < \old(b) % 4294967296) && 0 == __retres10) || (((\exists v_mulflt_~a_6 : int :: v_mulflt_~a_6 % 4294967296 < \old(b) % 4294967296) && b == \old(a)) && !(\old(a) % 4294967296 == 0))) || ((a == \old(a) && b == \old(b)) && !(0 == \old(b) % 4294967296))) || (b == \old(b) && 0 == __retres10) [2018-12-02 15:06:21,660 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_e3a88c21-880e-4ab4-9d7d-c6fc0b138923/bin-2019/uautomizer/witness.graphml [2018-12-02 15:06:21,660 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 15:06:21,661 INFO L168 Benchmark]: Toolchain (without parser) took 8003.05 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 308.8 MB). Free memory was 962.4 MB in the beginning and 1.1 GB in the end (delta: -117.8 MB). Peak memory consumption was 191.0 MB. Max. memory is 11.5 GB. [2018-12-02 15:06:21,661 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 15:06:21,661 INFO L168 Benchmark]: CACSL2BoogieTranslator took 169.38 ms. Allocated memory is still 1.0 GB. Free memory was 962.4 MB in the beginning and 946.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-02 15:06:21,662 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -175.5 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2018-12-02 15:06:21,662 INFO L168 Benchmark]: Boogie Preprocessor took 16.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-02 15:06:21,662 INFO L168 Benchmark]: RCFGBuilder took 206.54 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: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2018-12-02 15:06:21,663 INFO L168 Benchmark]: TraceAbstraction took 7520.28 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 181.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.8 MB). Peak memory consumption was 461.1 MB. Max. memory is 11.5 GB. [2018-12-02 15:06:21,663 INFO L168 Benchmark]: Witness Printer took 45.58 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-02 15:06:21,664 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 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 169.38 ms. Allocated memory is still 1.0 GB. Free memory was 962.4 MB in the beginning and 946.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 41.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -175.5 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 206.54 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: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7520.28 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 181.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.8 MB). Peak memory consumption was 461.1 MB. Max. memory is 11.5 GB. * Witness Printer took 45.58 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.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_mulflt_~a_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_mulflt_~a_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_mulflt_~a_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_mulflt_~a_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,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 [2018-12-02 15:06:21,667 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-12-02 15:06:21,667 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-12-02 15:06:21,667 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-12-02 15:06:21,668 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-12-02 15:06:21,668 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-12-02 15:06:21,668 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] Derived loop invariant: ((\old(m) <= m || 0 < m / 4294967296 + 1) && (m / 4294967296 + 1 <= 0 || 4294967296 * (m / 4294967296) + 16777216 <= \old(m))) || (forall base2flt_~m : int :: (base2flt_~m < \old(m) || \old(m) < base2flt_~m) || 0 < base2flt_~m % 4294967296) - InvariantResult [Line: 18]: Loop Invariant [2018-12-02 15:06:21,668 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-12-02 15:06:21,668 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-12-02 15:06:21,669 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-12-02 15:06:21,669 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-12-02 15:06:21,669 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-12-02 15:06:21,669 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] Derived loop invariant: ((((((0 == __retres4 && \old(e) <= e) && m == \old(m)) && e <= \old(e)) || \old(m) + 4261412865 <= 0 || 16777216 <= \old(m)) || (\old(e) <= e && \old(e) + 128 <= 0)) || (127 <= \old(e) && e <= \old(e))) || (forall base2flt_~m : int :: (base2flt_~m < \old(m) || \old(m) < base2flt_~m) || 0 < base2flt_~m % 4294967296) - InvariantResult [Line: 147]: Loop Invariant [2018-12-02 15:06:21,669 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_mulflt_~a_6,QUANTIFIED] [2018-12-02 15:06:21,670 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_mulflt_~a_6,QUANTIFIED] [2018-12-02 15:06:21,670 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_mulflt_~a_6,QUANTIFIED] [2018-12-02 15:06:21,670 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_mulflt_~a_6,QUANTIFIED] Derived loop invariant: ((((\exists v_mulflt_~a_6 : int :: v_mulflt_~a_6 % 4294967296 < \old(b) % 4294967296) && 0 == __retres10) || (((\exists v_mulflt_~a_6 : int :: v_mulflt_~a_6 % 4294967296 < \old(b) % 4294967296) && b == \old(a)) && !(\old(a) % 4294967296 == 0))) || ((a == \old(a) && b == \old(b)) && !(0 == \old(b) % 4294967296))) || (b == \old(b) && 0 == __retres10) - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: ((\old(e) <= e && (\old(m) <= m || 0 < m / 4294967296 + 1)) && (m / 4294967296 + 1 <= 0 || 4294967296 * (m / 4294967296) + 16777216 <= \old(m))) && (m <= \old(m) || m / 4294967296 + 1 <= 0) - InvariantResult [Line: 27]: Loop Invariant [2018-12-02 15:06:21,671 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-12-02 15:06:21,671 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-12-02 15:06:21,671 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-12-02 15:06:21,671 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-12-02 15:06:21,671 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-12-02 15:06:21,671 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] Derived loop invariant: (forall base2flt_~m : int :: (base2flt_~m < \old(m) || \old(m) < base2flt_~m) || 0 < base2flt_~m % 4294967296) && e <= \old(e) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 59 locations, 1 error locations. SAFE Result, 7.4s OverallTime, 15 OverallIterations, 5 TraceHistogramMax, 2.4s AutomataDifference, 0.0s DeadEndRemovalTime, 2.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 942 SDtfs, 601 SDslu, 5111 SDs, 0 SdLazy, 2742 SolverSat, 80 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 993 GetRequests, 808 SyntacticMatches, 8 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=101occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 241 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 334 PreInvPairs, 900 NumberOfFragments, 261 HoareAnnotationTreeSize, 334 FomulaSimplifications, 1989200 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 18 FomulaSimplificationsInter, 11290 FormulaSimplificationTreeSizeReductionInter, 2.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1722 NumberOfCodeBlocks, 1722 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1694 ConstructedInterpolants, 19 QuantifiedInterpolants, 223304 SizeOfPredicates, 34 NumberOfNonLiveVariables, 2232 ConjunctsInSsa, 154 ConjunctsInUnsatCore, 28 InterpolantComputations, 5 PerfectInterpolantSequences, 728/1074 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...