./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/loop-invgen/sendmail-close-angle_true-unreach-call_true-termination.i --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_a121322a-706c-43ee-9d14-27798a70d03e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a121322a-706c-43ee-9d14-27798a70d03e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a121322a-706c-43ee-9d14-27798a70d03e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a121322a-706c-43ee-9d14-27798a70d03e/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-invgen/sendmail-close-angle_true-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a121322a-706c-43ee-9d14-27798a70d03e/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a121322a-706c-43ee-9d14-27798a70d03e/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 305e9c546a6cc2591d6267bc612ab5ec3e8adaa4 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-09 22:23:04,852 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-09 22:23:04,853 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-09 22:23:04,859 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-09 22:23:04,859 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-09 22:23:04,860 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-09 22:23:04,861 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-09 22:23:04,862 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-09 22:23:04,863 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-09 22:23:04,863 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-09 22:23:04,864 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-09 22:23:04,864 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-09 22:23:04,865 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-09 22:23:04,865 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-09 22:23:04,866 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-09 22:23:04,866 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-09 22:23:04,867 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-09 22:23:04,868 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-09 22:23:04,869 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-09 22:23:04,870 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-09 22:23:04,871 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-09 22:23:04,871 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-09 22:23:04,872 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-09 22:23:04,872 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-09 22:23:04,873 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-09 22:23:04,873 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-09 22:23:04,874 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-09 22:23:04,874 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-09 22:23:04,875 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-09 22:23:04,875 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-09 22:23:04,875 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-09 22:23:04,876 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-09 22:23:04,876 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-09 22:23:04,876 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-09 22:23:04,877 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-09 22:23:04,878 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-09 22:23:04,878 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a121322a-706c-43ee-9d14-27798a70d03e/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-09 22:23:04,885 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-09 22:23:04,885 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-09 22:23:04,885 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-09 22:23:04,885 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-09 22:23:04,886 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-09 22:23:04,886 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-09 22:23:04,886 INFO L133 SettingsManager]: * Use SBE=true [2018-11-09 22:23:04,886 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-09 22:23:04,886 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-09 22:23:04,887 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-09 22:23:04,887 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-09 22:23:04,887 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-09 22:23:04,887 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-09 22:23:04,887 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-09 22:23:04,887 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-09 22:23:04,887 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-09 22:23:04,887 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-09 22:23:04,888 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-09 22:23:04,888 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-09 22:23:04,888 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-09 22:23:04,888 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-09 22:23:04,888 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-09 22:23:04,888 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-09 22:23:04,888 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-09 22:23:04,889 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-09 22:23:04,889 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-09 22:23:04,889 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-09 22:23:04,889 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-09 22:23:04,889 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-09 22:23:04,889 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_a121322a-706c-43ee-9d14-27798a70d03e/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 -> 305e9c546a6cc2591d6267bc612ab5ec3e8adaa4 [2018-11-09 22:23:04,913 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-09 22:23:04,922 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-09 22:23:04,924 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-09 22:23:04,925 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-09 22:23:04,926 INFO L276 PluginConnector]: CDTParser initialized [2018-11-09 22:23:04,926 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a121322a-706c-43ee-9d14-27798a70d03e/bin-2019/uautomizer/../../sv-benchmarks/c/loop-invgen/sendmail-close-angle_true-unreach-call_true-termination.i [2018-11-09 22:23:04,965 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a121322a-706c-43ee-9d14-27798a70d03e/bin-2019/uautomizer/data/af3ed139c/9e485a6be0ec4a45a4cc8a61d4dffe11/FLAGde6e9ddb4 [2018-11-09 22:23:05,380 INFO L298 CDTParser]: Found 1 translation units. [2018-11-09 22:23:05,380 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a121322a-706c-43ee-9d14-27798a70d03e/sv-benchmarks/c/loop-invgen/sendmail-close-angle_true-unreach-call_true-termination.i [2018-11-09 22:23:05,386 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a121322a-706c-43ee-9d14-27798a70d03e/bin-2019/uautomizer/data/af3ed139c/9e485a6be0ec4a45a4cc8a61d4dffe11/FLAGde6e9ddb4 [2018-11-09 22:23:05,398 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a121322a-706c-43ee-9d14-27798a70d03e/bin-2019/uautomizer/data/af3ed139c/9e485a6be0ec4a45a4cc8a61d4dffe11 [2018-11-09 22:23:05,400 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-09 22:23:05,402 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-09 22:23:05,403 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-09 22:23:05,403 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-09 22:23:05,406 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-09 22:23:05,407 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:23:05" (1/1) ... [2018-11-09 22:23:05,409 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32089edc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:23:05, skipping insertion in model container [2018-11-09 22:23:05,409 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:23:05" (1/1) ... [2018-11-09 22:23:05,417 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-09 22:23:05,434 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-09 22:23:05,557 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-09 22:23:05,559 INFO L189 MainTranslator]: Completed pre-run [2018-11-09 22:23:05,570 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-09 22:23:05,578 INFO L193 MainTranslator]: Completed translation [2018-11-09 22:23:05,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:23:05 WrapperNode [2018-11-09 22:23:05,578 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-09 22:23:05,578 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-09 22:23:05,579 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-09 22:23:05,579 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-09 22:23:05,586 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:23:05" (1/1) ... [2018-11-09 22:23:05,586 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:23:05" (1/1) ... [2018-11-09 22:23:05,589 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:23:05" (1/1) ... [2018-11-09 22:23:05,589 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:23:05" (1/1) ... [2018-11-09 22:23:05,592 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:23:05" (1/1) ... [2018-11-09 22:23:05,595 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:23:05" (1/1) ... [2018-11-09 22:23:05,596 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:23:05" (1/1) ... [2018-11-09 22:23:05,597 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-09 22:23:05,597 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-09 22:23:05,597 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-09 22:23:05,597 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-09 22:23:05,598 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:23:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a121322a-706c-43ee-9d14-27798a70d03e/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-09 22:23:05,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-09 22:23:05,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-09 22:23:05,665 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-09 22:23:05,666 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-09 22:23:05,666 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-09 22:23:05,666 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-09 22:23:05,666 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-09 22:23:05,666 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-09 22:23:05,666 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-09 22:23:05,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-09 22:23:05,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-09 22:23:05,790 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-09 22:23:05,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:23:05 BoogieIcfgContainer [2018-11-09 22:23:05,791 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-09 22:23:05,791 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-09 22:23:05,791 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-09 22:23:05,793 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-09 22:23:05,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:23:05" (1/3) ... [2018-11-09 22:23:05,793 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@163f0c26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:23:05, skipping insertion in model container [2018-11-09 22:23:05,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:23:05" (2/3) ... [2018-11-09 22:23:05,794 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@163f0c26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:23:05, skipping insertion in model container [2018-11-09 22:23:05,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:23:05" (3/3) ... [2018-11-09 22:23:05,795 INFO L112 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle_true-unreach-call_true-termination.i [2018-11-09 22:23:05,800 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-09 22:23:05,805 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-09 22:23:05,814 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-09 22:23:05,832 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-09 22:23:05,833 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-09 22:23:05,833 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-09 22:23:05,833 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-09 22:23:05,833 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-09 22:23:05,833 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-09 22:23:05,833 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-09 22:23:05,833 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-09 22:23:05,833 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-09 22:23:05,845 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-11-09 22:23:05,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-09 22:23:05,849 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:23:05,850 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:23:05,852 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:23:05,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:23:05,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1538012201, now seen corresponding path program 1 times [2018-11-09 22:23:05,857 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:23:05,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:23:05,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:23:05,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:23:05,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:23:05,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:23:05,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 22:23:05,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:23:05,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-09 22:23:05,933 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-09 22:23:05,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-09 22:23:05,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-09 22:23:05,942 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2018-11-09 22:23:05,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:23:05,956 INFO L93 Difference]: Finished difference Result 63 states and 94 transitions. [2018-11-09 22:23:05,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-09 22:23:05,957 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-09 22:23:05,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:23:05,963 INFO L225 Difference]: With dead ends: 63 [2018-11-09 22:23:05,963 INFO L226 Difference]: Without dead ends: 30 [2018-11-09 22:23:05,965 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-09 22:23:05,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-09 22:23:05,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-09 22:23:05,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-09 22:23:05,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2018-11-09 22:23:05,991 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 14 [2018-11-09 22:23:05,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:23:05,992 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2018-11-09 22:23:05,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-09 22:23:05,992 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2018-11-09 22:23:05,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-09 22:23:05,993 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:23:05,993 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:23:05,994 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:23:05,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:23:05,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1856547447, now seen corresponding path program 1 times [2018-11-09 22:23:05,994 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:23:05,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:23:05,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:23:05,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:23:05,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:23:06,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:23:06,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 22:23:06,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:23:06,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-09 22:23:06,052 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-09 22:23:06,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-09 22:23:06,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-09 22:23:06,053 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand 5 states. [2018-11-09 22:23:06,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:23:06,146 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2018-11-09 22:23:06,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-09 22:23:06,146 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-09 22:23:06,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:23:06,147 INFO L225 Difference]: With dead ends: 36 [2018-11-09 22:23:06,147 INFO L226 Difference]: Without dead ends: 34 [2018-11-09 22:23:06,147 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-09 22:23:06,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-09 22:23:06,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-09 22:23:06,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-09 22:23:06,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2018-11-09 22:23:06,153 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 16 [2018-11-09 22:23:06,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:23:06,153 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2018-11-09 22:23:06,153 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-09 22:23:06,153 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2018-11-09 22:23:06,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-09 22:23:06,154 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:23:06,154 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:23:06,154 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:23:06,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:23:06,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1929535109, now seen corresponding path program 1 times [2018-11-09 22:23:06,155 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:23:06,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:23:06,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:23:06,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:23:06,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:23:06,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:23:06,266 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 22:23:06,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 22:23:06,266 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a121322a-706c-43ee-9d14-27798a70d03e/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-09 22:23:06,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:23:06,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:23:06,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 22:23:06,358 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 22:23:06,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-09 22:23:06,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 11 [2018-11-09 22:23:06,374 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-09 22:23:06,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-09 22:23:06,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-11-09 22:23:06,375 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand 11 states. [2018-11-09 22:23:06,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:23:06,536 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2018-11-09 22:23:06,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-09 22:23:06,536 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2018-11-09 22:23:06,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:23:06,537 INFO L225 Difference]: With dead ends: 54 [2018-11-09 22:23:06,538 INFO L226 Difference]: Without dead ends: 52 [2018-11-09 22:23:06,538 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2018-11-09 22:23:06,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-09 22:23:06,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2018-11-09 22:23:06,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-09 22:23:06,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2018-11-09 22:23:06,547 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 21 [2018-11-09 22:23:06,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:23:06,548 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2018-11-09 22:23:06,548 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-09 22:23:06,548 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2018-11-09 22:23:06,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-09 22:23:06,549 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:23:06,549 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-09 22:23:06,549 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:23:06,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:23:06,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1060690802, now seen corresponding path program 1 times [2018-11-09 22:23:06,550 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:23:06,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:23:06,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:23:06,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:23:06,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:23:06,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:23:06,601 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-09 22:23:06,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 22:23:06,602 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a121322a-706c-43ee-9d14-27798a70d03e/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-09 22:23:06,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:23:06,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:23:06,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 22:23:06,642 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-09 22:23:06,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-09 22:23:06,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2018-11-09 22:23:06,657 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-09 22:23:06,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-09 22:23:06,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-09 22:23:06,658 INFO L87 Difference]: Start difference. First operand 50 states and 61 transitions. Second operand 10 states. [2018-11-09 22:23:06,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:23:06,804 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2018-11-09 22:23:06,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-09 22:23:06,805 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2018-11-09 22:23:06,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:23:06,806 INFO L225 Difference]: With dead ends: 61 [2018-11-09 22:23:06,806 INFO L226 Difference]: Without dead ends: 59 [2018-11-09 22:23:06,806 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-11-09 22:23:06,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-09 22:23:06,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 54. [2018-11-09 22:23:06,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-09 22:23:06,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2018-11-09 22:23:06,812 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 29 [2018-11-09 22:23:06,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:23:06,812 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2018-11-09 22:23:06,812 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-09 22:23:06,812 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2018-11-09 22:23:06,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-09 22:23:06,813 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:23:06,813 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:23:06,814 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:23:06,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:23:06,814 INFO L82 PathProgramCache]: Analyzing trace with hash 578348401, now seen corresponding path program 1 times [2018-11-09 22:23:06,814 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:23:06,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:23:06,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:23:06,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:23:06,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:23:06,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:23:06,898 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-09 22:23:06,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 22:23:06,899 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a121322a-706c-43ee-9d14-27798a70d03e/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-09 22:23:06,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:23:06,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:23:06,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 22:23:06,964 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-09 22:23:06,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-09 22:23:06,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 13 [2018-11-09 22:23:06,980 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-09 22:23:06,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-09 22:23:06,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-11-09 22:23:06,981 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand 13 states. [2018-11-09 22:23:07,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:23:07,182 INFO L93 Difference]: Finished difference Result 77 states and 95 transitions. [2018-11-09 22:23:07,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-09 22:23:07,183 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2018-11-09 22:23:07,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:23:07,183 INFO L225 Difference]: With dead ends: 77 [2018-11-09 22:23:07,184 INFO L226 Difference]: Without dead ends: 70 [2018-11-09 22:23:07,184 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2018-11-09 22:23:07,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-09 22:23:07,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2018-11-09 22:23:07,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-09 22:23:07,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 81 transitions. [2018-11-09 22:23:07,193 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 81 transitions. Word has length 32 [2018-11-09 22:23:07,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:23:07,194 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 81 transitions. [2018-11-09 22:23:07,194 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-09 22:23:07,194 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2018-11-09 22:23:07,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-09 22:23:07,194 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:23:07,195 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:23:07,195 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:23:07,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:23:07,195 INFO L82 PathProgramCache]: Analyzing trace with hash 434465614, now seen corresponding path program 1 times [2018-11-09 22:23:07,195 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:23:07,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:23:07,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:23:07,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:23:07,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:23:07,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:23:07,252 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-09 22:23:07,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 22:23:07,253 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a121322a-706c-43ee-9d14-27798a70d03e/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-09 22:23:07,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:23:07,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:23:07,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 22:23:07,332 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-09 22:23:07,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-09 22:23:07,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 14 [2018-11-09 22:23:07,358 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-09 22:23:07,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-09 22:23:07,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-11-09 22:23:07,359 INFO L87 Difference]: Start difference. First operand 68 states and 81 transitions. Second operand 14 states. [2018-11-09 22:23:07,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:23:07,512 INFO L93 Difference]: Finished difference Result 79 states and 92 transitions. [2018-11-09 22:23:07,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-09 22:23:07,512 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2018-11-09 22:23:07,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:23:07,513 INFO L225 Difference]: With dead ends: 79 [2018-11-09 22:23:07,513 INFO L226 Difference]: Without dead ends: 77 [2018-11-09 22:23:07,513 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2018-11-09 22:23:07,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-09 22:23:07,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2018-11-09 22:23:07,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-09 22:23:07,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2018-11-09 22:23:07,519 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 34 [2018-11-09 22:23:07,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:23:07,520 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2018-11-09 22:23:07,520 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-09 22:23:07,520 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2018-11-09 22:23:07,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-09 22:23:07,521 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:23:07,521 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 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] [2018-11-09 22:23:07,521 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:23:07,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:23:07,521 INFO L82 PathProgramCache]: Analyzing trace with hash -2058374368, now seen corresponding path program 1 times [2018-11-09 22:23:07,522 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:23:07,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:23:07,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:23:07,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:23:07,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:23:07,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:23:07,632 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 24 proven. 23 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-11-09 22:23:07,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 22:23:07,633 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a121322a-706c-43ee-9d14-27798a70d03e/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-09 22:23:07,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:23:07,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:23:07,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 22:23:07,770 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 13 proven. 22 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-09 22:23:07,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-09 22:23:07,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2018-11-09 22:23:07,786 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-09 22:23:07,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-09 22:23:07,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2018-11-09 22:23:07,787 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand 18 states. [2018-11-09 22:23:08,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:23:08,124 INFO L93 Difference]: Finished difference Result 112 states and 140 transitions. [2018-11-09 22:23:08,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-09 22:23:08,125 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 58 [2018-11-09 22:23:08,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:23:08,127 INFO L225 Difference]: With dead ends: 112 [2018-11-09 22:23:08,127 INFO L226 Difference]: Without dead ends: 100 [2018-11-09 22:23:08,128 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=469, Unknown=0, NotChecked=0, Total=600 [2018-11-09 22:23:08,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-09 22:23:08,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-11-09 22:23:08,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-09 22:23:08,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 118 transitions. [2018-11-09 22:23:08,136 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 118 transitions. Word has length 58 [2018-11-09 22:23:08,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:23:08,136 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 118 transitions. [2018-11-09 22:23:08,136 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-09 22:23:08,136 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 118 transitions. [2018-11-09 22:23:08,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-09 22:23:08,139 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:23:08,139 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:23:08,139 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:23:08,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:23:08,139 INFO L82 PathProgramCache]: Analyzing trace with hash 574589245, now seen corresponding path program 1 times [2018-11-09 22:23:08,139 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:23:08,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:23:08,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:23:08,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:23:08,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:23:08,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:23:08,219 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 13 proven. 29 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-09 22:23:08,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 22:23:08,219 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a121322a-706c-43ee-9d14-27798a70d03e/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-09 22:23:08,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:23:08,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:23:08,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 22:23:08,295 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-09 22:23:08,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-09 22:23:08,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2018-11-09 22:23:08,315 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-09 22:23:08,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-09 22:23:08,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-11-09 22:23:08,315 INFO L87 Difference]: Start difference. First operand 100 states and 118 transitions. Second operand 16 states. [2018-11-09 22:23:08,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:23:08,494 INFO L93 Difference]: Finished difference Result 106 states and 123 transitions. [2018-11-09 22:23:08,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-09 22:23:08,495 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 60 [2018-11-09 22:23:08,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:23:08,496 INFO L225 Difference]: With dead ends: 106 [2018-11-09 22:23:08,496 INFO L226 Difference]: Without dead ends: 104 [2018-11-09 22:23:08,497 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2018-11-09 22:23:08,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-09 22:23:08,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-11-09 22:23:08,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-09 22:23:08,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 121 transitions. [2018-11-09 22:23:08,509 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 121 transitions. Word has length 60 [2018-11-09 22:23:08,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:23:08,509 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 121 transitions. [2018-11-09 22:23:08,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-09 22:23:08,511 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 121 transitions. [2018-11-09 22:23:08,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-09 22:23:08,512 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:23:08,512 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:23:08,512 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:23:08,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:23:08,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1079113108, now seen corresponding path program 2 times [2018-11-09 22:23:08,512 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:23:08,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:23:08,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:23:08,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:23:08,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:23:08,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:23:08,588 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 44 proven. 50 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2018-11-09 22:23:08,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 22:23:08,589 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a121322a-706c-43ee-9d14-27798a70d03e/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-09 22:23:08,593 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-09 22:23:08,614 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-09 22:23:08,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-09 22:23:08,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 22:23:08,803 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 68 proven. 38 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2018-11-09 22:23:08,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-09 22:23:08,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 20 [2018-11-09 22:23:08,821 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-09 22:23:08,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-09 22:23:08,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2018-11-09 22:23:08,821 INFO L87 Difference]: Start difference. First operand 104 states and 121 transitions. Second operand 20 states. [2018-11-09 22:23:09,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:23:09,187 INFO L93 Difference]: Finished difference Result 115 states and 132 transitions. [2018-11-09 22:23:09,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-09 22:23:09,187 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 86 [2018-11-09 22:23:09,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:23:09,188 INFO L225 Difference]: With dead ends: 115 [2018-11-09 22:23:09,188 INFO L226 Difference]: Without dead ends: 113 [2018-11-09 22:23:09,189 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 80 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=242, Invalid=1018, Unknown=0, NotChecked=0, Total=1260 [2018-11-09 22:23:09,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-09 22:23:09,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 108. [2018-11-09 22:23:09,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-09 22:23:09,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 124 transitions. [2018-11-09 22:23:09,198 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 124 transitions. Word has length 86 [2018-11-09 22:23:09,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:23:09,199 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 124 transitions. [2018-11-09 22:23:09,199 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-09 22:23:09,199 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 124 transitions. [2018-11-09 22:23:09,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-09 22:23:09,200 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:23:09,201 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:23:09,201 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:23:09,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:23:09,201 INFO L82 PathProgramCache]: Analyzing trace with hash -795584450, now seen corresponding path program 2 times [2018-11-09 22:23:09,201 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:23:09,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:23:09,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:23:09,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 22:23:09,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:23:09,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:23:09,320 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 64 proven. 81 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2018-11-09 22:23:09,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 22:23:09,320 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a121322a-706c-43ee-9d14-27798a70d03e/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-09 22:23:09,326 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-09 22:23:09,343 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-09 22:23:09,343 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-09 22:23:09,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 22:23:09,498 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 118 proven. 29 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2018-11-09 22:23:09,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-09 22:23:09,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 20 [2018-11-09 22:23:09,514 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-09 22:23:09,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-09 22:23:09,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2018-11-09 22:23:09,515 INFO L87 Difference]: Start difference. First operand 108 states and 124 transitions. Second operand 20 states. [2018-11-09 22:23:09,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:23:09,884 INFO L93 Difference]: Finished difference Result 108 states and 124 transitions. [2018-11-09 22:23:09,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-09 22:23:09,885 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 110 [2018-11-09 22:23:09,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:23:09,885 INFO L225 Difference]: With dead ends: 108 [2018-11-09 22:23:09,885 INFO L226 Difference]: Without dead ends: 0 [2018-11-09 22:23:09,886 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 102 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=197, Invalid=795, Unknown=0, NotChecked=0, Total=992 [2018-11-09 22:23:09,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-09 22:23:09,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-09 22:23:09,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-09 22:23:09,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-09 22:23:09,887 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 110 [2018-11-09 22:23:09,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:23:09,887 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-09 22:23:09,887 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-09 22:23:09,887 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-09 22:23:09,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-09 22:23:09,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-09 22:23:09,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 22:23:09,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 22:23:10,483 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-09 22:23:10,483 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-09 22:23:10,483 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-09 22:23:10,483 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-09 22:23:10,483 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-09 22:23:10,484 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-09 22:23:10,484 INFO L421 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (let ((.cse5 (+ main_~buflim~0 2))) (let ((.cse0 (<= (+ main_~bufferlen~0 1) main_~inlen~0)) (.cse2 (<= 1 main_~in~0)) (.cse3 (<= (+ main_~buf~0 3) main_~bufferlen~0)) (.cse4 (<= .cse5 main_~bufferlen~0)) (.cse1 (<= main_~bufferlen~0 .cse5))) (or (and .cse0 (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) .cse1 (<= 3 main_~buf~0) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4 (<= main_~in~0 1) .cse1 (<= 1 main_~buf~0)) (and .cse0 (<= 0 main_~in~0) (<= main_~in~0 0) .cse3 (= main_~bufferlen~0 .cse5) (= main_~buf~0 0)) (and .cse0 .cse2 .cse3 .cse4 (<= main_~in~0 2) .cse1 (<= 2 main_~buf~0))))) [2018-11-09 22:23:10,484 INFO L421 ceAbstractionStarter]: At program point L27-1(line 27) the Hoare annotation is: (let ((.cse5 (+ main_~buflim~0 2))) (let ((.cse2 (<= 1 main_~in~0)) (.cse4 (<= .cse5 main_~bufferlen~0)) (.cse1 (<= main_~bufferlen~0 .cse5)) (.cse0 (<= (+ main_~bufferlen~0 1) main_~inlen~0)) (.cse3 (<= (+ main_~buf~0 3) main_~bufferlen~0))) (or (and .cse0 (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) .cse1 (<= 3 main_~buf~0) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4 (<= main_~in~0 1) .cse1 (<= 1 main_~buf~0)) (and .cse0 .cse2 .cse3 .cse4 (<= main_~in~0 2) .cse1 (<= 2 main_~buf~0)) (and .cse0 (<= 0 main_~in~0) (<= main_~in~0 0) .cse3 (= main_~bufferlen~0 .cse5) (= main_~buf~0 0))))) [2018-11-09 22:23:10,484 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 42) no Hoare annotation was computed. [2018-11-09 22:23:10,484 INFO L425 ceAbstractionStarter]: For program point L23-1(lines 23 34) no Hoare annotation was computed. [2018-11-09 22:23:10,484 INFO L425 ceAbstractionStarter]: For program point L23-2(lines 23 34) no Hoare annotation was computed. [2018-11-09 22:23:10,484 INFO L425 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2018-11-09 22:23:10,484 INFO L421 ceAbstractionStarter]: At program point L23-4(lines 23 34) the Hoare annotation is: (let ((.cse2 (<= 1 main_~in~0)) (.cse0 (<= 0 main_~buf~0)) (.cse3 (<= (+ main_~buf~0 2) main_~bufferlen~0))) (or (and (<= main_~buf~0 0) (<= 0 main_~in~0) .cse0 (<= 2 main_~bufferlen~0)) (let ((.cse1 (+ main_~buflim~0 2))) (and (<= (+ main_~bufferlen~0 1) main_~inlen~0) (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (<= main_~bufferlen~0 .cse1) .cse2 .cse0 (<= .cse1 main_~bufferlen~0) .cse3)) (and (<= main_~buf~0 2) .cse2 .cse0 (<= 3 main_~inlen~0) .cse3))) [2018-11-09 22:23:10,485 INFO L425 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2018-11-09 22:23:10,485 INFO L421 ceAbstractionStarter]: At program point L32(line 32) the Hoare annotation is: (let ((.cse5 (+ main_~buflim~0 2))) (let ((.cse4 (<= (+ main_~buf~0 2) main_~bufferlen~0)) (.cse0 (<= (+ main_~bufferlen~0 1) main_~inlen~0)) (.cse1 (<= 1 main_~in~0)) (.cse2 (<= .cse5 main_~bufferlen~0)) (.cse3 (<= main_~bufferlen~0 .cse5))) (or (and .cse0 .cse1 .cse2 (<= main_~in~0 2) .cse3 .cse4 (<= 2 main_~buf~0)) (and .cse0 (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) .cse3 (<= 3 main_~buf~0) .cse1 .cse2 .cse4) (and .cse0 .cse1 .cse2 (<= main_~in~0 1) .cse3 (<= 1 main_~buf~0) (< main_~buf~0 (+ main_~buflim~0 1)))))) [2018-11-09 22:23:10,485 INFO L421 ceAbstractionStarter]: At program point L32-1(line 32) the Hoare annotation is: (let ((.cse5 (+ main_~buflim~0 2))) (let ((.cse4 (<= (+ main_~buf~0 2) main_~bufferlen~0)) (.cse0 (<= (+ main_~bufferlen~0 1) main_~inlen~0)) (.cse1 (<= 1 main_~in~0)) (.cse2 (<= .cse5 main_~bufferlen~0)) (.cse3 (<= main_~bufferlen~0 .cse5))) (or (and .cse0 .cse1 .cse2 (<= main_~in~0 2) .cse3 .cse4 (<= 2 main_~buf~0)) (and .cse0 (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) .cse3 (<= 3 main_~buf~0) .cse1 .cse2 .cse4) (and .cse0 .cse1 .cse2 (<= main_~in~0 1) .cse3 (<= 1 main_~buf~0) (< main_~buf~0 (+ main_~buflim~0 1)))))) [2018-11-09 22:23:10,485 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-11-09 22:23:10,485 INFO L428 ceAbstractionStarter]: At program point L41(lines 11 42) the Hoare annotation is: true [2018-11-09 22:23:10,485 INFO L421 ceAbstractionStarter]: At program point L33(lines 23 34) the Hoare annotation is: (let ((.cse5 (+ main_~buflim~0 2))) (let ((.cse4 (<= (+ main_~buf~0 2) main_~bufferlen~0)) (.cse0 (<= (+ main_~bufferlen~0 1) main_~inlen~0)) (.cse1 (<= 1 main_~in~0)) (.cse2 (<= .cse5 main_~bufferlen~0)) (.cse3 (<= main_~bufferlen~0 .cse5))) (or (and .cse0 .cse1 .cse2 (<= main_~in~0 2) .cse3 .cse4 (<= 2 main_~buf~0)) (and .cse0 (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) .cse3 (<= 3 main_~buf~0) .cse1 .cse2 .cse4) (and .cse0 .cse3 (<= 0 main_~in~0) .cse2 (<= main_~in~0 0) (= main_~buf~0 0) (<= 2 main_~bufferlen~0)) (and .cse0 .cse1 .cse2 (<= main_~in~0 1) .cse3 (<= 1 main_~buf~0) (< main_~buf~0 (+ main_~buflim~0 1)))))) [2018-11-09 22:23:10,485 INFO L425 ceAbstractionStarter]: For program point L25(lines 25 26) no Hoare annotation was computed. [2018-11-09 22:23:10,485 INFO L425 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2018-11-09 22:23:10,485 INFO L425 ceAbstractionStarter]: For program point L17-1(lines 11 42) no Hoare annotation was computed. [2018-11-09 22:23:10,485 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 42) no Hoare annotation was computed. [2018-11-09 22:23:10,485 INFO L421 ceAbstractionStarter]: At program point L38(line 38) the Hoare annotation is: (let ((.cse0 (and (<= 0 main_~in~0) (<= 0 main_~buf~0)))) (or (and (<= (+ main_~buf~0 1) main_~bufferlen~0) (and (<= 3 main_~inlen~0) .cse0) (< 1 main_~bufferlen~0)) (and (<= main_~buf~0 1) .cse0 (<= 2 main_~bufferlen~0)))) [2018-11-09 22:23:10,485 INFO L421 ceAbstractionStarter]: At program point L38-1(line 38) the Hoare annotation is: (let ((.cse0 (and (<= 0 main_~in~0) (<= 0 main_~buf~0)))) (or (and (<= (+ main_~buf~0 1) main_~bufferlen~0) (and (<= 3 main_~inlen~0) .cse0) (< 1 main_~bufferlen~0)) (and (<= main_~buf~0 1) .cse0 (<= 2 main_~bufferlen~0)))) [2018-11-09 22:23:10,485 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 31) no Hoare annotation was computed. [2018-11-09 22:23:10,485 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 42) the Hoare annotation is: true [2018-11-09 22:23:10,485 INFO L425 ceAbstractionStarter]: For program point L18(lines 11 42) no Hoare annotation was computed. [2018-11-09 22:23:10,485 INFO L425 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-11-09 22:23:10,486 INFO L421 ceAbstractionStarter]: At program point L35(line 35) the Hoare annotation is: (let ((.cse2 (<= 1 main_~in~0)) (.cse0 (<= 0 main_~buf~0)) (.cse3 (<= (+ main_~buf~0 2) main_~bufferlen~0))) (or (and (<= main_~buf~0 0) (<= 0 main_~in~0) .cse0 (<= 2 main_~bufferlen~0)) (let ((.cse1 (+ main_~buflim~0 2))) (and (<= (+ main_~bufferlen~0 1) main_~inlen~0) (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (<= main_~bufferlen~0 .cse1) .cse2 .cse0 (<= .cse1 main_~bufferlen~0) .cse3)) (and (<= main_~buf~0 2) .cse2 .cse0 (<= 3 main_~inlen~0) .cse3))) [2018-11-09 22:23:10,486 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-09 22:23:10,486 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-09 22:23:10,486 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-09 22:23:10,486 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-09 22:23:10,486 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-09 22:23:10,486 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-09 22:23:10,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:23:10 BoogieIcfgContainer [2018-11-09 22:23:10,494 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-09 22:23:10,495 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-09 22:23:10,495 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-09 22:23:10,495 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-09 22:23:10,495 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:23:05" (3/4) ... [2018-11-09 22:23:10,497 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-09 22:23:10,501 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-09 22:23:10,501 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-09 22:23:10,501 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-09 22:23:10,504 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2018-11-09 22:23:10,504 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-09 22:23:10,504 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-09 22:23:10,534 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a121322a-706c-43ee-9d14-27798a70d03e/bin-2019/uautomizer/witness.graphml [2018-11-09 22:23:10,534 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-09 22:23:10,535 INFO L168 Benchmark]: Toolchain (without parser) took 5134.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 182.5 MB). Free memory was 955.0 MB in the beginning and 892.9 MB in the end (delta: 62.1 MB). Peak memory consumption was 244.5 MB. Max. memory is 11.5 GB. [2018-11-09 22:23:10,536 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 980.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-09 22:23:10,536 INFO L168 Benchmark]: CACSL2BoogieTranslator took 175.64 ms. Allocated memory is still 1.0 GB. Free memory was 955.0 MB in the beginning and 944.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-09 22:23:10,536 INFO L168 Benchmark]: Boogie Preprocessor took 18.26 ms. Allocated memory is still 1.0 GB. Free memory is still 944.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-09 22:23:10,536 INFO L168 Benchmark]: RCFGBuilder took 193.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 944.2 MB in the beginning and 1.1 GB in the end (delta: -180.9 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-11-09 22:23:10,537 INFO L168 Benchmark]: TraceAbstraction took 4703.33 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 45.1 MB). Free memory was 1.1 GB in the beginning and 892.9 MB in the end (delta: 232.3 MB). Peak memory consumption was 277.4 MB. Max. memory is 11.5 GB. [2018-11-09 22:23:10,537 INFO L168 Benchmark]: Witness Printer took 39.93 ms. Allocated memory is still 1.2 GB. Free memory is still 892.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-09 22:23:10,539 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 980.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 175.64 ms. Allocated memory is still 1.0 GB. Free memory was 955.0 MB in the beginning and 944.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.26 ms. Allocated memory is still 1.0 GB. Free memory is still 944.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 193.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 944.2 MB in the beginning and 1.1 GB in the end (delta: -180.9 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4703.33 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 45.1 MB). Free memory was 1.1 GB in the beginning and 892.9 MB in the end (delta: 232.3 MB). Peak memory consumption was 277.4 MB. Max. memory is 11.5 GB. * Witness Printer took 39.93 ms. Allocated memory is still 1.2 GB. Free memory is still 892.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: 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: 23]: Loop Invariant Derived loop invariant: ((((((((bufferlen + 1 <= inlen && 1 <= in) && buflim + 2 <= bufferlen) && in <= 2) && bufferlen <= buflim + 2) && buf + 2 <= bufferlen) && 2 <= buf) || ((((((bufferlen + 1 <= inlen && in + bufferlen + 1 <= buf + inlen) && bufferlen <= buflim + 2) && 3 <= buf) && 1 <= in) && buflim + 2 <= bufferlen) && buf + 2 <= bufferlen)) || ((((((bufferlen + 1 <= inlen && bufferlen <= buflim + 2) && 0 <= in) && buflim + 2 <= bufferlen) && in <= 0) && buf == 0) && 2 <= bufferlen)) || ((((((bufferlen + 1 <= inlen && 1 <= in) && buflim + 2 <= bufferlen) && in <= 1) && bufferlen <= buflim + 2) && 1 <= buf) && buf < buflim + 1) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 36 locations, 1 error locations. SAFE Result, 4.6s OverallTime, 10 OverallIterations, 16 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 309 SDtfs, 461 SDslu, 1933 SDs, 0 SdLazy, 2421 SolverSat, 485 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 584 GetRequests, 403 SyntacticMatches, 14 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 791 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 19 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 58 PreInvPairs, 100 NumberOfFragments, 768 HoareAnnotationTreeSize, 58 FomulaSimplifications, 839 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 15 FomulaSimplificationsInter, 902 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 890 NumberOfCodeBlocks, 890 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 872 ConstructedInterpolants, 0 QuantifiedInterpolants, 263289 SizeOfPredicates, 27 NumberOfNonLiveVariables, 854 ConjunctsInSsa, 114 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 1731/2032 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...