./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/bitvector/soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ad681e5c-4302-4bfc-b29e-6618f4b7ba3b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ad681e5c-4302-4bfc-b29e-6618f4b7ba3b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ad681e5c-4302-4bfc-b29e-6618f4b7ba3b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ad681e5c-4302-4bfc-b29e-6618f4b7ba3b/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_ad681e5c-4302-4bfc-b29e-6618f4b7ba3b/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ad681e5c-4302-4bfc-b29e-6618f4b7ba3b/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 45b185c6c694406b0734db5727dff1b8fd93ebcf ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 07:19:49,036 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 07:19:49,037 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 07:19:49,044 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 07:19:49,044 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 07:19:49,045 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 07:19:49,045 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 07:19:49,047 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 07:19:49,048 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 07:19:49,048 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 07:19:49,049 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 07:19:49,049 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 07:19:49,050 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 07:19:49,051 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 07:19:49,052 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 07:19:49,052 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 07:19:49,053 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 07:19:49,054 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 07:19:49,055 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 07:19:49,057 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 07:19:49,057 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 07:19:49,058 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 07:19:49,060 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 07:19:49,061 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 07:19:49,061 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 07:19:49,061 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 07:19:49,062 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 07:19:49,063 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 07:19:49,064 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 07:19:49,064 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 07:19:49,065 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 07:19:49,065 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 07:19:49,065 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 07:19:49,065 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 07:19:49,066 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 07:19:49,066 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 07:19:49,067 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ad681e5c-4302-4bfc-b29e-6618f4b7ba3b/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 07:19:49,077 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 07:19:49,077 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 07:19:49,078 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 07:19:49,078 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 07:19:49,078 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 07:19:49,078 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 07:19:49,079 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 07:19:49,079 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 07:19:49,079 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 07:19:49,079 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 07:19:49,080 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 07:19:49,080 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 07:19:49,080 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 07:19:49,080 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 07:19:49,080 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 07:19:49,080 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 07:19:49,081 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 07:19:49,081 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 07:19:49,081 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 07:19:49,081 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 07:19:49,081 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 07:19:49,081 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 07:19:49,081 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 07:19:49,082 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 07:19:49,082 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 07:19:49,082 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 07:19:49,082 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 07:19:49,082 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 07:19:49,082 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 07:19:49,082 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_ad681e5c-4302-4bfc-b29e-6618f4b7ba3b/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 -> 45b185c6c694406b0734db5727dff1b8fd93ebcf [2018-11-10 07:19:49,105 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 07:19:49,113 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 07:19:49,115 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 07:19:49,116 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 07:19:49,116 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 07:19:49,117 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ad681e5c-4302-4bfc-b29e-6618f4b7ba3b/bin-2019/uautomizer/../../sv-benchmarks/c/bitvector/soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-11-10 07:19:49,154 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ad681e5c-4302-4bfc-b29e-6618f4b7ba3b/bin-2019/uautomizer/data/0084e3e67/ffa8648feeb8480da16951097fb95025/FLAG48d849e75 [2018-11-10 07:19:49,550 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 07:19:49,551 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ad681e5c-4302-4bfc-b29e-6618f4b7ba3b/sv-benchmarks/c/bitvector/soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-11-10 07:19:49,555 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ad681e5c-4302-4bfc-b29e-6618f4b7ba3b/bin-2019/uautomizer/data/0084e3e67/ffa8648feeb8480da16951097fb95025/FLAG48d849e75 [2018-11-10 07:19:49,563 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ad681e5c-4302-4bfc-b29e-6618f4b7ba3b/bin-2019/uautomizer/data/0084e3e67/ffa8648feeb8480da16951097fb95025 [2018-11-10 07:19:49,566 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 07:19:49,567 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 07:19:49,567 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 07:19:49,568 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 07:19:49,570 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 07:19:49,571 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:19:49" (1/1) ... [2018-11-10 07:19:49,573 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f863a47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:19:49, skipping insertion in model container [2018-11-10 07:19:49,573 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:19:49" (1/1) ... [2018-11-10 07:19:49,580 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 07:19:49,602 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 07:19:49,752 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:19:49,755 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 07:19:49,790 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:19:49,798 INFO L193 MainTranslator]: Completed translation [2018-11-10 07:19:49,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:19:49 WrapperNode [2018-11-10 07:19:49,798 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 07:19:49,799 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 07:19:49,799 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 07:19:49,799 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 07:19:49,806 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:19:49" (1/1) ... [2018-11-10 07:19:49,807 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:19:49" (1/1) ... [2018-11-10 07:19:49,811 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:19:49" (1/1) ... [2018-11-10 07:19:49,811 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:19:49" (1/1) ... [2018-11-10 07:19:49,814 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:19:49" (1/1) ... [2018-11-10 07:19:49,819 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:19:49" (1/1) ... [2018-11-10 07:19:49,821 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:19:49" (1/1) ... [2018-11-10 07:19:49,823 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 07:19:49,823 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 07:19:49,823 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 07:19:49,824 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 07:19:49,824 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:19:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad681e5c-4302-4bfc-b29e-6618f4b7ba3b/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-11-10 07:19:49,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 07:19:49,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 07:19:49,903 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-10 07:19:49,903 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2018-11-10 07:19:49,903 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2018-11-10 07:19:49,903 INFO L138 BoogieDeclarations]: Found implementation of procedure mulflt [2018-11-10 07:19:49,903 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 07:19:49,903 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 07:19:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-11-10 07:19:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2018-11-10 07:19:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-10 07:19:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2018-11-10 07:19:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2018-11-10 07:19:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure mulflt [2018-11-10 07:19:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 07:19:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 07:19:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 07:19:50,129 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 07:19:50,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:19:50 BoogieIcfgContainer [2018-11-10 07:19:50,129 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 07:19:50,130 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 07:19:50,130 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 07:19:50,131 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 07:19:50,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:19:49" (1/3) ... [2018-11-10 07:19:50,132 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b28a25b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:19:50, skipping insertion in model container [2018-11-10 07:19:50,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:19:49" (2/3) ... [2018-11-10 07:19:50,132 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b28a25b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:19:50, skipping insertion in model container [2018-11-10 07:19:50,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:19:50" (3/3) ... [2018-11-10 07:19:50,133 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-11-10 07:19:50,139 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 07:19:50,143 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 07:19:50,151 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 07:19:50,172 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 07:19:50,172 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 07:19:50,172 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 07:19:50,173 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 07:19:50,173 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 07:19:50,173 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 07:19:50,173 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 07:19:50,173 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 07:19:50,173 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 07:19:50,183 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2018-11-10 07:19:50,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-10 07:19:50,188 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:19:50,188 INFO L375 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-11-10 07:19:50,190 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:19:50,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:19:50,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1252609817, now seen corresponding path program 1 times [2018-11-10 07:19:50,194 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:19:50,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:19:50,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:19:50,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:19:50,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:19:50,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:19:50,330 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 07:19:50,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:19:50,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:19:50,336 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:19:50,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:19:50,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:19:50,349 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 3 states. [2018-11-10 07:19:50,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:19:50,389 INFO L93 Difference]: Finished difference Result 122 states and 178 transitions. [2018-11-10 07:19:50,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:19:50,392 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-11-10 07:19:50,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:19:50,402 INFO L225 Difference]: With dead ends: 122 [2018-11-10 07:19:50,402 INFO L226 Difference]: Without dead ends: 54 [2018-11-10 07:19:50,405 INFO L605 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-11-10 07:19:50,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-10 07:19:50,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-11-10 07:19:50,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-10 07:19:50,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 72 transitions. [2018-11-10 07:19:50,436 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 72 transitions. Word has length 48 [2018-11-10 07:19:50,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:19:50,438 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 72 transitions. [2018-11-10 07:19:50,438 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:19:50,438 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 72 transitions. [2018-11-10 07:19:50,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-10 07:19:50,440 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:19:50,440 INFO L375 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-11-10 07:19:50,440 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:19:50,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:19:50,441 INFO L82 PathProgramCache]: Analyzing trace with hash -955411957, now seen corresponding path program 1 times [2018-11-10 07:19:50,441 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:19:50,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:19:50,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:19:50,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:19:50,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:19:50,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:19:50,523 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 07:19:50,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:19:50,524 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad681e5c-4302-4bfc-b29e-6618f4b7ba3b/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-11-10 07:19:50,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:19:50,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:19:50,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:19:50,659 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 07:19:50,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:19:50,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7] total 8 [2018-11-10 07:19:50,676 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 07:19:50,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 07:19:50,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-10 07:19:50,677 INFO L87 Difference]: Start difference. First operand 54 states and 72 transitions. Second operand 8 states. [2018-11-10 07:19:50,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:19:50,862 INFO L93 Difference]: Finished difference Result 157 states and 220 transitions. [2018-11-10 07:19:50,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 07:19:50,862 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2018-11-10 07:19:50,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:19:50,866 INFO L225 Difference]: With dead ends: 157 [2018-11-10 07:19:50,866 INFO L226 Difference]: Without dead ends: 111 [2018-11-10 07:19:50,867 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-11-10 07:19:50,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-10 07:19:50,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 86. [2018-11-10 07:19:50,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-10 07:19:50,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 118 transitions. [2018-11-10 07:19:50,882 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 118 transitions. Word has length 50 [2018-11-10 07:19:50,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:19:50,882 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 118 transitions. [2018-11-10 07:19:50,882 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 07:19:50,882 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 118 transitions. [2018-11-10 07:19:50,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-10 07:19:50,883 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:19:50,883 INFO L375 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-11-10 07:19:50,884 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:19:50,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:19:50,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1292080167, now seen corresponding path program 1 times [2018-11-10 07:19:50,884 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:19:50,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:19:50,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:19:50,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:19:50,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:19:50,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:19:50,931 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 07:19:50,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:19:50,931 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad681e5c-4302-4bfc-b29e-6618f4b7ba3b/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-11-10 07:19:50,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:19:50,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:19:50,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:19:50,985 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 07:19:51,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 07:19:51,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2018-11-10 07:19:51,012 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 07:19:51,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 07:19:51,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 07:19:51,013 INFO L87 Difference]: Start difference. First operand 86 states and 118 transitions. Second operand 4 states. [2018-11-10 07:19:51,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:19:51,088 INFO L93 Difference]: Finished difference Result 169 states and 237 transitions. [2018-11-10 07:19:51,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 07:19:51,089 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-11-10 07:19:51,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:19:51,090 INFO L225 Difference]: With dead ends: 169 [2018-11-10 07:19:51,090 INFO L226 Difference]: Without dead ends: 103 [2018-11-10 07:19:51,091 INFO L605 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-11-10 07:19:51,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-10 07:19:51,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 95. [2018-11-10 07:19:51,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-10 07:19:51,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 131 transitions. [2018-11-10 07:19:51,104 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 131 transitions. Word has length 56 [2018-11-10 07:19:51,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:19:51,105 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 131 transitions. [2018-11-10 07:19:51,105 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 07:19:51,105 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 131 transitions. [2018-11-10 07:19:51,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-10 07:19:51,107 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:19:51,107 INFO L375 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-11-10 07:19:51,107 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:19:51,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:19:51,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1744296243, now seen corresponding path program 1 times [2018-11-10 07:19:51,108 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:19:51,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:19:51,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:19:51,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:19:51,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:19:51,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:19:51,151 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 07:19:51,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:19:51,151 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad681e5c-4302-4bfc-b29e-6618f4b7ba3b/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-11-10 07:19:51,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:19:51,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:19:51,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:19:51,179 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 07:19:51,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 07:19:51,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2018-11-10 07:19:51,196 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 07:19:51,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 07:19:51,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 07:19:51,197 INFO L87 Difference]: Start difference. First operand 95 states and 131 transitions. Second operand 4 states. [2018-11-10 07:19:51,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:19:51,252 INFO L93 Difference]: Finished difference Result 186 states and 264 transitions. [2018-11-10 07:19:51,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 07:19:51,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2018-11-10 07:19:51,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:19:51,253 INFO L225 Difference]: With dead ends: 186 [2018-11-10 07:19:51,253 INFO L226 Difference]: Without dead ends: 114 [2018-11-10 07:19:51,254 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 59 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-11-10 07:19:51,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-10 07:19:51,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 103. [2018-11-10 07:19:51,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-10 07:19:51,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 142 transitions. [2018-11-10 07:19:51,263 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 142 transitions. Word has length 57 [2018-11-10 07:19:51,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:19:51,263 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 142 transitions. [2018-11-10 07:19:51,263 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 07:19:51,263 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 142 transitions. [2018-11-10 07:19:51,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-10 07:19:51,265 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:19:51,265 INFO L375 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-11-10 07:19:51,265 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:19:51,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:19:51,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1105818479, now seen corresponding path program 1 times [2018-11-10 07:19:51,265 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:19:51,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:19:51,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:19:51,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:19:51,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:19:51,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:19:51,361 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 07:19:51,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:19:51,361 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad681e5c-4302-4bfc-b29e-6618f4b7ba3b/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-11-10 07:19:51,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:19:51,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:19:51,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:19:51,479 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 07:19:51,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:19:51,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10] total 13 [2018-11-10 07:19:51,494 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 07:19:51,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 07:19:51,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-11-10 07:19:51,495 INFO L87 Difference]: Start difference. First operand 103 states and 142 transitions. Second operand 13 states. [2018-11-10 07:19:51,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:19:51,871 INFO L93 Difference]: Finished difference Result 200 states and 277 transitions. [2018-11-10 07:19:51,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-10 07:19:51,872 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2018-11-10 07:19:51,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:19:51,873 INFO L225 Difference]: With dead ends: 200 [2018-11-10 07:19:51,873 INFO L226 Difference]: Without dead ends: 107 [2018-11-10 07:19:51,874 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2018-11-10 07:19:51,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-10 07:19:51,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 81. [2018-11-10 07:19:51,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-10 07:19:51,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 107 transitions. [2018-11-10 07:19:51,882 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 107 transitions. Word has length 57 [2018-11-10 07:19:51,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:19:51,882 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 107 transitions. [2018-11-10 07:19:51,882 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 07:19:51,883 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 107 transitions. [2018-11-10 07:19:51,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-10 07:19:51,884 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:19:51,884 INFO L375 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, 1] [2018-11-10 07:19:51,884 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:19:51,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:19:51,885 INFO L82 PathProgramCache]: Analyzing trace with hash 15098307, now seen corresponding path program 1 times [2018-11-10 07:19:51,885 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:19:51,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:19:51,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:19:51,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:19:51,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:19:51,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:19:51,952 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 07:19:51,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:19:51,953 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad681e5c-4302-4bfc-b29e-6618f4b7ba3b/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-11-10 07:19:51,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:19:51,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:19:51,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:19:52,060 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 07:19:52,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:19:52,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 10 [2018-11-10 07:19:52,086 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 07:19:52,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 07:19:52,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-10 07:19:52,087 INFO L87 Difference]: Start difference. First operand 81 states and 107 transitions. Second operand 10 states. [2018-11-10 07:19:52,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:19:52,237 INFO L93 Difference]: Finished difference Result 180 states and 239 transitions. [2018-11-10 07:19:52,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 07:19:52,238 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2018-11-10 07:19:52,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:19:52,239 INFO L225 Difference]: With dead ends: 180 [2018-11-10 07:19:52,239 INFO L226 Difference]: Without dead ends: 109 [2018-11-10 07:19:52,240 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-11-10 07:19:52,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-10 07:19:52,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 89. [2018-11-10 07:19:52,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-10 07:19:52,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 116 transitions. [2018-11-10 07:19:52,249 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 116 transitions. Word has length 58 [2018-11-10 07:19:52,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:19:52,249 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 116 transitions. [2018-11-10 07:19:52,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 07:19:52,249 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 116 transitions. [2018-11-10 07:19:52,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-10 07:19:52,250 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:19:52,250 INFO L375 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-11-10 07:19:52,250 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:19:52,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:19:52,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1665507476, now seen corresponding path program 1 times [2018-11-10 07:19:52,251 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:19:52,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:19:52,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:19:52,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:19:52,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:19:52,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:19:52,291 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 07:19:52,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:19:52,291 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad681e5c-4302-4bfc-b29e-6618f4b7ba3b/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-11-10 07:19:52,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:19:52,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:19:52,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:19:52,339 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 07:19:52,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:19:52,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-10 07:19:52,360 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 07:19:52,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 07:19:52,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-10 07:19:52,360 INFO L87 Difference]: Start difference. First operand 89 states and 116 transitions. Second operand 5 states. [2018-11-10 07:19:52,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:19:52,421 INFO L93 Difference]: Finished difference Result 178 states and 233 transitions. [2018-11-10 07:19:52,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 07:19:52,421 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2018-11-10 07:19:52,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:19:52,422 INFO L225 Difference]: With dead ends: 178 [2018-11-10 07:19:52,422 INFO L226 Difference]: Without dead ends: 99 [2018-11-10 07:19:52,422 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 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-11-10 07:19:52,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-10 07:19:52,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 92. [2018-11-10 07:19:52,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-10 07:19:52,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 120 transitions. [2018-11-10 07:19:52,430 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 120 transitions. Word has length 60 [2018-11-10 07:19:52,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:19:52,431 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 120 transitions. [2018-11-10 07:19:52,431 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 07:19:52,431 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 120 transitions. [2018-11-10 07:19:52,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-10 07:19:52,432 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:19:52,432 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 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] [2018-11-10 07:19:52,432 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:19:52,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:19:52,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1365570678, now seen corresponding path program 1 times [2018-11-10 07:19:52,432 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:19:52,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:19:52,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:19:52,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:19:52,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:19:52,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:19:52,489 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 07:19:52,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:19:52,490 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad681e5c-4302-4bfc-b29e-6618f4b7ba3b/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-11-10 07:19:52,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:19:52,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:19:52,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:19:52,556 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-10 07:19:52,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 07:19:52,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-11-10 07:19:52,573 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 07:19:52,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 07:19:52,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-10 07:19:52,574 INFO L87 Difference]: Start difference. First operand 92 states and 120 transitions. Second operand 10 states. [2018-11-10 07:19:52,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:19:52,746 INFO L93 Difference]: Finished difference Result 201 states and 264 transitions. [2018-11-10 07:19:52,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 07:19:52,746 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 62 [2018-11-10 07:19:52,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:19:52,747 INFO L225 Difference]: With dead ends: 201 [2018-11-10 07:19:52,747 INFO L226 Difference]: Without dead ends: 100 [2018-11-10 07:19:52,748 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-11-10 07:19:52,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-10 07:19:52,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 77. [2018-11-10 07:19:52,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-10 07:19:52,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 97 transitions. [2018-11-10 07:19:52,756 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 97 transitions. Word has length 62 [2018-11-10 07:19:52,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:19:52,756 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 97 transitions. [2018-11-10 07:19:52,756 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 07:19:52,756 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 97 transitions. [2018-11-10 07:19:52,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-10 07:19:52,757 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:19:52,757 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:19:52,758 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:19:52,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:19:52,758 INFO L82 PathProgramCache]: Analyzing trace with hash -13236933, now seen corresponding path program 1 times [2018-11-10 07:19:52,758 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:19:52,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:19:52,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:19:52,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:19:52,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:19:52,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:19:52,811 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 07:19:52,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:19:52,811 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad681e5c-4302-4bfc-b29e-6618f4b7ba3b/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-11-10 07:19:52,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:19:52,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:19:52,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:19:52,844 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 07:19:52,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:19:52,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-10 07:19:52,861 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 07:19:52,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 07:19:52,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-10 07:19:52,861 INFO L87 Difference]: Start difference. First operand 77 states and 97 transitions. Second operand 6 states. [2018-11-10 07:19:52,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:19:52,910 INFO L93 Difference]: Finished difference Result 161 states and 202 transitions. [2018-11-10 07:19:52,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 07:19:52,911 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2018-11-10 07:19:52,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:19:52,912 INFO L225 Difference]: With dead ends: 161 [2018-11-10 07:19:52,912 INFO L226 Difference]: Without dead ends: 94 [2018-11-10 07:19:52,912 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 74 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-11-10 07:19:52,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-10 07:19:52,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 80. [2018-11-10 07:19:52,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-10 07:19:52,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 101 transitions. [2018-11-10 07:19:52,920 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 101 transitions. Word has length 70 [2018-11-10 07:19:52,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:19:52,920 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 101 transitions. [2018-11-10 07:19:52,920 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 07:19:52,920 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 101 transitions. [2018-11-10 07:19:52,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-10 07:19:52,921 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:19:52,921 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:19:52,922 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:19:52,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:19:52,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1194924903, now seen corresponding path program 1 times [2018-11-10 07:19:52,922 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:19:52,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:19:52,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:19:52,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:19:52,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:19:52,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:19:52,986 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 07:19:52,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:19:52,986 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad681e5c-4302-4bfc-b29e-6618f4b7ba3b/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-11-10 07:19:53,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:19:53,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:19:53,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:19:53,112 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-10 07:19:53,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:19:53,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 15 [2018-11-10 07:19:53,131 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 07:19:53,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 07:19:53,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-11-10 07:19:53,132 INFO L87 Difference]: Start difference. First operand 80 states and 101 transitions. Second operand 15 states. [2018-11-10 07:19:53,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:19:53,701 INFO L93 Difference]: Finished difference Result 200 states and 258 transitions. [2018-11-10 07:19:53,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-10 07:19:53,702 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2018-11-10 07:19:53,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:19:53,703 INFO L225 Difference]: With dead ends: 200 [2018-11-10 07:19:53,703 INFO L226 Difference]: Without dead ends: 130 [2018-11-10 07:19:53,704 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=875, Unknown=0, NotChecked=0, Total=992 [2018-11-10 07:19:53,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-11-10 07:19:53,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 98. [2018-11-10 07:19:53,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-10 07:19:53,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 127 transitions. [2018-11-10 07:19:53,715 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 127 transitions. Word has length 72 [2018-11-10 07:19:53,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:19:53,715 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 127 transitions. [2018-11-10 07:19:53,715 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 07:19:53,715 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 127 transitions. [2018-11-10 07:19:53,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-10 07:19:53,716 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:19:53,716 INFO L375 BasicCegarLoop]: trace histogram [4, 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, 1] [2018-11-10 07:19:53,717 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:19:53,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:19:53,717 INFO L82 PathProgramCache]: Analyzing trace with hash -794669882, now seen corresponding path program 1 times [2018-11-10 07:19:53,717 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:19:53,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:19:53,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:19:53,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:19:53,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:19:53,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:19:53,777 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 07:19:53,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:19:53,777 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad681e5c-4302-4bfc-b29e-6618f4b7ba3b/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-11-10 07:19:53,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:19:53,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:19:53,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:19:53,820 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 25 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 07:19:53,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:19:53,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-10 07:19:53,840 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 07:19:53,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 07:19:53,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-10 07:19:53,840 INFO L87 Difference]: Start difference. First operand 98 states and 127 transitions. Second operand 7 states. [2018-11-10 07:19:53,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:19:53,928 INFO L93 Difference]: Finished difference Result 210 states and 273 transitions. [2018-11-10 07:19:53,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 07:19:53,929 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-11-10 07:19:53,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:19:53,930 INFO L225 Difference]: With dead ends: 210 [2018-11-10 07:19:53,930 INFO L226 Difference]: Without dead ends: 122 [2018-11-10 07:19:53,931 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 79 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-11-10 07:19:53,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-10 07:19:53,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 101. [2018-11-10 07:19:53,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-10 07:19:53,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 131 transitions. [2018-11-10 07:19:53,940 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 131 transitions. Word has length 74 [2018-11-10 07:19:53,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:19:53,941 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 131 transitions. [2018-11-10 07:19:53,941 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 07:19:53,941 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 131 transitions. [2018-11-10 07:19:53,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-10 07:19:53,942 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:19:53,942 INFO L375 BasicCegarLoop]: trace histogram [4, 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, 1] [2018-11-10 07:19:53,942 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:19:53,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:19:53,942 INFO L82 PathProgramCache]: Analyzing trace with hash -224227868, now seen corresponding path program 1 times [2018-11-10 07:19:53,942 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:19:53,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:19:53,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:19:53,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:19:53,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:19:53,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:19:54,040 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 4 proven. 33 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 07:19:54,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:19:54,040 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad681e5c-4302-4bfc-b29e-6618f4b7ba3b/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-11-10 07:19:54,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:19:54,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:19:54,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:19:54,211 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-10 07:19:54,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:19:54,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 16 [2018-11-10 07:19:54,228 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-10 07:19:54,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-10 07:19:54,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-11-10 07:19:54,228 INFO L87 Difference]: Start difference. First operand 101 states and 131 transitions. Second operand 16 states. [2018-11-10 07:19:54,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:19:54,849 INFO L93 Difference]: Finished difference Result 223 states and 290 transitions. [2018-11-10 07:19:54,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-10 07:19:54,849 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 76 [2018-11-10 07:19:54,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:19:54,850 INFO L225 Difference]: With dead ends: 223 [2018-11-10 07:19:54,850 INFO L226 Difference]: Without dead ends: 113 [2018-11-10 07:19:54,851 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=145, Invalid=1261, Unknown=0, NotChecked=0, Total=1406 [2018-11-10 07:19:54,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-10 07:19:54,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 82. [2018-11-10 07:19:54,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-10 07:19:54,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 100 transitions. [2018-11-10 07:19:54,858 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 100 transitions. Word has length 76 [2018-11-10 07:19:54,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:19:54,858 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 100 transitions. [2018-11-10 07:19:54,858 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-10 07:19:54,858 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 100 transitions. [2018-11-10 07:19:54,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-10 07:19:54,859 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:19:54,859 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:19:54,860 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:19:54,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:19:54,860 INFO L82 PathProgramCache]: Analyzing trace with hash 577779343, now seen corresponding path program 2 times [2018-11-10 07:19:54,860 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:19:54,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:19:54,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:19:54,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:19:54,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:19:54,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:19:54,906 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 4 proven. 46 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-10 07:19:54,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:19:54,906 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad681e5c-4302-4bfc-b29e-6618f4b7ba3b/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-11-10 07:19:54,914 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 07:19:54,956 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 07:19:54,956 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:19:54,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:19:54,966 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 26 proven. 36 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 07:19:54,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:19:54,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-10 07:19:54,989 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 07:19:54,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 07:19:54,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-10 07:19:54,989 INFO L87 Difference]: Start difference. First operand 82 states and 100 transitions. Second operand 8 states. [2018-11-10 07:19:55,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:19:55,048 INFO L93 Difference]: Finished difference Result 176 states and 214 transitions. [2018-11-10 07:19:55,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 07:19:55,049 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 83 [2018-11-10 07:19:55,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:19:55,050 INFO L225 Difference]: With dead ends: 176 [2018-11-10 07:19:55,050 INFO L226 Difference]: Without dead ends: 101 [2018-11-10 07:19:55,051 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-10 07:19:55,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-10 07:19:55,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 85. [2018-11-10 07:19:55,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-10 07:19:55,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 103 transitions. [2018-11-10 07:19:55,057 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 103 transitions. Word has length 83 [2018-11-10 07:19:55,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:19:55,057 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 103 transitions. [2018-11-10 07:19:55,057 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 07:19:55,057 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2018-11-10 07:19:55,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 07:19:55,058 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:19:55,058 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:19:55,058 INFO L424 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:19:55,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:19:55,059 INFO L82 PathProgramCache]: Analyzing trace with hash 235179633, now seen corresponding path program 2 times [2018-11-10 07:19:55,059 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:19:55,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:19:55,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:19:55,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:19:55,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:19:55,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:19:55,129 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 4 proven. 50 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-10 07:19:55,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:19:55,130 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad681e5c-4302-4bfc-b29e-6618f4b7ba3b/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-11-10 07:19:55,143 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 07:19:55,177 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 07:19:55,177 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:19:55,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:19:55,329 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-11-10 07:19:55,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:19:55,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 19 [2018-11-10 07:19:55,346 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-10 07:19:55,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-10 07:19:55,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2018-11-10 07:19:55,347 INFO L87 Difference]: Start difference. First operand 85 states and 103 transitions. Second operand 19 states. [2018-11-10 07:19:55,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:19:55,786 INFO L93 Difference]: Finished difference Result 210 states and 260 transitions. [2018-11-10 07:19:55,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-10 07:19:55,786 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 85 [2018-11-10 07:19:55,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:19:55,787 INFO L225 Difference]: With dead ends: 210 [2018-11-10 07:19:55,787 INFO L226 Difference]: Without dead ends: 135 [2018-11-10 07:19:55,787 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 74 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=828, Unknown=0, NotChecked=0, Total=930 [2018-11-10 07:19:55,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-11-10 07:19:55,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 94. [2018-11-10 07:19:55,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-10 07:19:55,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 117 transitions. [2018-11-10 07:19:55,793 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 117 transitions. Word has length 85 [2018-11-10 07:19:55,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:19:55,793 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 117 transitions. [2018-11-10 07:19:55,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-10 07:19:55,793 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 117 transitions. [2018-11-10 07:19:55,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-10 07:19:55,794 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:19:55,794 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:19:55,794 INFO L424 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:19:55,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:19:55,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1444612444, now seen corresponding path program 1 times [2018-11-10 07:19:55,795 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:19:55,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:19:55,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:19:55,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:19:55,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:19:55,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:19:55,829 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-11-10 07:19:55,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:19:55,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 07:19:55,829 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 07:19:55,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 07:19:55,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 07:19:55,830 INFO L87 Difference]: Start difference. First operand 94 states and 117 transitions. Second operand 4 states. [2018-11-10 07:19:55,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:19:55,855 INFO L93 Difference]: Finished difference Result 106 states and 129 transitions. [2018-11-10 07:19:55,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 07:19:55,856 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2018-11-10 07:19:55,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:19:55,857 INFO L225 Difference]: With dead ends: 106 [2018-11-10 07:19:55,857 INFO L226 Difference]: Without dead ends: 89 [2018-11-10 07:19:55,857 INFO L605 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-11-10 07:19:55,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-10 07:19:55,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-11-10 07:19:55,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-10 07:19:55,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 107 transitions. [2018-11-10 07:19:55,867 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 107 transitions. Word has length 87 [2018-11-10 07:19:55,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:19:55,868 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 107 transitions. [2018-11-10 07:19:55,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 07:19:55,868 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 107 transitions. [2018-11-10 07:19:55,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-10 07:19:55,868 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:19:55,869 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 4, 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-11-10 07:19:55,869 INFO L424 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:19:55,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:19:55,869 INFO L82 PathProgramCache]: Analyzing trace with hash 2110646378, now seen corresponding path program 1 times [2018-11-10 07:19:55,869 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:19:55,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:19:55,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:19:55,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:19:55,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:19:55,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:19:55,923 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 4 proven. 65 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-10 07:19:55,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:19:55,923 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad681e5c-4302-4bfc-b29e-6618f4b7ba3b/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:19:55,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:19:55,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:19:55,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:19:55,965 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 26 proven. 55 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 07:19:55,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:19:55,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-10 07:19:55,983 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 07:19:55,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 07:19:55,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-11-10 07:19:55,984 INFO L87 Difference]: Start difference. First operand 89 states and 107 transitions. Second operand 9 states. [2018-11-10 07:19:56,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:19:56,037 INFO L93 Difference]: Finished difference Result 194 states and 233 transitions. [2018-11-10 07:19:56,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 07:19:56,037 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2018-11-10 07:19:56,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:19:56,038 INFO L225 Difference]: With dead ends: 194 [2018-11-10 07:19:56,038 INFO L226 Difference]: Without dead ends: 112 [2018-11-10 07:19:56,038 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-10 07:19:56,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-10 07:19:56,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 92. [2018-11-10 07:19:56,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-10 07:19:56,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 110 transitions. [2018-11-10 07:19:56,044 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 110 transitions. Word has length 87 [2018-11-10 07:19:56,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:19:56,044 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 110 transitions. [2018-11-10 07:19:56,044 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 07:19:56,044 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 110 transitions. [2018-11-10 07:19:56,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-10 07:19:56,045 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:19:56,045 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 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-11-10 07:19:56,045 INFO L424 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:19:56,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:19:56,046 INFO L82 PathProgramCache]: Analyzing trace with hash -586172788, now seen corresponding path program 1 times [2018-11-10 07:19:56,046 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:19:56,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:19:56,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:19:56,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:19:56,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:19:56,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:19:56,121 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 4 proven. 71 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-10 07:19:56,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:19:56,122 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad681e5c-4302-4bfc-b29e-6618f4b7ba3b/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:19:56,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:19:56,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:19:56,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:19:56,270 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-11-10 07:19:56,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:19:56,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2018-11-10 07:19:56,287 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-10 07:19:56,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-10 07:19:56,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-11-10 07:19:56,288 INFO L87 Difference]: Start difference. First operand 92 states and 110 transitions. Second operand 18 states. [2018-11-10 07:19:56,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:19:56,714 INFO L93 Difference]: Finished difference Result 208 states and 251 transitions. [2018-11-10 07:19:56,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-10 07:19:56,715 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 89 [2018-11-10 07:19:56,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:19:56,716 INFO L225 Difference]: With dead ends: 208 [2018-11-10 07:19:56,716 INFO L226 Difference]: Without dead ends: 116 [2018-11-10 07:19:56,716 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=733, Unknown=0, NotChecked=0, Total=812 [2018-11-10 07:19:56,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-10 07:19:56,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 93. [2018-11-10 07:19:56,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-10 07:19:56,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 111 transitions. [2018-11-10 07:19:56,722 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 111 transitions. Word has length 89 [2018-11-10 07:19:56,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:19:56,722 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 111 transitions. [2018-11-10 07:19:56,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-10 07:19:56,722 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 111 transitions. [2018-11-10 07:19:56,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-10 07:19:56,723 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:19:56,723 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 4, 4, 4, 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-11-10 07:19:56,724 INFO L424 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:19:56,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:19:56,724 INFO L82 PathProgramCache]: Analyzing trace with hash 103062787, now seen corresponding path program 1 times [2018-11-10 07:19:56,724 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:19:56,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:19:56,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:19:56,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:19:56,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:19:56,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:19:56,775 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 4 proven. 88 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-10 07:19:56,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:19:56,776 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad681e5c-4302-4bfc-b29e-6618f4b7ba3b/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:19:56,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:19:56,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:19:56,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:19:56,814 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 26 proven. 78 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 07:19:56,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:19:56,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-11-10 07:19:56,839 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 07:19:56,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 07:19:56,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-11-10 07:19:56,839 INFO L87 Difference]: Start difference. First operand 93 states and 111 transitions. Second operand 10 states. [2018-11-10 07:19:56,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:19:56,892 INFO L93 Difference]: Finished difference Result 206 states and 246 transitions. [2018-11-10 07:19:56,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 07:19:56,892 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 91 [2018-11-10 07:19:56,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:19:56,893 INFO L225 Difference]: With dead ends: 206 [2018-11-10 07:19:56,893 INFO L226 Difference]: Without dead ends: 120 [2018-11-10 07:19:56,893 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-11-10 07:19:56,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-11-10 07:19:56,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 96. [2018-11-10 07:19:56,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-10 07:19:56,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 114 transitions. [2018-11-10 07:19:56,903 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 114 transitions. Word has length 91 [2018-11-10 07:19:56,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:19:56,903 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 114 transitions. [2018-11-10 07:19:56,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 07:19:56,903 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 114 transitions. [2018-11-10 07:19:56,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-10 07:19:56,904 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:19:56,904 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 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-11-10 07:19:56,904 INFO L424 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:19:56,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:19:56,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1125203611, now seen corresponding path program 1 times [2018-11-10 07:19:56,905 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:19:56,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:19:56,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:19:56,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:19:56,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:19:56,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:19:57,003 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 4 proven. 95 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-10 07:19:57,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:19:57,004 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad681e5c-4302-4bfc-b29e-6618f4b7ba3b/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:19:57,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:19:57,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:19:57,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:19:57,211 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-11-10 07:19:57,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:19:57,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-11-10 07:19:57,238 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-10 07:19:57,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-10 07:19:57,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-11-10 07:19:57,238 INFO L87 Difference]: Start difference. First operand 96 states and 114 transitions. Second operand 19 states. [2018-11-10 07:19:57,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:19:57,786 INFO L93 Difference]: Finished difference Result 197 states and 237 transitions. [2018-11-10 07:19:57,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-10 07:19:57,786 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 93 [2018-11-10 07:19:57,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:19:57,786 INFO L225 Difference]: With dead ends: 197 [2018-11-10 07:19:57,786 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 07:19:57,787 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=901, Unknown=0, NotChecked=0, Total=992 [2018-11-10 07:19:57,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 07:19:57,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 07:19:57,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 07:19:57,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 07:19:57,788 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 93 [2018-11-10 07:19:57,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:19:57,788 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:19:57,788 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-10 07:19:57,788 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 07:19:57,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 07:19:57,791 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 07:19:58,752 WARN L179 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 31 [2018-11-10 07:19:58,915 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 07:19:58,916 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 07:19:58,916 INFO L425 ceAbstractionStarter]: For program point L27-1(lines 27 42) no Hoare annotation was computed. [2018-11-10 07:19:58,916 INFO L425 ceAbstractionStarter]: For program point L19(lines 19 24) no Hoare annotation was computed. [2018-11-10 07:19:58,916 INFO L425 ceAbstractionStarter]: For program point L48(lines 47 62) no Hoare annotation was computed. [2018-11-10 07:19:58,916 INFO L421 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 .cse0 (<= (+ |base2flt_#in~e| 128) 0)) (and (<= 127 |base2flt_#in~e|) .cse1) (and (<= base2flt_~m |base2flt_#in~m|) (= 0 base2flt_~__retres4~0) .cse0 (<= |base2flt_#in~m| base2flt_~m) .cse1) (forall ((base2flt_~m Int)) (or (< base2flt_~m |base2flt_#in~m|) (< |base2flt_#in~m| base2flt_~m) (< 0 (mod base2flt_~m 4294967296)))))) [2018-11-10 07:19:58,916 INFO L425 ceAbstractionStarter]: For program point L28(lines 27 42) no Hoare annotation was computed. [2018-11-10 07:19:58,916 INFO L425 ceAbstractionStarter]: For program point L49(lines 47 62) no Hoare annotation was computed. [2018-11-10 07:19:58,916 INFO L425 ceAbstractionStarter]: For program point L37(lines 37 41) no Hoare annotation was computed. [2018-11-10 07:19:58,917 INFO L421 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-11-10 07:19:58,917 INFO L425 ceAbstractionStarter]: For program point L25(lines 25 65) no Hoare annotation was computed. [2018-11-10 07:19:58,917 INFO L428 ceAbstractionStarter]: At program point base2fltENTRY(lines 14 72) the Hoare annotation is: true [2018-11-10 07:19:58,917 INFO L425 ceAbstractionStarter]: For program point base2fltFINAL(lines 14 72) no Hoare annotation was computed. [2018-11-10 07:19:58,917 INFO L421 ceAbstractionStarter]: At program point L63(lines 25 65) the Hoare annotation is: (forall ((base2flt_~m Int)) (or (< base2flt_~m |base2flt_#in~m|) (< |base2flt_#in~m| base2flt_~m) (< 0 (mod base2flt_~m 4294967296)))) [2018-11-10 07:19:58,917 INFO L425 ceAbstractionStarter]: For program point base2fltEXIT(lines 14 72) no Hoare annotation was computed. [2018-11-10 07:19:58,917 INFO L425 ceAbstractionStarter]: For program point L47-1(lines 47 62) no Hoare annotation was computed. [2018-11-10 07:19:58,917 INFO L421 ceAbstractionStarter]: At program point L47-3(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) (forall ((base2flt_~m Int)) (or (< base2flt_~m |base2flt_#in~m|) (< |base2flt_#in~m| base2flt_~m) (< 0 (mod base2flt_~m 4294967296)))) (or (<= |base2flt_#in~m| base2flt_~m) (< 0 .cse0)) (or .cse1 (<= (+ (* 4294967296 .cse2) 16777216) |base2flt_#in~m|)) (or (<= base2flt_~m |base2flt_#in~m|) .cse1))))) [2018-11-10 07:19:58,917 INFO L425 ceAbstractionStarter]: For program point mulfltEXIT(lines 137 209) no Hoare annotation was computed. [2018-11-10 07:19:58,917 INFO L425 ceAbstractionStarter]: For program point L184(lines 184 201) no Hoare annotation was computed. [2018-11-10 07:19:58,918 INFO L425 ceAbstractionStarter]: For program point L184-2(lines 184 201) no Hoare annotation was computed. [2018-11-10 07:19:58,918 INFO L425 ceAbstractionStarter]: For program point L193(lines 193 198) no Hoare annotation was computed. [2018-11-10 07:19:58,918 INFO L425 ceAbstractionStarter]: For program point mulfltFINAL(lines 137 209) no Hoare annotation was computed. [2018-11-10 07:19:58,918 INFO L428 ceAbstractionStarter]: At program point mulfltENTRY(lines 137 209) the Hoare annotation is: true [2018-11-10 07:19:58,918 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 190) no Hoare annotation was computed. [2018-11-10 07:19:58,918 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 154) no Hoare annotation was computed. [2018-11-10 07:19:58,918 INFO L425 ceAbstractionStarter]: For program point L148-2(lines 147 208) no Hoare annotation was computed. [2018-11-10 07:19:58,918 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 180) no Hoare annotation was computed. [2018-11-10 07:19:58,918 INFO L421 ceAbstractionStarter]: At program point L206(lines 147 208) the Hoare annotation is: (let ((.cse0 (= 0 mulflt_~__retres10~1))) (and (let ((.cse2 (mod |mulflt_#in~a| 4294967296))) (or .cse0 (and (exists ((mulflt_~b Int)) (let ((.cse1 (mod mulflt_~b 4294967296))) (and (<= .cse1 (mod |mulflt_#in~a| 4294967296)) (not (= .cse1 0))))) (<= (mod mulflt_~b 4294967296) .cse2) (= mulflt_~a |mulflt_#in~a|)) (and (= mulflt_~b |mulflt_#in~a|) (not (= .cse2 0))))) (or (exists ((v_mulflt_~a_6 Int)) (< (mod v_mulflt_~a_6 4294967296) (mod |mulflt_#in~b| 4294967296))) (and (= mulflt_~b |mulflt_#in~b|) .cse0)))) [2018-11-10 07:19:58,918 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 174) no Hoare annotation was computed. [2018-11-10 07:19:58,919 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 07:19:58,919 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 07:19:58,919 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 07:19:58,919 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 07:19:58,919 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 254) no Hoare annotation was computed. [2018-11-10 07:19:58,919 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 210 266) no Hoare annotation was computed. [2018-11-10 07:19:58,919 INFO L425 ceAbstractionStarter]: For program point L250-2(lines 250 254) no Hoare annotation was computed. [2018-11-10 07:19:58,919 INFO L425 ceAbstractionStarter]: For program point L246(lines 246 262) no Hoare annotation was computed. [2018-11-10 07:19:58,919 INFO L425 ceAbstractionStarter]: For program point L246-1(lines 246 262) no Hoare annotation was computed. [2018-11-10 07:19:58,919 INFO L425 ceAbstractionStarter]: For program point L244(line 244) no Hoare annotation was computed. [2018-11-10 07:19:58,919 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 210 266) no Hoare annotation was computed. [2018-11-10 07:19:58,920 INFO L425 ceAbstractionStarter]: For program point L236(lines 236 240) no Hoare annotation was computed. [2018-11-10 07:19:58,920 INFO L425 ceAbstractionStarter]: For program point L236-2(lines 236 240) no Hoare annotation was computed. [2018-11-10 07:19:58,920 INFO L421 ceAbstractionStarter]: At program point L230(line 230) the Hoare annotation is: (= 0 main_~zero~0) [2018-11-10 07:19:58,920 INFO L425 ceAbstractionStarter]: For program point L230-1(line 230) no Hoare annotation was computed. [2018-11-10 07:19:58,920 INFO L428 ceAbstractionStarter]: At program point L228(line 228) the Hoare annotation is: true [2018-11-10 07:19:58,920 INFO L425 ceAbstractionStarter]: For program point L228-1(line 228) no Hoare annotation was computed. [2018-11-10 07:19:58,920 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 210 266) the Hoare annotation is: true [2018-11-10 07:19:58,920 INFO L425 ceAbstractionStarter]: For program point L247(lines 247 256) no Hoare annotation was computed. [2018-11-10 07:19:58,920 INFO L421 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-11-10 07:19:58,920 INFO L425 ceAbstractionStarter]: For program point L233(lines 233 242) no Hoare annotation was computed. [2018-11-10 07:19:58,920 INFO L421 ceAbstractionStarter]: At program point L231(line 231) the Hoare annotation is: (= 0 main_~zero~0) [2018-11-10 07:19:58,921 INFO L421 ceAbstractionStarter]: At program point L233-2(lines 233 242) the Hoare annotation is: (let ((.cse0 (= 0 main_~zero~0))) (or (and (= main_~b~0 0) .cse0) (and (<= (mod main_~a~0 4294967296) 0) .cse0) (<= (+ main_~sa~0 1) 0) (and (<= 1 main_~tmp~2) (<= 1 main_~sa~0) .cse0))) [2018-11-10 07:19:58,921 INFO L425 ceAbstractionStarter]: For program point L231-1(line 231) no Hoare annotation was computed. [2018-11-10 07:19:58,921 INFO L421 ceAbstractionStarter]: At program point L229(line 229) the Hoare annotation is: (= 0 main_~zero~0) [2018-11-10 07:19:58,921 INFO L425 ceAbstractionStarter]: For program point L229-1(line 229) no Hoare annotation was computed. [2018-11-10 07:19:58,921 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2018-11-10 07:19:58,921 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 5 10) no Hoare annotation was computed. [2018-11-10 07:19:58,921 INFO L425 ceAbstractionStarter]: For program point L7(line 7) no Hoare annotation was computed. [2018-11-10 07:19:58,921 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) no Hoare annotation was computed. [2018-11-10 07:19:58,921 INFO L425 ceAbstractionStarter]: For program point L6(lines 6 8) no Hoare annotation was computed. [2018-11-10 07:19:58,921 INFO L425 ceAbstractionStarter]: For program point L6-2(lines 5 10) no Hoare annotation was computed. [2018-11-10 07:19:58,921 INFO L425 ceAbstractionStarter]: For program point L128(line 128) no Hoare annotation was computed. [2018-11-10 07:19:58,922 INFO L425 ceAbstractionStarter]: For program point addfltENTRY(lines 73 136) no Hoare annotation was computed. [2018-11-10 07:19:58,922 INFO L425 ceAbstractionStarter]: For program point addfltFINAL(lines 73 136) no Hoare annotation was computed. [2018-11-10 07:19:58,922 INFO L425 ceAbstractionStarter]: For program point L116(lines 116 121) no Hoare annotation was computed. [2018-11-10 07:19:58,922 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 113) no Hoare annotation was computed. [2018-11-10 07:19:58,922 INFO L425 ceAbstractionStarter]: For program point L104(line 104) no Hoare annotation was computed. [2018-11-10 07:19:58,922 INFO L425 ceAbstractionStarter]: For program point L104-1(line 104) no Hoare annotation was computed. [2018-11-10 07:19:58,922 INFO L425 ceAbstractionStarter]: For program point L133(lines 83 135) no Hoare annotation was computed. [2018-11-10 07:19:58,922 INFO L425 ceAbstractionStarter]: For program point addfltEXIT(lines 73 136) no Hoare annotation was computed. [2018-11-10 07:19:58,922 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 90) no Hoare annotation was computed. [2018-11-10 07:19:58,922 INFO L425 ceAbstractionStarter]: For program point L115(lines 115 126) no Hoare annotation was computed. [2018-11-10 07:19:58,922 INFO L425 ceAbstractionStarter]: For program point L84-2(lines 83 135) no Hoare annotation was computed. [2018-11-10 07:19:58,922 INFO L425 ceAbstractionStarter]: For program point L115-2(lines 115 126) no Hoare annotation was computed. [2018-11-10 07:19:58,927 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 07:19:58,927 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 07:19:58,928 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 07:19:58,933 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 07:19:58,933 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 07:19:58,933 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 07:19:58,935 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 07:19:58,935 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 07:19:58,935 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 07:19:58,935 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 07:19:58,936 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 07:19:58,936 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 07:19:58,936 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 07:19:58,937 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 07:19:58,937 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 07:19:58,937 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 07:19:58,937 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 07:19:58,938 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 07:19:58,939 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] [2018-11-10 07:19:58,939 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] [2018-11-10 07:19:58,939 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_mulflt_~a_6,QUANTIFIED] [2018-11-10 07:19:58,940 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] [2018-11-10 07:19:58,940 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] [2018-11-10 07:19:58,940 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_mulflt_~a_6,QUANTIFIED] [2018-11-10 07:19:58,941 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 07:19:58,941 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 07:19:58,941 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 07:19:58,941 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 07:19:58,942 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 07:19:58,942 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 07:19:58,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:19:58 BoogieIcfgContainer [2018-11-10 07:19:58,943 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 07:19:58,944 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 07:19:58,944 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 07:19:58,944 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 07:19:58,944 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:19:50" (3/4) ... [2018-11-10 07:19:58,947 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 07:19:58,952 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 07:19:58,952 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure base2flt [2018-11-10 07:19:58,952 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure mulflt [2018-11-10 07:19:58,952 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 07:19:58,952 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-10 07:19:58,953 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure addflt [2018-11-10 07:19:58,957 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2018-11-10 07:19:58,958 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-10 07:19:58,958 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 07:19:58,976 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\old(e) <= e && \old(e) + 128 <= 0) || (127 <= \old(e) && e <= \old(e))) || ((((m <= \old(m) && 0 == __retres4) && \old(e) <= e) && \old(m) <= m) && e <= \old(e))) || (forall base2flt_~m : int :: (base2flt_~m < \old(m) || \old(m) < base2flt_~m) || 0 < base2flt_~m % 4294967296) [2018-11-10 07:19:58,977 WARN L220 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-11-10 07:19:58,977 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\old(e) <= e && (forall base2flt_~m : int :: (base2flt_~m < \old(m) || \old(m) < base2flt_~m) || 0 < base2flt_~m % 4294967296)) && (\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-11-10 07:19:58,977 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (forall base2flt_~m : int :: (base2flt_~m < \old(m) || \old(m) < base2flt_~m) || 0 < base2flt_~m % 4294967296) [2018-11-10 07:19:58,978 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 == __retres10 || (((\exists mulflt_~b : int :: mulflt_~b % 4294967296 <= \old(a) % 4294967296 && !(mulflt_~b % 4294967296 == 0)) && b % 4294967296 <= \old(a) % 4294967296) && a == \old(a))) || (b == \old(a) && !(\old(a) % 4294967296 == 0))) && ((\exists v_mulflt_~a_6 : int :: v_mulflt_~a_6 % 4294967296 < \old(b) % 4294967296) || (b == \old(b) && 0 == __retres10)) [2018-11-10 07:19:59,005 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_ad681e5c-4302-4bfc-b29e-6618f4b7ba3b/bin-2019/uautomizer/witness.graphml [2018-11-10 07:19:59,005 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 07:19:59,005 INFO L168 Benchmark]: Toolchain (without parser) took 9439.39 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 383.8 MB). Free memory was 959.8 MB in the beginning and 875.9 MB in the end (delta: 83.9 MB). Peak memory consumption was 467.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:19:59,006 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:19:59,006 INFO L168 Benchmark]: CACSL2BoogieTranslator took 231.12 ms. Allocated memory is still 1.0 GB. Free memory was 959.8 MB in the beginning and 946.4 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-10 07:19:59,006 INFO L168 Benchmark]: Boogie Preprocessor took 24.34 ms. Allocated memory is still 1.0 GB. Free memory was 946.4 MB in the beginning and 943.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:19:59,007 INFO L168 Benchmark]: RCFGBuilder took 306.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.4 MB). Free memory was 943.7 MB in the beginning and 1.1 GB in the end (delta: -177.9 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:19:59,007 INFO L168 Benchmark]: TraceAbstraction took 8813.69 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 224.4 MB). Free memory was 1.1 GB in the beginning and 885.2 MB in the end (delta: 236.4 MB). Peak memory consumption was 460.8 MB. Max. memory is 11.5 GB. [2018-11-10 07:19:59,010 INFO L168 Benchmark]: Witness Printer took 61.11 ms. Allocated memory is still 1.4 GB. Free memory was 885.2 MB in the beginning and 875.9 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 11.5 GB. [2018-11-10 07:19:59,011 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 231.12 ms. Allocated memory is still 1.0 GB. Free memory was 959.8 MB in the beginning and 946.4 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.34 ms. Allocated memory is still 1.0 GB. Free memory was 946.4 MB in the beginning and 943.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 306.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.4 MB). Free memory was 943.7 MB in the beginning and 1.1 GB in the end (delta: -177.9 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8813.69 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 224.4 MB). Free memory was 1.1 GB in the beginning and 885.2 MB in the end (delta: 236.4 MB). Peak memory consumption was 460.8 MB. Max. memory is 11.5 GB. * Witness Printer took 61.11 ms. Allocated memory is still 1.4 GB. Free memory was 885.2 MB in the beginning and 875.9 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[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[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[mulflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,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[mulflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,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-11-10 07:19:59,015 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 07:19:59,015 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 07:19:59,015 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 07:19:59,015 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 07:19:59,015 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 07:19:59,015 WARN L387 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) - InvariantResult [Line: 18]: Loop Invariant [2018-11-10 07:19:59,016 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 07:19:59,016 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 07:19:59,016 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 07:19:59,016 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 07:19:59,016 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 07:19:59,016 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] Derived loop invariant: (((\old(e) <= e && \old(e) + 128 <= 0) || (127 <= \old(e) && e <= \old(e))) || ((((m <= \old(m) && 0 == __retres4) && \old(e) <= e) && \old(m) <= m) && e <= \old(e))) || (forall base2flt_~m : int :: (base2flt_~m < \old(m) || \old(m) < base2flt_~m) || 0 < base2flt_~m % 4294967296) - InvariantResult [Line: 47]: Loop Invariant [2018-11-10 07:19:59,017 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 07:19:59,017 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 07:19:59,017 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 07:19:59,018 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 07:19:59,018 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 07:19:59,018 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] Derived loop invariant: (((\old(e) <= e && (forall base2flt_~m : int :: (base2flt_~m < \old(m) || \old(m) < base2flt_~m) || 0 < base2flt_~m % 4294967296)) && (\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: 147]: Loop Invariant [2018-11-10 07:19:59,018 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] [2018-11-10 07:19:59,018 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] [2018-11-10 07:19:59,019 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_mulflt_~a_6,QUANTIFIED] [2018-11-10 07:19:59,019 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] [2018-11-10 07:19:59,019 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] [2018-11-10 07:19:59,019 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_mulflt_~a_6,QUANTIFIED] Derived loop invariant: ((0 == __retres10 || (((\exists mulflt_~b : int :: mulflt_~b % 4294967296 <= \old(a) % 4294967296 && !(mulflt_~b % 4294967296 == 0)) && b % 4294967296 <= \old(a) % 4294967296) && a == \old(a))) || (b == \old(a) && !(\old(a) % 4294967296 == 0))) && ((\exists v_mulflt_~a_6 : int :: v_mulflt_~a_6 % 4294967296 < \old(b) % 4294967296) || (b == \old(b) && 0 == __retres10)) - InvariantResult [Line: 27]: Loop Invariant [2018-11-10 07:19:59,020 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 07:19:59,020 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 07:19:59,020 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 07:19:59,020 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 07:19:59,020 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 07:19:59,020 WARN L387 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 7 procedures, 74 locations, 1 error locations. SAFE Result, 8.7s OverallTime, 19 OverallIterations, 7 TraceHistogramMax, 4.1s AutomataDifference, 0.0s DeadEndRemovalTime, 1.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 1274 SDtfs, 824 SDslu, 8583 SDs, 0 SdLazy, 5006 SolverSat, 89 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1470 GetRequests, 1196 SyntacticMatches, 11 SemanticMatches, 263 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 704 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=4, 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, 19 MinimizatonAttempts, 342 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 362 PreInvPairs, 1147 NumberOfFragments, 259 HoareAnnotationTreeSize, 362 FomulaSimplifications, 6245994 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 18 FomulaSimplificationsInter, 24437 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 2575 NumberOfCodeBlocks, 2575 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 2539 ConstructedInterpolants, 36 QuantifiedInterpolants, 444685 SizeOfPredicates, 49 NumberOfNonLiveVariables, 3144 ConjunctsInSsa, 232 ConjunctsInUnsatCore, 36 InterpolantComputations, 5 PerfectInterpolantSequences, 1198/2084 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...